Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint

Notre Dame Journal of Formal Logic 48 (3):399-423 (2007)
The archetypal Rumely domain is the ring \widetildeZ of algebraic integers. Its constructible Boolean algebra is atomless. We study here the opposite situation: Rumely domains whose constructible Boolean algebra is atomic. Recursive models (which are rings of algebraic numbers) are proposed; effective model-completeness and decidability of the corresponding theory are proved
Keywords Rumely domains   model completeness   decidability
Categories (categorize this paper)
DOI 10.1305/ndjfl/1187031411
 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: 15,879
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Daniel D. Merrill (2005). Augustus De Morgan's Boolean Algebra. History and Philosophy of Logic 26 (2):75-91.
R. I. G. Hughes (1982). The Logic of Experimental Questions. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1982:243 - 256.
M. Bekkali (1994). Chains and Antichains in Interval Algebras. Journal of Symbolic Logic 59 (3):860-867.

Monthly downloads

Added to index


Total downloads

3 ( #461,639 of 1,725,164 )

Recent downloads (6 months)

1 ( #349,161 of 1,725,164 )

How can I increase my downloads?

My notes
Sign in to use this feature

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