Computable Isomorphisms of Boolean Algebras with Operators

Studia Logica 100 (3):481-496 (2012)
Abstract
In this paper we investigate computable isomorphisms of Boolean algebras with operators (BAOs). We prove that there are examples of polymodal Boolean algebras with finitely many computable isomorphism types. We provide an example of a polymodal BAO such that it has exactly one computable isomorphism type but whose expansions by a constant have more than one computable isomorphism type. We also prove a general result showing that BAOs are complete with respect to the degree spectra of structures, computable dimensions, expansions by constants, and the degree spectra of relations
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,412
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Terrence Millar (1986). Recursive Categoricity and Persistence. Journal of Symbolic Logic 51 (2):430-434.
Citations of this work BETA

No citations found.

Similar books and articles
Yde Venema (2003). Atomless Varieties. Journal of Symbolic Logic 68 (2):607-614.
Analytics

Monthly downloads

Added to index

2012-07-03

Total downloads

3 ( #298,393 of 1,103,040 )

Recent downloads (6 months)

2 ( #183,252 of 1,103,040 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.