Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
From MaRDI portal
Publication:4748133
DOI10.1017/S0004972700025958zbMath0509.03021MaRDI QIDQ4748133
Publication date: 1983
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
lattice of recursively enumerable subspacesrecursive structuresfree Boolean algebraeffectiveness in algebralattice of recursively enumerable filtersthick filters
Logical aspects of lattices and related structures (03G10) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items (7)
Maximal theories ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Reverse Mathematics of Matroids ⋮ Friedberg splittings of recursively enumerable sets ⋮ Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees ⋮ The upward closure of a perfect thin class ⋮ Countable thin \(\Pi^0_1\) classes
This page was built for publication: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
