Existential second-order logic and modal logic with quantified accessibility relations
From MaRDI portal
Publication:259071
DOI10.1016/j.ic.2016.01.003zbMath1402.03021OpenAlexW2181631406MaRDI QIDQ259071
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
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph properties checkable in linear time in the number of vertices
- Finite-model theory -- A personal perspective
- Elements of finite model theory.
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- Propositional dynamic logic of regular programs
- Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality
- Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary Relations
- Using the Universal Modality: Gains and Questions
- The modal logic of inequality
- A spectrum hierarchy
- Decidability of second-order theories and automata on infinite trees
- Subclasses of binary NP
- Propositional Dynamic Logic with Program Quantifiers
- Mathematical Foundations of Computer Science 2003
- Existential second-order logic over graphs
This page was built for publication: Existential second-order logic and modal logic with quantified accessibility relations