Switch to: Citations

Add references

You must login to add references.
  1. Events, instants and temporal reference.Hans Kamp - 1979 - In Rainer Bäuerle, Urs Egli & Arnim von Stechow (eds.), Semantics from different points of view. New York: Springer Verlag. pp. 376--418.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • On languages with two variables.Michael Mortimer - 1975 - Mathematical Logic Quarterly 21 (1):135-140.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • On the decision problem for two-variable first-order logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Expressiveness and completeness of an interval tense logic.Yde Venema - 1990 - Notre Dame Journal of Formal Logic 31 (4):529-547.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • A Road Map of Interval Temporal Logics and Duration Calculi.Valentin Goranko, Angelo Montanari & Guido Sciavicco - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):9-54.
    We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • A general tableau method for propositional interval temporal logics: Theory and implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). It combines (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Chronological Future Modality in Minkowski Spacetime.Ilya Shapirovsky & Valentin Shehtman - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 437-459.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
    The satisfiability problem for the two-variable fragment of first-order logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over finite and infinite domains in which one or several designated binary predicates are interpreted as arbitrary wellfounded relations. It is shown that FO 2 over ordered, respectively wellordered, domains or in the presence of one well-founded relation, is decidable for satisfiability as well as for finite satisfiability. Actually the complexity of these decision problems is essentially (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On The Decision Problem For Two-variable First-order Logic, By, Pages 53 -- 69.Erich Gr\"Adel, Phokion Kolaitis & Moshe Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • On the Decision Problem for Two-Variable First-Order Logic.Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
    We identify the computational complexity of the satisfiability problem for FO 2, the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite model. (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations