Switch to: Citations

Add references

You must login to add references.
  1. Arithmetization of Metamathematics in a General Setting.Solomon Feferman - 1960 - Journal of Symbolic Logic 31 (2):269-270.
    Download  
     
    Export citation  
     
    Bookmark   92 citations  
  • Systems of logic based on ordinals..Alan Turing - 1939 - London,: Printed by C.F. Hodgson & son.
    Download  
     
    Export citation  
     
    Bookmark   101 citations  
  • A course on bimodal provability logic.Albert Visser - 1995 - Annals of Pure and Applied Logic 73 (1):109-142.
    In this paper we study 1. the frame-theory of certain bimodal provability logics involving the reflection principle and we study2. certain specific bimodal logics with a provability predicate for a subtheory of Peano arithmetic axiomatized by a non-standardly finite number of axioms.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
    Download  
     
    Export citation  
     
    Bookmark   109 citations  
  • The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • The formalization of interpretability.Albert Visser - 1991 - Studia Logica 50 (1):81 - 105.
    This paper contains a careful derivation of principles of Interpretability Logic valid in extensions of I0+1.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • (1 other version)An Inside View of Exp; or, The Closed Fragment of the Provability Logic of IΔ0+ Ω1 with a Propositional Constant for.Albert Visser - 1992 - Journal of Symbolic Logic 57 (1):131-165.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
    Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (2 other versions)Review of Robert M. Solovay's Provability Interpretations of Modal Logic.George Boolos - 1981 - Journal of Symbolic Logic 46 (3):661-662.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Extension of an Effectively Generated Class of Functions by Enumeration.S. C. Kleene - 1960 - Journal of Symbolic Logic 25 (3):279-280.
    Download  
     
    Export citation  
     
    Bookmark   5 citations