Switch to: References

Add citations

You must login to add citations.
  1. Provability logic-a short introduction.Per Lindström - 1996 - Theoria 62 (1-2):19-61.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The interpretability logic of all reasonable arithmetical theories.Joost J. Joosten & Albert Visser - 2000 - Erkenntnis 53 (1-2):3-26.
    This paper is a presentation of astatus quæstionis, to wit of the problemof the interpretability logic of all reasonablearithmetical theories.We present both the arithmetical side and themodal side of the question.Dedicated to Dick de Jongh on the occasion of his 60th birthday.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
    We investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILM ω . This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Simple Proof of Arithmetical Completeness for $\Pi_1$ -Conservativity Logic.Giorgi Japaridze - 1994 - Notre Dame Journal of Formal Logic 35 (3):346-354.
    Hájek and Montagna proved that the modal propositional logic ILM is the logic of -conservativity over sound theories containing I (PA with induction restricted to formulas). I give a simpler proof of the same fact.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Undecidability in diagonalizable algebras.V. Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
    If a formal theory T is able to reason about its own syntax, then the diagonalizable algebra of T is defined as its Lindenbaum sentence algebra endowed with a unary operator □ which sends a sentence φ to the sentence □φ asserting the provability of φ in T. We prove that the first order theories of diagonalizable algebras of a wide class of theories are undecidable and establish some related results.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On the logic of reducibility: Axioms and examples. [REVIEW]Karl-Georg Niebergall - 2000 - Erkenntnis 53 (1-2):27-61.
    This paper is an investigation into what could be a goodexplication of ``theory S is reducible to theory T''''. Ipresent an axiomatic approach to reducibility, which is developedmetamathematically and used to evaluate most of the definitionsof ``reducible'''' found in the relevant literature. Among these,relative interpretability turns out to be most convincing as ageneral reducibility concept, proof-theoreticalreducibility being its only serious competitor left. Thisrelation is analyzed in some detail, both from the point of viewof the reducibility axioms and of modal logic.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Interpretability in reflexive theories - a survey.Per Lindström - 1997 - Theoria 63 (3):182-209.
    Download  
     
    Export citation  
     
    Bookmark   3 citations