Definability in the \(h\)-quasiorder of labeled forests

DOI10.1016/j.apal.2008.09.026zbMath1166.03012OpenAlexW1967998784MaRDI QIDQ1023296

Anton V. Zhukov, Oleg V. Kudinov, Victor L. Selivanov

Publication date: 11 June 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.09.026

zbMATH Keywords

automorphismatomic structuredefinabilitylabeled tree\(h\)-quasiorderlabeled forest

Mathematics Subject Classification ID

Interpolation, preservation, definability (03C40)

Related Items

Definability of closure operations in the \(h\)-quasiorder of labeled forests ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the main scientific achievements of Victor Selivanov ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Unnamed Item ⋮ Definability in the Infix Order on Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure of degrees of generalized index sets
• Model theory
• The theory of well-quasi-ordering: a frequently discovered concept
• Theories of orders on the set of words
• The quotient algebra of labeled forests modulo h-equivalence
• On the Wadge Reducibility of k-Partitions
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
• Logical Approaches to Computational Barriers