Satisfiability vs. finite satisfiability in elementary modal logics

zbMATH Open1469.03051arXiv1210.2481MaRDI QIDQ4986511FDOQ4986511

Authors: Jakub Michaliszyn, Jan Otop, Piotr Witkowski 

Publication date: 27 April 2021

Full work available at URL: https://arxiv.org/abs/1210.2481

Recommendations

• Satisfiability versus Finite Satisfiability in Elementary Modal Logics
• Decidable elementary modal logics
• On the decidability of elementary modal logics
• Elementary modal logics over transitive structures
• Modal logics definable by universal three-variable formulas

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Cited In (5)

• Decidable elementary modal logics
• Satisfiability versus Finite Satisfiability in Elementary Modal Logics
• Title not available (Why is that?)
• The complexity of decomposing modal and first-order theories
• A case for satisfaction classes: model theoretic vs axiomatic approaches to the notion of truth

This page was built for publication: Satisfiability vs. finite satisfiability in elementary modal logics

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