\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation

DOI10.1305/ndjfl/1040511348zbMath0822.03018OpenAlexW2074156380MaRDI QIDQ1893143

Patrizio Cintioli, Sauro Tulipani

Publication date: 28 September 1995

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040511348

zbMATH Keywords

labeled treesexistential theoryinfinite termssubtree relation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07)

Cites Work

• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers
• A new method for undecidability proofs of first order theories
• Decidability of the existential theory of infinite terms with subterm relation
• Quantifier elimination for infinite terms

This page was built for publication: \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation