Switch to: Citations

Add references

You must login to add references.
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • On superintuitionistic logics as fragments of proof logic extensions.A. V. Kuznetsov & A. Yu Muravitsky - 1986 - Studia Logica 45 (1):77 - 99.
    Coming fromI andCl, i.e. from intuitionistic and classical propositional calculi with the substitution rule postulated, and using the sign to add a new connective there have been considered here: Grzegorozyk's logicGrz, the proof logicG and the proof-intuitionistic logicI set up correspondingly by the calculiFor any calculus we denote by the set of all formulae of the calculus and by the lattice of all logics that are the extensions of the logic of the calculus, i.e. sets of formulae containing the axioms (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Choice and well-ordering.Peter Freyd - 1987 - Annals of Pure and Applied Logic 35 (C):149-166.
    Download  
     
    Export citation  
     
    Bookmark   6 citations