Decidable first-order modal logics with counting quantifiers
From MaRDI portal
Publication:4636045
Recommendations
- Complexity Results for First-Order Two-Variable Logic with Counting
- Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
- One-variable first-order linear temporal logics with counting
- Two-variable first order logic with counting quantifiers: complexity results
- On logics with two variables
Cited in
(13)- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Are bundles good deals for first-order modal logic?
- Decidable and Undecidable Problems for First-Order Definability and Modal Definability
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Decidability of order-based modal logics
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Modal definability of first-order formulas with free variables and query answering
- First-order definable counting-only queries
- Decidable logics with associative binary modalities
- scientific article; zbMATH DE number 176530 (Why is no real title available?)
- scientific article; zbMATH DE number 6680147 (Why is no real title available?)
- Modal Logics with Counting
- Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
This page was built for publication: Decidable first-order modal logics with counting quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636045)