The Mckinsey-Tarski theorem for topological evidence logics

DOI10.1007/978-3-662-59533-6_11MaRDI QIDQ2303587zbMATH OpenOpenAlexFDO

Authors Alexandru Baltag, Nick Bezhanishvili, Saúl Fernández González

Publication date 4 March 2020

Full work available at URL https://doi.org/10.1007/978-3-662-59533-6_11

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• A new proof of the McKinsey-Tarski theorem
• On completeness of dynamic topological logic
• A proof of topological completeness for S4 in (0,1)
• S4 is Topologically Complete for (0,1): a Short Proof
• Simple completeness proofs for some spatial logics of the real line

Cited in

(2)

• Topological Evidence Logics: Multi-agent Setting
• The introduction of topology into analytic philosophy: two movements and a coda

This page was built for publication: The Mckinsey-Tarski theorem for topological evidence logics

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