Denumerably many Post-complete normal modal logics with propositional constants

DOI10.1215/00294527-1722746zbMATH Open1263.03013OpenAlexW2039870841MaRDI QIDQ691130FDOQ691130

Authors: 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

Recommendations

• Post complete and 0-axiomatizable modal logics
• The power of a propositional constant
• Post completeness in congruential modal logics
• scientific article; zbMATH DE number 1858068
• Positive modal logic

zbMATH Keywords

modal logicspropositional constantslogics of point-generated framesPost-completeness

Mathematics Subject Classification ID

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

Cites Work

• Simulating polyadic modal logics by monadic ones
• Title not available (Why is that?)
• Post completeness in modal logic
• Some Post-complete extensions of S2 and S3
• Title not available (Why is that?)
• Post Completeness and Ultrafilters
• The truth about some Post numbers
• Continuum many maximal consistent normal bimodal logics with inverses

Cited In (7)

• Tabularity and post-completeness in tense logic
• Post completeness in congruential modal logics
• A unified semantics for a family of modal logics with propositional constants
• Title not available (Why is that?)
• The power of a propositional constant
• Post complete and 0-axiomatizable modal logics
• The decidable normal modal logics are not recursively enumerable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691130)