Satisfiability versus Finite Satisfiability in Elementary Modal Logics

DOI10.3233/FI-2018-1736zbMATH Open1435.03044OpenAlexW2963254029WikidataQ128980915 ScholiaQ128980915MaRDI QIDQ4611207FDOQ4611207

Authors: Jakub Michaliszyn, Jan Otop, Piotr Witkowski 

Publication date: 17 January 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2018-1736

Recommendations

• Satisfiability vs. finite satisfiability in elementary modal logics
• On the decidability of elementary modal logics
• On the complexity of elementary modal logics
• Modal logic over finite structures
• scientific article; zbMATH DE number 6302919
• Satisfiability of modal inclusion logic. Lax and strict semantics
• Some results on finite axiomatizability in modal logic
• Elementary definability and completeness in general and positive modal logic
• From Propositional Satisfiability to Satisfiability Modulo Theories

Mathematics Subject Classification ID

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

Cited In (6)

• Decidable elementary modal logics
• Modal logics definable by universal three-variable formulas
• Elementary modal logics over transitive structures
• 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 versus 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 Q4611207)