Switch to: References

Add citations

You must login to add citations.
  1. Separation Logics and Modalities: A Survey.Stéphane Demri & Morgan Deters - 2015 - Journal of Applied Non-Classical Logics 25 (1):50-99.
    Like modal logic, temporal logic, and description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoare triples. In this survey, we present similarities between separation logic as an assertion language and modal and temporal logics. Moreover, we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Elija su propia Lógica.Carlos Areces - 2006 - Azafea: Revista de Filosofia 8 (1).
    En este artículo se sintetiza una visión moderna de las lógicas modales y temporales. En vez de dar una motivación histórica, el paper presenta estas lógicas en relación con ciertos fragmentos de la lógica de primer orden que poseen propiedades interesantes. Esta visión de la lógica es seductora porque nos permite diseñar lenguajes a medida, es decir, optimizados para una tarea específica.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  • 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 (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  • Syllogistic Logic with Comparative Adjectives.Lawrence S. Moss - 2011 - Journal of Logic, Language and Information 20 (3):397-417.
    This paper adds comparative adjectives to two systems of syllogistic logic. The comparatives are interpreted by transitive and irreflexive relations on the underlying domain. The main point is to obtain sound and complete axiomatizations of the valid formulas in the logics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Small Substructures and Decidability Issues for First-Order Logic with Two Variables.Emanuel Kieroński & Martin Otto - 2012 - Journal of Symbolic Logic 77 (3):729-765.
    We study first-order logic with two variables FO² and establish a small substructure property. Similar to the small model property for FO² we obtain an exponential size bound on embedded substructures, relative to a fixed surrounding structure that may be infinite. We apply this technique to analyse the satisfiability problem for FO² under constraints that require several binary relations to be interpreted as equivalence relations. With a single equivalence relation, FO² has the finite model property and is complete for non-deterministic (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
    Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions of almost all other known decidable fragments of first-order logic. Here, we investigate the computational complexity of these fragments. We (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • On the Restraining Power of Guards.Erich Grädel - 1999 - Journal of Symbolic Logic 64 (4):1719-1742.
    Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions (on the arity of relation symbols, the quantifier pattern or the number of variables) of almost all other known decidable (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   19 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 (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations