scientific article; zbMATH DE number 465525

MaRDI QIDQ4271920zbMATH OpenFDO

Authors G. Marongiu, Sauro Tulipani

Publication date 12 December 1993

zbMATH Keywords

infinite treesrational treesterm algebras with subterm relation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55)

Recommendations

• Undecidable relativizations of algebras of relations
• Undecidable semiassociative relation algebras
• Undecidability of Algebras of Binary Relations
• scientific article; zbMATH DE number 1086665
• Computer Science Logic
• Undecidability of relatively free Hilbert algebras
• Publication:4952569
• Decidable and undecidable fragments of first-order concatenation theory
• Undecidable theories of Lyndon algebras
• Relative undecidability in term rewriting. I: The termination hierarchy

Cited in

(5)

• Decidability of the existential theory of infinite terms with subterm relation
• Rational terms and rational numbers
• \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
• Undecidable fragments of elementary theories
• Theories of orders on the set of words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271920)