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

DOI10.1007/S10469-010-9084-7zbMath1214.03023OpenAlexW2000223237MaRDI QIDQ619316

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

Publication date: 24 January 2011

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-010-9084-7

zbMATH Keywords

closure operationdefinabilitylabeled tree\(h\)-quasiorderlabeled forest

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Interpolation, preservation, definability (03C40)

Related Items (3)

On the main scientific achievements of Victor Selivanov ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ On the Wadge reducibility of \(k\)-partitions

Cites Work

• Unnamed Item
• Definability in the \(h\)-quasiorder of labeled forests
• Theories of orders on the set of words
• The quotient algebra of labeled forests modulo h-equivalence
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

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