On intuitionistic branching tense logic with weak induction

Romas Alonderis

doi:10.15388/LMD.1998.37921

Articles

Romas Alonderis

Institute of Mathematics and Informatics

Published 1998-12-14

https://doi.org/10.15388/LMD.1998.37921

PDF

How to Cite

Alonderis, R. (1998) “On intuitionistic branching tense logic with weak induction”, Lietuvos matematikos rinkinys, 38(II), pp. 295–301 . doi:10.15388/LMD.1998.37921.

Download Citation

Abstract

In the paper, the first-order branching tense logic calculus is given: LB J with the weak induction, that is to say with the axiom (A ∧ A O ☐ A) ⊃ ☐ A instead of the induction axiom (A ∧ ☐ (A ⊃ O A)) ⊃ ☐ A. The syntactical cut elimination theorem, Harrop's theorem and the interpolation theorem is proved here with respect to the LB J calculus.

PDF

This work is licensed under a Creative Commons Attribution 4.0 International License.

Downloads

Download data is not yet available.

Most read articles by the same author(s)

Romas Alonderis, Haroldas Giedra, A derivation-loop method for temporal logic , Lietuvos matematikos rinkinys: Vol. 60 (2019): Ser. A
Haroldas Giedra, Romas Alonderis, Applications of logic of correlated knowledge to quantum mechanics , Lietuvos matematikos rinkinys: Vol. 59 (2018): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Sequent systems for PLTL , Lietuvos matematikos rinkinys: Vol. 54 (2013): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Aida Pliuškevičienė, Finite sequent calculi for PLTL , Lietuvos matematikos rinkinys: Vol. 56 (2015): Ser. A
Romas Alonderis, A labeled sequent calculus for propositional linear time logic , Lietuvos matematikos rinkinys: Vol. 53 (2012): Ser. A
Romas Alonderis , Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus , Lietuvos matematikos rinkinys: Vol. 48 (2008)
Romas Alonderis, More efficient proof-search for sequents of temporal logic , Lietuvos matematikos rinkinys: Vol. 63 (2022): Ser. A
Romas Alonderis, Regimantas Pliuškevičius, Cut, invariant rule, and loop-check free sequent calculus for PLTL , Lietuvos matematikos rinkinys: Vol. 52 (2011)
Romas Alonderis, Brodsky’s coding method for propositional logic , Lietuvos matematikos rinkinys: Vol. 58 (2017): Ser. A
Romas Alonderis , Specialization of antecedent negation loop-rule for a fragment of propositional intuitionistic logic sequent calculus , Lietuvos matematikos rinkinys: Vol. 50 (2009)

1 2 > >>