On n-equivalence of binary trees

DOI10.1305/NDJFL/1093636941zbMATH Open0625.03013OpenAlexW2066680155MaRDI QIDQ579237

Kees Doets

Publication date: 1987

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093636941

zbMATH Keywords

binary treesEhrenfeucht gamefirst-order sentences of quantifier depth nquantifier depth n-equivalence

Mathematics Subject Classification ID

Trees (05C05) Model theory of finite structures (03C13) Semilattices (06A12) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (1)

Homogeneous trees are bilipschitz equivalent

This page was built for publication: On n-equivalence of binary trees

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