Switch to: Citations

Add references

You must login to add references.
  1. Some embedding theorems for modal logic.David Makinson - 1971 - Notre Dame Journal of Formal Logic 12 (2):252-254.
    Some results on the upper end of the lattice of all modal propositional logics.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Atoms in modal algebras.Fabio Bellissima - 1984 - Mathematical Logic Quarterly 30 (19‐24):303-312.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Atoms in Modal Algebras.Fabio Bellissima - 1984 - Mathematical Logic Quarterly 30 (19-24):303-312.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Characters and fixed-points in provability logic.Zachary Gleit & Warren Goldfarb - 1989 - Notre Dame Journal of Formal Logic 31 (1):26-36.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Reduction of tense logic to modal logic II.S. K. Thomason - 1975 - Theoria 41 (3):154-169.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reduction of tense logic to modal logic II.S. K. Thomason - 1974 - Theoria 40 (3):154-169.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Topology and duality in modal logic.Giovanni Sambin & Virginia Vaccaro - 1988 - Annals of Pure and Applied Logic 37 (3):249-296.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • On an interpretation of second order quantification in first order intuitionistic propositional logic.Andrew M. Pitts - 1992 - Journal of Symbolic Logic 57 (1):33-52.
    We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, built up from propositional variables (p,q,r,...) and falsity $(\perp)$ using conjunction $(\wedge)$ , disjunction (∨) and implication (→). Write $\vdash\phi$ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula φ there exists a formula Apφ (effectively computable from φ), containing only variables not equal to p which occur in φ, and such that for (...)
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Normal forms in modal logic.Kit Fine - 1975 - Notre Dame Journal of Formal Logic 16 (2):229-237.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • A sheaf representation and duality for finitely presented Heyting algebras.Silvio Ghilardi & Marek Zawadowski - 1995 - Journal of Symbolic Logic 60 (3):911-939.
    A. M. Pitts in [Pi] proved that HA op fp is a bi-Heyting category satisfying the Lawrence condition. We show that the embedding $\Phi: HA^\mathrm{op}_\mathrm{fp} \longrightarrow Sh(\mathbf{P_0,J_0})$ into the topos of sheaves, (P 0 is the category of finite rooted posets and open maps, J 0 the canonical topology on P 0 ) given by $H \longmapsto HA(H,\mathscr{D}(-)): \mathbf{P_0} \longrightarrow \text{Set}$ preserves the structure mentioned above, finite coproducts, and subobject classifier, it is also conservative. This whole structure on HA op (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Subalgebras of Diagonalizable Algebras of Theories Containing Arithmetic.Vladimir I͡U Shavrukov - 1993
    Download  
     
    Export citation  
     
    Bookmark   9 citations