Computable Boolean algebras

DOI10.2307/2695066MaRDI QIDQ2710598zbMATH OpenOpenAlexFDO

Authors Michael Stob, J. F. Knight

Publication date 16 July 2001

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2695066

zbMATH Keywords

\(\text{low}_n\) Boolean algebraatom idealcomputable Boolean algebra

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Low n Boolean Subalgebras
• Boolean algebra approximations
• \(\text{Low}_5\) Boolean subalgebras and computable copies
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Boolean algebras of elementary characteristic (1, 0, 1) with computable set of atoms and computable ideal of atomic elements

Cites work

• Asset prices and the fundamentals: a Q test
• On the Krull dimensions of the Steenrod algebra

Cited in

(43)

• Recursive and r.e. quotient Boolean algebras
• Computability of distributive lattices
• Coding and definability in computable structures
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Degree spectra of structures
• Computable presentability of countable linear orders
• Decomposability and computability
• Computable linear orders and the ershov hierarchy
• Limitwise monotonic spectra and their generalizations
• Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders
• Punctual copies of algebraic structures
• Atomless Boolean algebras computable in polynomial time
• 2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
• Rice sequences of relations
• Some Questions in Computable Mathematics
• On the n-back-and-forth types of Boolean algebras
• \(\text{Low}_5\) Boolean subalgebras and computable copies
• Boolean algebra approximations
• 2004 Summer Meeting of the Association for Symbolic Logic
• On the triple jump of the set of atoms of a Boolean algebra
• Notes on the Jump of a Structure
• Depth zero Boolean algebras
• Computability on linear orderings enriched with predicates
• scientific article; zbMATH DE number 1534579 (Why is no real title available?)
• scientific article; zbMATH DE number 2154086 (Why is no real title available?)
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• On ^0_2-categoricity of Boolean algebras
• 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
• TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS
• Computability of Polish spaces up to homeomorphism
• On the effective universality of mereological theories
• Computable Stone spaces
• Computable Heyting algebras with distinguished atoms and coatoms
• Separating notions in effective topology
• COMPUTABLY COMPACT METRIC SPACES
• Cuts of linear orders
• On a computable presentation of low linear orderings
• A non-computable c.e. closed subset of \([0, 1]\)
• The coding theorems for linear orders
• Degree spectra of homeomorphism type of compact Polish spaces
• Optimal syntactic definitions of back-and-forth types
• Computably categorical Boolean algebras enriched by ideals and atoms
• New degree spectra of Polish spaces

This page was built for publication: Computable Boolean algebras

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