Deciding definability in FO2(<h,<v) on trees

DOI10.2168/LMCS-11(3:5)2015zbMath1448.03025arXiv1505.04934OpenAlexW2207317005MaRDI QIDQ3196335

Luc Segoufin, Thomas Place

Publication date: 29 October 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04934

zbMATH Keywords

characterizationtree automatatree languagestwo-variables first-order logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Unnamed Item

This page was built for publication: Deciding definability in FO2(<h,<v) on trees