Order:
  1.  84
    PDL for Ordered Trees.Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Bertrand Gaiffe, Evan Goris, Maarten Marx & Maarten de Rijke - 2005 - Journal of Applied Non-Classical Logics 15 (2):115-135.
    This paper is about a special version of PDL, proposed by Marcus Kracht, for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, left- and right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semi-structured data, and, especially, in the field of query languages for XML documents, we revisit the language. This renewed interest comes with a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  20
    Modal Matters for Interpretability Logics.Evan Goris & Joost Joosten - 2008 - Logic Journal of the IGPL 16 (4):371-412.
    This paper is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the fundaments are laid for later results. These fundaments consist of a thorough treatment of a construction method to obtain modal models. This construction method is used to reprove some known results in the area of interpretability like the modal completeness of the logic IL. Next, the method is applied to obtain new results: the modal completeness (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  6
    A New Principle In The Interpretability Logic Of All Reasonable Arithmetical Theories.Evan Goris & Joost Joosten - 2011 - Logic Journal of the IGPL 19 (1):1-17.
    The interpretability logic of a mathematical theory describes the structural behavior of interpretations over that theory. Different theories have different logics. This paper revolves around the question what logic describes the behavior that is present in all theories with a minimum amount of arithmetic; the intersection over all such theories so to say. We denote this target logic by IL.In this paper we present a new principle R in IL. We show that R does not follow from the logic ILP0W* (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  9
    Two New Series of Principles in the Interpretability Logic of All Reasonable Arithmetical Theories.Evan Goris & Joost J. Joosten - 2020 - Journal of Symbolic Logic 85 (1):1-25.
    The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.The logic IL is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this article (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  7
    Self Provers and Σ1 Sentences.Evan Goris & Joost Joosten - 2012 - Logic Journal of the IGPL 20 (1):1-21.
    This paper is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this method, we obtained some completeness results, some already known, and some new. In this paper, we will set the construction method to work to obtain more results. First, the modal completeness of the logic ILM is proved using the construction method. This is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  16
    A Modal Provability Logic of Explicit and Implicit Proofs.Evan Goris - 2009 - Annals of Pure and Applied Logic 161 (3):388-403.
    We establish the bi-modal forgetful projection of the Logic of Proofs and Formal Provability GLA. That is to say, we present a normal bi-modal provability logic with modalities □ and whose theorems are precisely those formulas for which the implicit provability assertions represented by the modality can be realized by explicit proof terms.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7.  14
    Interpolation and the Interpretability Logic of PA.Evan Goris - 2006 - Notre Dame Journal of Formal Logic 47 (2):179-195.
    In this paper we will be concerned with the interpretability logic of PA and in particular with the fact that this logic, which is denoted by ILM, does not have the interpolation property. An example for this fact seems to emerge from the fact that ILM cannot express Σ₁-ness. This suggests a way to extend the expressive power of interpretability logic, namely, by an additional operator for Σ₁-ness, which might give us a logic with the interpolation property. We will formulate (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark