Definability in the h-quasiorder of labeled forests

DOI10.1016/J.APAL.2008.09.026MaRDI QIDQ1023296zbMATH OpenOpenAlexFDO

Authors Oleg Kudinov, A. V. Zhukov, Victor 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

\(h\)-quasiorderatomic structureautomorphismdefinabilitylabeled forestlabeled tree

Mathematics Subject Classification ID

Interpolation, preservation, definability (03C40)

Recommendations

• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Definability of closure operations in the \(h\)-quasiorder of labeled forests
• Logical Approaches to Computational Barriers
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
• Definability in the Infix Order on Words

Cites work

• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• scientific article; zbMATH DE number 1500515 (Why is no real title available?)
• scientific article; zbMATH DE number 1759433 (Why is no real title available?)
• scientific article; zbMATH DE number 2154085 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• Model theory
• On the Wadge reducibility of \(k\)-partitions
• Structure of degrees of generalized index sets
• The quotient algebra of labeled forests modulo h-equivalence
• The theory of well-quasi-ordering: a frequently discovered concept
• Theories of orders on the set of words
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

Cited in

(14)

• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Alternating complexity of counting first-order logic for the subword order
• Well-Quasi Orders and Hierarchy Theory
• The quotient algebra of labeled forests modulo h-equivalence
• A Gandy theorem for abstract structures and applications to first-order definability
• Definability in the Infix Order on Words
• Complexity of counting first-order logic for the subword order
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
• Wadge-like reducibilities on arbitrary quasi-Polish spaces
• Logical Approaches to Computational Barriers
• Definability in the structure of words with the inclusion relation
• On the main scientific achievements of Victor Selivanov
• Definability of closure operations in the \(h\)-quasiorder of labeled forests

This page was built for publication: Definability in the \(h\)-quasiorder of labeled forests

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