Publication:4636045: Difference between revisions
From MaRDI portal
Publication:4636045
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 15:21, 7 February 2024
zbMATH Open1400.03044MaRDI QIDQ4636045FDOQ4636045
Publication date: 23 April 2018
Title of this publication is not available (Why is that?)
first-order modal logicfinite model propertyquantified modal logiccounting quantifierstwo-dimensional modal logicquasimodeldecidable fragment
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Logic with extra quantifiers and operators (03C80) Decidability of theories and sets of sentences (03B25)
Cited In (12)
- Modal Logics with Counting
- Title not available (Why is that?)
- Modal definability of first-order formulas with free variables and query answering
- Title not available (Why is that?)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Decidability of order-based modal logics
- Are bundles good deals for first-order modal logic?
- First-order definable counting-only queries
- Decidable and Undecidable Problems for First-Order Definability and Modal Definability
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636045)