Two-variable logic with two order relations (extended abstract)
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Two-variable logic with two order relations
- Two-variable logic on 2-dimensional structures
- Decidability issues for two-variable logics with several linear orders
- Two variable first-order logic over ordered domains
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
Cited in
(15)- Two variable first-order logic over ordered domains
- Decidability issues for two-variable logics with several linear orders
- Small substructures and decidability issues for first-order logic with two variables
- Two-variable logic on data words
- Two-variable logic on 2-dimensional structures
- On Preservation Theorems for Two-Variable Logic
- Extendible formulas in two variables in intuitionistic logic
- Two-Variable Logic over Countable Linear Orderings
- An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
- Walking on data words
- Two-variable logic with counting and trees
- Extending two-variable logic on data trees with order on data values and its automata
- Two-variable logic with two order relations
- On two-variable first-order logic with a partial order
- Pebble-intervals automata and \(\text{FO}^2\) with two orders
This page was built for publication: Two-variable logic with two order relations (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901154)
