Two-variable universal logic with transitive closure
From MaRDI portal
Recommendations
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
- Decidability of weak logics with deterministic transitive closure
- On the satisfiability problem for fragments of two-variable logic with one transitive relation
- Two-variable first-order logic with equivalence closure
- Two-variable first-order logic with equivalence closure
Cited in
(10)- On the complexity of the Bernays-Schönfinkel class with Datalog
- A double team semantics for generalized quantifiers
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
- Two-variable first-order logic with equivalence closure
- \(\mathrm{FO}^2\) with one transitive relation is decidable
- Two-variable first-order logic with equivalence closure
- Two-variable logic with counting and trees
- Computer Science Logic
- On the satisfiability problem for fragments of two-variable logic with one transitive relation
- Decidability of weak logics with deterministic transitive closure
This page was built for publication: Two-variable universal logic with transitive closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649561)
