DOI

We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k ≥ 3, in contrast to the known decidability result for k = 2. We establish also undecidablity (again for every k ≥ 3) of elementary theories of two other relevant structures: the homomorphic quasiorder of finite k-labeled trees, and of finite k-labeled trees with a fixed label of the root element. © Springer-Verlag Berlin Heidelberg 2006.
Original languageEnglish
Title of host publicationLogical Approaches to Computational Barriers (CiE 2006)
Pages289-296
Number of pages8
DOIs
StatePublished - 1 Jan 2006
Eventcomputability in europe-2006 -
Duration: 30 Jun 2006 → …

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Nature
Volume3988
ISSN (Print)0302-9743

Conference

Conferencecomputability in europe-2006
Period30/06/06 → …

    Research areas

  • Elementary theory, Forest, Homomorphic quasiorder, Labeled tree, Tree, Undecidability

ID: 127139962