Some undecidability results for lattices in recursion theory
From MaRDI portal
Publication:762063
DOI10.2140/pjm.1986.122.319zbMath0558.03021OpenAlexW2056063789MaRDI QIDQ762063
Publication date: 1986
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1986.122.319
lattices of r.e. substructureslattice of r.e. equivalence relationsrecursive algebrarecursive Boolean algebra
Related Items (7)
The undecidability of the lattice of r. e. closed subsets of an effective topological space ⋮ The theory of ceers computes true arithmetic ⋮ Recursion theory in a lower semilattice ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ Maximal r.e. equivalence relations ⋮ Recursive versus recursively enumerable binary relations ⋮ Subrecursive equivalence relations and (non-)closure under lattice operations
This page was built for publication: Some undecidability results for lattices in recursion theory
