Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
From MaRDI portal
Publication:5441125
DOI10.1093/logcom/exm038zbMath1214.03010WikidataQ123296617 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
03D35: Undecidability and degrees of sets of sentences
03B25: Decidability of theories and sets of sentences
Related Items
Unnamed Item, Unnamed Item, Fine hierarchies via Priestley duality, Definability of closure operations in the \(h\)-quasiorder of labeled forests, Fine hierarchies and m-reducibilities in theoretical computer science, Definability in the \(h\)-quasiorder of labeled forests, On the Wadge reducibility of \(k\)-partitions, Alternating complexity of counting first-order logic for the subword order, Complexity Issues for Preorders on Finite Labeled Forests, Well-Quasi Orders and Hierarchy Theory, A Gandy Theorem for Abstract Structures and Applications to First-Order Definability, Definability in the Infix Order on Words