Automatization of proof-search for a fragment of the first-order linear tense logic

Romas Alonderis

doi:10.15388/LMR.2003.32469

Articles

Romas Alonderis

Institute of Mathematics and Informatics

Published 2003-12-22

https://doi.org/10.15388/LMR.2003.32469

PDF

How to Cite

Alonderis, R. (2003) “Automatization of proof-search for a fragment of the first-order linear tense logic”, Lietuvos matematikos rinkinys, 43(spec.), pp. 423–428. doi:10.15388/LMR.2003.32469.

Download Citation

Abstract

There is not abstract.

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, A sequent calculus for propositional temporal logic with time gaps , Lietuvos matematikos rinkinys: Vol. 52 (2011)
Romas Alonderis, Sequent calculus for propositional likelihood logic , Lietuvos matematikos rinkinys: Vol. 46 (2006)
Romas Alonderis, Completeness classes for intuitionistic first-order temporal logic with time gaps , Lietuvos matematikos rinkinys: Vol. 45 (2005)
Romas Alonderis, Relation between classical and intuitionistic sequent calculi of temporal logic , Lietuvos matematikos rinkinys: Vol. 41 (2001)
Romas Alonderis, Structural rules and cut admissibility in a sequent calculus of temporal logic with predicates = and > , Lietuvos matematikos rinkinys: Vol. 42 (2002)

<< < 1 2