Definability in the Homomorphic Quasiorder of Finite Labeled Forests

DOI10.1007/978-3-540-73001-9_45zbMath1150.03312OpenAlexW4240655438MaRDI QIDQ5425345

Oleg V. Kudinov, Victor L. Selivanov

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_45

zbMATH Keywords

automorphismatomic structuredefinabilityforestlabeled treehomomorphic quasiorder

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Interpolation, preservation, definability (03C40)

Related Items (10)

Definability of closure operations in the \(h\)-quasiorder of labeled forests ⋮ On the main scientific achievements of Victor Selivanov ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ On the Wadge Reducibility of k-Partitions ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Definability in the Infix Order on Words ⋮ Definability in the \(h\)-quasiorder of labeled forests ⋮ On the Wadge reducibility of \(k\)-partitions

This page was built for publication: Definability in the Homomorphic Quasiorder of Finite Labeled Forests