Propositional quantification in the topological semantics for \(\mathbf S4\)

DOI10.1305/ndjfl/1039724892zbMath0949.03020OpenAlexW2122871622MaRDI QIDQ1381441

Philip Kremer

Publication date: 6 December 2000

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1039724892

zbMATH Keywords

propositional quantificationsecond-order logicsecond-order arithmetictopological semanticsmodal logic S4

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (5)

Pitts' quantifiers are not topological quantification ⋮ Unnamed Item ⋮ COMPLETENESS OF SECOND-ORDER PROPOSITIONAL S4 AND H IN TOPOLOGICAL SEMANTICS ⋮ Modal languages for topology: expressivity and definability ⋮ A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some non-classical extensions of second-order intuitionistic propositional calculus
• Semantical investigations in Heyting's intuitionistic logic
• Set theory as modal logic
• On a second order propositional operator in intuitionistic logic
• The monadic theory of order
• Lewis' postulate of exitence disarmed
• Second order propositional operators over Cantor space
• Undefinability of propositional quantifiers in the modal system S4
• The expressive power of second-order propositional modal logic
• Pragmatics and intensional logic
• The algebra of topology
• On closed elements in closure algebras
• A completeness theorem in modal logic
• Interpreting second-order logic in the monadic theory of order
• Monadic theory of order and topology in ZFC
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• Propositional quantifiers in modal logic1
• Embedding first order predicate logic in fragments of intuitionistic logic
• On the complexity of propositional quantification in intuitionistic logic
• On 2nd order intuitionistic propositional calculus with full comprehension
• Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p
• On modal logic with propositional quantifiers
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Montague Type Semantics for Modal Logics with Propositional Quantifiers
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Algebraic postulates and a geometric interpretation for the Lewis calculus of strict implication
• Some theorems about the sentential calculi of Lewis and Heyting
• Completeness in the theory of types
• A solution of the decision problem for the Lewis systems S2 and S4, with an application to topology

This page was built for publication: Propositional quantification in the topological semantics for \(\mathbf S4\)