1995•Journal of Symbolic LogicRequires access

Scott incomplete Boolean ultrapowers of the real line

Masanao Ozawa

Open publisher page 10 citations

Abstract

Abstract An ordered field is said to be Scott complete iff it is complete with respect to its uniform structure. Zakon has asked whether nonstandard real lines are Scott complete. We prove in ZFC that for any complete Boolean algebra B which is not (ω, 2)-distributive there is an ultrafilter of B such that the Boolean ultrapower of the real line modulo is not Scott complete. We also show how forcing in set theory gives rise to examples of Boolean ultrapowers of the real line which are not Scott complete.

About this research paper

What this paper is about

Abstract An ordered field is said to be Scott complete iff it is complete with respect to its uniform structure. Zakon has asked whether nonstandard real lines are Scott complete. We prove in ZFC that for any complete Boolean algebra B which is not (ω, 2)-distributive there is an ultrafilter of B such that the Boolean ultrapower of the real line modulo is not Scott complete. We also show how forcing in set theory gives rise to examples of Boolean ultrapowers of the real line which are not Scott complete.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract An ordered field is said to be Scott complete iff it is complete with respect to its uniform structure. Zakon has asked whether nonstandard real lines are Scott complete. We prove in ZFC that for any complete Boolean algebra B which is not (ω, 2)-distributive there is an ultrafilter of B such that the Boolean ultrapower of the real line modulo is not Scott complete. We also show how forcing in set theory gives rise to examples of Boolean ultrapowers of the real line which are not Scott complete.

Key concepts: Ultrafilter, Ultraproduct, Boolean algebras canonically defined, Stone's representation theorem for Boolean algebras, Real line, Complete Boolean algebra, Boolean algebra, Modulo

Related papers

Back to paper searchBrowse research topicsOriginal source
Scott incomplete Boolean ultrapowers of the real line — Research Paper | ScholarLens