Pages that link to "Item:Q1903080"
From MaRDI portal
The following pages link to A first-order axiomatization of the theory of finite trees (Q1903080):
Displaying 23 items.
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Deciding the first-order theory of an algebra of feature trees with updates (Q1799104) (← links)
- Dominance constraints with Boolean connectives: A model-eliminative treatment (Q1870570) (← links)
- Weak sequential theories of finite full binary trees (Q2104270) (← links)
- First-order theories of bounded trees (Q2118179) (← links)
- Trees and finite satisfiability: proof of a conjecture of Burgess (Q2266003) (← links)
- Axiomatizing the logical core of XPath 2.0 (Q2272223) (← links)
- Finite tree property for first-order logic with identity and functions (Q2565989) (← links)
- A variety theorem for trees and theories (Q2770673) (← links)
- Definition of first-order language with arbitrary alphabet. Syntax of terms, atomic formulas and their subterms (Q2865747) (← links)
- On model-theoretic tree properties (Q2951900) (← links)
- First-Order Definability of Trees and Sparse Random Graphs (Q3438138) (← links)
- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees (Q3605529) (← links)
- (Q3787513) (← links)
- First-order properties of trees, star-free expressions, and aperiodicity (Q3978766) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES (Q5015724) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- (Q5186728) (← links)
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 (Q5305554) (← links)
- New Computational Paradigms (Q5717041) (← links)
- (Q5752555) (← links)
- A proof system for finite trees (Q6560163) (← links)
