scientific article; zbMATH DE number 535104

zbMATH Open0785.03026MaRDI QIDQ4285797FDOQ4285797

Authors: André Nies 

Publication date: 21 March 1994

Title of this publication is not available (Why is that?)

Recommendations

• Undecidability of Brouwerian semilattices
• Some undecidability results for lattices in recursion theory
• Recursion theory in a lower semilattice
• Undecidability of free pseudo-complemented semilattices
• scientific article; zbMATH DE number 1984520
• scientific article; zbMATH DE number 5000345
• The semilattice of computable families of recursively enumerable sets
• DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
• The undecidability of the semi-unification problem

zbMATH Keywords

definabilityundecidabilityreducibilitieslattices of sets under inclusion and degree orderingsupper semilattices of r.e. degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35)

Cited In (16)

• Undecidability and 1-types in the recursively enumerable degrees
• Elementary theories and hereditary undecidability for semilattices of numberings
• The theory of the recursively enumerable weak truth-table degrees is undecidable
• Definability with a predicate for a semi-linear set
• Undecidable fragments of elementary theories
• On the structural properties of the set of fixpoints for nondeterministic recursive definitions
• Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
• Title not available (Why is that?)
• Degrees of presentability of structures. I
• Title not available (Why is that?)
• A Useful Undecidable Theory
• Title not available (Why is that?)
• Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
• Interpreting true arithmetic in the theory of the r.e. truth table degrees
• Semilattices of disjunctive and linear degrees
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable

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 Q4285797)