Computably categorical Boolean algebras enriched by ideals and atoms

Annals of Pure and Applied Logic 163 (5):485-499 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,532

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Definable sets in Boolean ordered o-minimal structures. II.Roman Wencel - 2003 - Journal of Symbolic Logic 68 (1):35-51.
The number of openly generated Boolean algebras.Stefan Geschke & Saharon Shelah - 2008 - Journal of Symbolic Logic 73 (1):151-164.
A remark on Martin's conjecture.Su Gao - 2001 - Journal of Symbolic Logic 66 (1):401-406.
A categorical approach to polyadic algebras.Roch Ouellet - 1982 - Studia Logica 41 (4):317 - 327.
Boolean valued lie algebras.Hirokazu Nishimura - 1991 - Journal of Symbolic Logic 56 (2):731-741.
Continuum-Many Boolean Algebras of the Form [image] Borel.Michael Ray Oliver - 2004 - Journal of Symbolic Logic 69 (3):799 - 816.

Analytics

Added to PP
2013-10-27

Downloads
10 (#1,185,833)

6 months
7 (#419,552)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Heyting Algebras with Distinguished Atoms and Coatoms.Nikolay Bazhenov - 2023 - Journal of Logic, Language and Information 32 (1):3-18.

Add more citations

References found in this work

Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Computable Boolean algebras.Julia F. Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.

Add more references