Two-Variable Logic with Two Order Relations

DOI10.1007/978-3-642-15205-4_38zbMath1238.03030OpenAlexW1962883301MaRDI QIDQ5901154

Thomas Schwentick, Thomas Zeume

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Two-Variable Logic with Counting and Trees ⋮ Small substructures and decidability issues for first-order logic with two variables ⋮ Walking on data words ⋮ Extending two-variable logic on data trees with order on data values and its automata