Encoding orders and trees in binary relations

DOI10.1112/S0025579300015357MaRDI QIDQ3895443zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(4)

• Stability theory and set existence axioms
• Quantitative structure of stable sets in arbitrary finite groups
• Fundamentals of forking
• Model theory and agnostic online learning via excellent sets

This page was built for publication: Encoding orders and trees in binary relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895443)