An excursion to the border of decidability: between two- and three-variable logic
From MaRDI portal
Cites work
- Complexity results for classes of quantificational formulas
- Computer Science Logic
- ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
- On languages with two variables
- On the Decision Problem for Two-Variable First-Order Logic
- One-dimensional fragment of first-order logic
- Random models and the Gödel case of the decision problem
- The unsolvability of the Gödel class with identity
- Unary negation
- Uniform one-dimensional fragments with one equivalence relation
- Zum Entscheidungsproblem des logischen Funktionenkalküls
Cited in
(2)
This page was built for publication: An excursion to the border of decidability: between two- and three-variable logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025218)