Abstract dependence, recursion theory, and the lattice of recursively enumerable filters

DOI10.1017/S0004972700025958MaRDI QIDQ4748133zbMATH OpenFDO

Authors Rodney G. Downey

Publication date 1983

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972700025958

zbMATH Keywords

effectiveness in algebrafree Boolean algebralattice of recursively enumerable filterslattice of recursively enumerable subspacesrecursive structuresthick filters

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Logical aspects of lattices and related structures (03G10)

Cited in

(7)

• Maximal theories
• Countable thin ^0_1 classes
• Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
• Reverse mathematics of matroids
• COMPUTABLY COMPACT METRIC SPACES
• Friedberg splittings of recursively enumerable sets
• The upward closure of a perfect thin class

This page was built for publication: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters

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