Computable Boolean algebras
From MaRDI portal
Publication:2710598
DOI10.2307/2695066zbMath0974.03041OpenAlexW2165758366MaRDI QIDQ2710598
Publication date: 16 July 2001
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2695066
Related Items (31)
New degree spectra of Polish spaces ⋮ 2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Boolean algebra approximations ⋮ Algorithmic relationships of relations \(S_{\mathcal{L}}^n\) on linear orders ⋮ Rice sequences of relations ⋮ On the effective universality of mereological theories ⋮ Computable Stone spaces ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ On the triple jump of the set of atoms of a Boolean algebra ⋮ Separating notions in effective topology ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Computability on linear orderings enriched with predicates ⋮ Some Questions in Computable Mathematics ⋮ Cuts of linear orders ⋮ On a computable presentation of low linear orderings ⋮ Computability of distributive lattices ⋮ Notes on the Jump of a Structure ⋮ TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Depth zero Boolean algebras ⋮ Coding and definability in computable structures ⋮ Degree spectra of structures ⋮ Computable presentability of countable linear orders ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ Computably categorical Boolean algebras enriched by ideals and atoms ⋮ On the $n$-back-and-forth types of Boolean algebras ⋮ Decomposability and computability ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Computable linear orders and the ershov hierarchy ⋮ Limitwise monotonic spectra and their generalizations
Cites Work
This page was built for publication: Computable Boolean algebras
