Encoding orders and trees in binary relations

DOI10.1112/S0025579300015357zbMath0449.03025OpenAlexW2030990536MaRDI QIDQ3895443

Wilfrid Hodges

Publication date: 1981

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0025579300015357

zbMATH Keywords

binary treefinite treesfinite ordersstable formula

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45)

Related Items

Stability theory and set existence axioms, Quantitative structure of stable sets in arbitrary finite groups, Fundamentals of forking

Cites Work

• On universal Horn classes categorical in some infinite power
• Elimination of quantifiers for modules
• ℵ₀-categorical modules