Denumerably many Post-complete normal modal logics with propositional constants

DOI10.1215/00294527-1722746zbMath1263.03013OpenAlexW2039870841MaRDI QIDQ691130

Rohan French

Publication date: 29 November 2012

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

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1352383231

zbMATH Keywords

modal logicspropositional constantslogics of point-generated framesPost-completeness

Mathematics Subject Classification ID

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

Related Items (2)

The power of a propositional constant ⋮ A unified semantics for a family of modal logics with propositional constants

Cites Work

• Unnamed Item
• Unnamed Item
• Some Post-complete extensions of S2 and S3
• Simulating polyadic modal logics by monadic ones
• Post Completeness and Ultrafilters
• The truth about some Post numbers
• Post completeness in modal logic
• Continuum many maximal consistent normal bimodal logics with inverses

This page was built for publication: Denumerably many Post-complete normal modal logics with propositional constants