On the Satisfiability of Two-Variable Logic over Data Words
From MaRDI portal
Publication:4933309
DOI10.1007/978-3-642-16242-8_18zbMath1307.03020OpenAlexW2592285994MaRDI QIDQ4933309
Claire David, Tony Tan, Leonid O. Libkin
Publication date: 12 October 2010
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16242-8_18
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Data structures (68P05)
Related Items (3)
Small substructures and decidability issues for first-order logic with two variables ⋮ Extending two-variable logic on data trees with order on data values and its automata ⋮ An Automaton over Data Words That Captures EMSO Logic
This page was built for publication: On the Satisfiability of Two-Variable Logic over Data Words