The following pages link to First-order logic on finite trees (Q5096727):
Displaying 18 items.
- On n-equivalence of binary trees (Q579237) (← links)
- First-order logics: some characterizations and closure properties (Q715044) (← links)
- A note on the characterization of TL [EF] (Q845961) (← links)
- Finite trees in tense logic (Q1288959) (← links)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- Deciding the first-order theory of an algebra of feature trees with updates (Q1799104) (← links)
- Tree canonization and transitive closure (Q1854332) (← links)
- Automata on finite trees (Q2074209) (← links)
- First-order theories of bounded trees (Q2118179) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- Algebraic recognizability of regular tree languages (Q2484441) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Regular tree languages, cardinality predicates, and addition-invariant FO (Q2904787) (← links)
- (Q4305492) (← links)
- First-order aspects of tree paths (Q4644528) (← links)
- First-Order Logic on CPDA Graphs (Q4981168) (← links)
- STACS 2005 (Q5710686) (← links)
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages (Q6137830) (← links)
