<bibliography>
 <citation type="article" key="BojanczykDMSS11">
  <author>M. <surname>Bojanczyk</surname></author>
  <author>C. <surname>David</surname></author>
  <author>A. <surname>Muscholl</surname></author>
  <author>T. <surname>Schwentick</surname></author>
  <author>L. <surname>Segoufin</surname></author>
  <year>2011</year>
  <title>Two-variable logic on data words</title>
  <journal>ACM Trans. Comput. Log.</journal>
  <volume>12</volume>
  <number>4</number>
  <pages>27:1&#8211;27:26</pages>
  <doi>10.1145/1970398.1970403</doi>
 </citation>
 <citation type="article" key="BojanczykMSS09">
  <author>M. <surname>Bojanczyk</surname></author>
  <author>A. <surname>Muscholl</surname></author>
  <author>T. <surname>Schwentick</surname></author>
  <author>L. <surname>Segoufin</surname></author>
  <year>2009</year>
  <title>Two-variable logic on data trees and XML reasoning</title>
  <journal>J. ACM</journal>
  <volume>56</volume>
  <number>3</number>
  <doi>10.1145/1516512.1516515</doi>
 </citation>
 <citation type="inproceedings" key="bollig-local-fsttcs21">
  <author>Benedikt <surname>Bollig</surname></author>
  <author>Arnaud <surname>Sangnier</surname></author>
  <author>Olivier <surname>Stietel</surname></author>
  <year>2021</year>
  <title>Local First-Order Logic with Two Data Values</title>
  <booktitle>FSTTCS'21</booktitle>
  <series>LIPIcs</series>
  <volume>213</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>39:1&#8211;39:15</pages>
  <doi>10.4230/LIPIcs.FSTTCS.2021.39</doi>
 </citation>
 <citation type="book" key="borger-classical-springer97">
  <author>Egon <surname>B&#246;rger</surname></author>
  <author>Erich <surname>Gr&#228;del</surname></author>
  <author>Yuri <surname>Gurevich</surname></author>
  <year>1997</year>
  <title>The Classical Decision Problem</title>
  <series>Perspectives in Mathematical Logic</series>
  <publisher>Springer</publisher>
  <doi>10.1023/A:1008334715902</doi>
 </citation>
 <citation type="inproceedings" key="DeckerHLT14">
  <author>N. <surname>Decker</surname></author>
  <author>P. <surname>Habermehl</surname></author>
  <author>M. <surname>Leucker</surname></author>
  <author>D. <surname>Thoma</surname></author>
  <year>2014</year>
  <title>Ordered Navigation on Multi-attributed Data Words</title>
  <editor>Paolo <surname>Baldan</surname></editor>
  <editor>Daniele <surname>Gorla</surname></editor>
  <booktitle>CONCUR'14</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8704</volume>
  <publisher>Springer</publisher>
  <pages>497&#8211;511</pages>
  <doi>10.1007/978-3-662-44584-6_34</doi>
 </citation>
 <citation type="article" key="etessami-first-ic02">
  <author>Kousha <surname>Etessami</surname></author>
  <author>Moshe Y. <surname>Vardi</surname></author>
  <author>Thomas <surname>Wilke</surname></author>
  <year>2002</year>
  <title>First-Order Logic with Two Variables and Unary Temporal Logic</title>
  <journal>Inf. Comput.</journal>
  <volume>179</volume>
  <number>2</number>
  <pages>279&#8211;295</pages>
  <doi>10.1006/inco.2001.2953</doi>
 </citation>
 <citation type="article" key="Fitting12">
  <author>Melvin <surname>Fitting</surname></author>
  <year>2012</year>
  <title>Torben Bra&#252;ner, Hybrid Logic and its Proof-Theory, Applied Logic Series Volume 37, Springer, 2011, pp. XIII+231. ISBN: 978-94-007-0001-7</title>
  <journal>Stud Logica</journal>
  <volume>100</volume>
  <number>5</number>
  <pages>1051&#8211;1053</pages>
  <doi>10.1007/s11225-012-9439-2</doi>
 </citation>
 <citation type="inproceedings" key="Gai82">
  <author>H. <surname>Gaifman</surname></author>
  <year>1982</year>
  <title>On local and nonlocal properties</title>
  <editor>J. <surname>Stern</surname></editor>
  <booktitle>Logic Colloquium '81</booktitle>
  <publisher>North-Holland</publisher>
  <pages>105&#8211;135</pages>
  <doi>10.1016/S0049-237X(08)71879-2</doi>
 </citation>
 <citation type="incollection" key="Han65">
  <author>W. <surname>Hanf</surname></author>
  <year>1965</year>
  <title>Model-theoretic methods in the study of elementary logic</title>
  <editor>J.W. <surname>Addison</surname></editor>
  <editor>L. <surname>Henkin</surname></editor>
  <editor>A. <surname>Tarski</surname></editor>
  <booktitle>The Theory of Models</booktitle>
  <publisher>North Holland</publisher>
  <pages>132&#8211;145</pages>
  <doi>10.2307/2271017</doi>
 </citation>
 <citation type="article" key="Janiczak-Undecidability-fm53">
  <author>A. <surname>Janiczak</surname></author>
  <year>1953</year>
  <title>Undecidability of some simple formalized theories</title>
  <journal>Fundamenta Mathematicae</journal>
  <volume>40</volume>
  <pages>131&#8211;139</pages>
  <doi>10.2307/2964197</doi>
 </citation>
 <citation type="inproceedings" key="KaraSZ10">
  <author>A. <surname>Kara</surname></author>
  <author>T. <surname>Schwentick</surname></author>
  <author>T. <surname>Zeume</surname></author>
  <year>2010</year>
  <title>Temporal Logics on Words with Multiple Data Values</title>
  <editor>Kamal <surname>Lodaya</surname></editor>
  <editor>Meena <surname>Mahajan</surname></editor>
  <booktitle>FSTTCS'10</booktitle>
  <series>LIPIcs</series>
  <volume>8</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>481&#8211;492</pages>
  <doi>10.4230/LIPIcs.FSTTCS.2010.481</doi>
 </citation>
 <citation type="inproceedings" key="Kieronski05">
  <author>E. <surname>Kieronski</surname></author>
  <year>2005</year>
  <title>Results on the Guarded Fragment with Equivalence or Transitive Relations</title>
  <editor>C.-H. Luke <surname>Ong</surname></editor>
  <booktitle>CSL'05</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3634</volume>
  <publisher>Springer</publisher>
  <pages>309&#8211;324</pages>
  <doi>10.1007/11538363_22</doi>
 </citation>
 <citation type="inproceedings" key="KieronskiT09">
  <author>E. <surname>Kieronski</surname></author>
  <author>L. <surname>Tendera</surname></author>
  <year>2009</year>
  <title>On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations</title>
  <booktitle>LICS'09</booktitle>
  <publisher>IEEE</publisher>
  <pages>123&#8211;132</pages>
  <doi>10.1109/LICS.2009.39</doi>
 </citation>
 <citation type="book" key="Libkin04">
  <author>L. <surname>Libkin</surname></author>
  <year>2004</year>
  <title>Elements of Finite Model Theory</title>
  <series>Texts in Theoretical Computer Science. An EATCS Series</series>
  <publisher>Springer</publisher>
  <doi>10.1007/978-3-662-07003-1</doi>
 </citation>
 <citation type="inproceedings" key="ManuelZ13">
  <author>A. <surname>Manuel</surname></author>
  <author>T. <surname>Zeume</surname></author>
  <year>2013</year>
  <title>Two-Variable Logic on 2-Dimensional Structures</title>
  <editor>Simona Ronchi Della <surname>Rocca</surname></editor>
  <booktitle>CSL'13</booktitle>
  <series>LIPIcs</series>
  <volume>23</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>484&#8211;499</pages>
  <doi>10.4230/LIPIcs.CSL.2013.484</doi>
 </citation>
 <citation type="article" key="Mundhenk09">
  <author>Martin <surname>Mundhenk</surname></author>
  <author>Thomas <surname>Schneider</surname></author>
  <year>2009</year>
  <title>The Complexity of Hybrid Logics over Equivalence Relations</title>
  <journal>J. Log. Lang. Inf.</journal>
  <volume>18</volume>
  <number>4</number>
  <pages>493&#8211;514</pages>
  <doi>10.1007/s10849-009-9089-6</doi>
 </citation>
 <citation type="article" key="Tan14">
  <author>T. <surname>Tan</surname></author>
  <year>2014</year>
  <title>Extending two-variable logic on data trees with order on data values and its automata</title>
  <journal>ACM Trans. Comput. Log.</journal>
  <volume>15</volume>
  <number>1</number>
  <pages>8:1&#8211;8:39</pages>
  <doi>10.1145/2559945</doi>
 </citation>
</bibliography>
