Open Access
2007 Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint
Claude Sureson
Notre Dame J. Formal Logic 48(3): 399-423 (2007). DOI: 10.1305/ndjfl/1187031411

Abstract

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.

Citation

Download Citation

Claude Sureson. "Rumely Domains with Atomic Constructible Boolean Algebra. An Effective Viewpoint." Notre Dame J. Formal Logic 48 (3) 399 - 423, 2007. https://doi.org/10.1305/ndjfl/1187031411

Information

Published: 2007
First available in Project Euclid: 13 August 2007

zbMATH: 1158.03020
MathSciNet: MR2336355
Digital Object Identifier: 10.1305/ndjfl/1187031411

Subjects:
Primary: 03C10
Secondary: 11U99

Keywords: decidability , model completeness , Rumely domains

Rights: Copyright © 2007 University of Notre Dame

Vol.48 • No. 3 • 2007
Back to Top