Switch to: Citations

Add references

You must login to add references.
  1. Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.
    Direct download  
     
    Export citation  
     
    Bookmark   220 citations  
  • Algebraic Logic.Aubert Daigneault - 1962 - Journal of Symbolic Logic 27 (4):469-470.
    Direct download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
    Direct download  
     
    Export citation  
     
    Bookmark   105 citations  
  • Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.
    Direct download  
     
    Export citation  
     
    Bookmark   55 citations  
  • The modal logic of provability. The sequential approach.Giovanni Sambin & Silvio Valentini - 1982 - Journal of Philosophical Logic 11 (3):311 - 342.
  • An effective fixed-point theorem in intuitionistic diagonalizable algebras.Giovanni Sambin - 1976 - Studia Logica 35 (4):345 - 361.
    Within the technical frame supplied by the algebraic variety of diagonalizable algebras, defined by R. Magari in [2], we prove the following: Let T be any first-order theory with a predicate Pr satisfying the canonical derivability conditions, including Löb's property. Then any formula in T built up from the propositional variables $q,p_{1},...,p_{n}$ , using logical connectives and the predicate Pr, has the same "fixed-points" relative to q (that is, formulas $\psi (p_{1},...,p_{n})$ for which for all $p_{1},...,p_{n}\vdash _{T}\phi (\psi (p_{1},...,p_{n}),p_{1},...,p_{n})\leftrightarrow \psi (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  • The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
  • The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   39 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   594 citations  
  • Creative sets.John Myhill - 1955 - Mathematical Logic Quarterly 1 (2):97-108.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Creative sets.John Myhill - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (2):97-108.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Representation and duality theory for diagonalizable algebras.Roberto Magari - 1975 - Studia Logica 34 (4):305 - 313.
    The duality theory established by Halmos in [2] for boolean hemimorphism applies of course to the diagonalizable algebra, because ντν is an hemimorphism. For commodity in working on diagonalizable algebras we recall the basic facts and give the characteristic conditions on the dual of ντν.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  • The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
  • The predicate modal logic of provability.Franco Montagna - 1984 - Notre Dame Journal of Formal Logic 25 (2):179-189.
  • Fundamentals of Generalized Recursion Theory.Melvin Fitting - 1986 - Journal of Symbolic Logic 51 (4):1078-1079.
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   68 citations  
  • The fixed-point theorem for diagonalizable algebras.Claudio Bernardi - 1975 - Studia Logica 34 (3):239 - 251.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • On the equational class of diagonalizable algebras.Glaudio Bernardi - 1975 - Studia Logica 34 (4):321 - 331.
    It is well-known that, in Peano arithmetic, there exists a formula Theor (x) which numerates the set of theorems and that this formula satisfies Hilbert-Bernays derivability conditions. Recently R. Magari has suggested an algebraization of the properties of Theor, introducing the concept of diagonalizable algebra (see [7]): of course this algebraization can be applied to all these theories in which there exists a predicate with analogous properties. In this paper, by means of methods of universal algebra, we study the equational (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations