Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

DOI10.1093/LOGCOM/EXM038zbMath1214.03010OpenAlexW2044468563WikidataQ123296617 ScholiaQ123296617MaRDI QIDQ5441125

Oleg V. Kudinov, Victor L. Selivanov

Publication date: 7 February 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exm038

zbMATH Keywords

undecidabilityfirst-order theoryforestlabelled treehomomorphic quasiorder

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items (13)

Definability of closure operations in the \(h\)-quasiorder of labeled forests ⋮ On the main scientific achievements of Victor Selivanov ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Fine hierarchies via Priestley duality ⋮ Unnamed Item ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ Unnamed Item ⋮ Definability in the Infix Order on Words ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Definability in the \(h\)-quasiorder of labeled forests ⋮ On the Wadge reducibility of \(k\)-partitions

This page was built for publication: Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests