On two-variable first-order logic with a partial order
From MaRDI portal
Cites work
- \(\mathrm{FO}^2\) with one transitive relation is decidable
- Adding transitivity and counting to the fluted fragment
- Automata, languages and programming. 27th international colloquium, ICALP 2000, Geneva, Switzerland, July 9--15, 2000. Proceedings
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- Computer Science Logic
- Extending two-variable logic on trees
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
- Fragments of First-Order Logic
- scientific article; zbMATH DE number 1670860 (Why is no real title available?)
- scientific article; zbMATH DE number 1136090 (Why is no real title available?)
- scientific article; zbMATH DE number 1970438 (Why is no real title available?)
- Inaccessible worlds
- Modal definability in enriched languages
- On languages with two variables
- On the Decision Problem for Two-Variable First-Order Logic
- On the satisfiability problem for fragments of two-variable logic with one transitive relation
- Order-invariance of two-variable logic is decidable
- Register automata with extrema constraints, and an application to two-variable logic
- Series-parallel languages and the bounded-width property
- Series-Parallel Languages on Scattered and Countable Posets
- The fluted fragment revisited
- The fluted fragment with transitive relations
- The guarded fragment with transitive guards
- Two variable first-order logic over ordered domains
- Two-variable first-order logic with equivalence closure
- Two-variable first-order logic with equivalence closure
- Two-variable logic on data trees and XML reasoning
- Two-variable logic with two order relations (extended abstract)
This page was built for publication: On two-variable first-order logic with a partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849518)
