Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03307OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898827

Victor L. Selivanov, Oleg V. Kudinov

Publication date: 30 April 2007

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

Full work available at URL: https://doi.org/10.1007/11780342

zbMATH Keywords

undecidabilityforestlabeled treeelementary theoryTreehomomorphic quasiorder

Mathematics Subject Classification ID

Trees (05C05) Decidability of theories and sets of sentences (03B25)

Related Items (9)

Hierarchies of Δ⁰₂‐measurable k ‐partitions ⋮ On the main scientific achievements of Victor Selivanov ⋮ On the homomorphism order of labeled posets ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Labeled posets are universal ⋮ On the Wadge Reducibility of k-Partitions ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Definability in the \(h\)-quasiorder of labeled forests

This page was built for publication: Logical Approaches to Computational Barriers