Existential second-order logic and modal logic with quantified accessibility relations

DOI10.1016/J.IC.2016.01.003MaRDI QIDQ259071zbMATH OpenOpenAlexFDO

Authors Lauri Hella, Antti Kuusisto

Publication date 10 March 2016

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2016.01.003

zbMATH Keywords

finite model theoryexistential second-order logicmodal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Decidability of theories and sets of sentences (03B25)

Recommendations

• Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
• Second-order propositional modal logic and monadic alternation hierarchies
• Representability in second-order propositional poly-modal logic
• Expressivity of second order propositional modal logic
• A modal perspective on monadic second-order alternation hierarchies

Cites work

• scientific article; zbMATH DE number 4148058 (Why is no real title available?)
• scientific article; zbMATH DE number 612169 (Why is no real title available?)
• scientific article; zbMATH DE number 1989660 (Why is no real title available?)
• scientific article; zbMATH DE number 1507191 (Why is no real title available?)
• scientific article; zbMATH DE number 1556014 (Why is no real title available?)
• scientific article; zbMATH DE number 1759397 (Why is no real title available?)
• scientific article; zbMATH DE number 1841824 (Why is no real title available?)
• A spectrum hierarchy
• Complexity and expressivity of uniform one-dimensional fragment with equality
• Decidability of second-order theories and automata on infinite trees
• Elements of finite model theory.
• Existential second-order logic over graphs: charting the tractability frontier
• Finite-model theory -- A personal perspective
• Graph properties checkable in linear time in the number of vertices
• Mathematical Foundations of Computer Science 2003
• Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
• Propositional dynamic logic of regular programs
• Propositional dynamic logic with program quantifiers
• Subclasses of binary NP
• The modal logic of inequality
• Using the Universal Modality: Gains and Questions
• \(\Sigma_ 1^ 1\)-formulae on finite structures

Cited in

(6)

• Modal logics with relative accessibility relations
• Existential Fixed-Point Logic as a Fragment of Second-Order Logic
• On the existence of a modal-logical basis for monadic second-order logic
• Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
• On modal logics characterized by models with relative accessibility relations. II
• Improved Second-Order Quantifier Elimination in Modal Logic

This page was built for publication: Existential second-order logic and modal logic with quantified accessibility relations

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