The purpose of this paper is to propose and explore a general framework within which a wide variety of model construction techniques from contemporary set theory can be subsumed. Taking our inspiration from presheaf constructions in category theory and Boolean ultrapowers, we will show that generic extensions, ultrapowers, extenders and generic ultrapowers can be construed as examples of a single model construction technique. In particular, we will show that Łoś's theorem can be construed as a specific case of Cohen's truth (...) lemma, and we isolate the weakest conditions a filter must satisfy in order for the truth lemma to work. (shrink)

A nonstandard universe is constructed from a superstructure in a Boolean-valued model of set theory. This provides a new framework of nonstandard analysis with which methods of forcing are incorporated naturally. Various new principles in this framework are provided together with the following applications: An example of an 1-saturated Boolean ultrapower of the real number field which is not Scott complete is constructed. Infinitesimal analysis based on the generic extension of the hyperreal numbers is provided, and the hull completeness theorem (...) and the Loeb measure construction are extended to objects in the generic extension of the internal universe. The reduction theory of the Boolean-valued complex numbers are developed as a prototype of the applications to the topological reduction theory of Boolean sheaves or operator algebras. (shrink)

Boolean-valued models for first-order languages generalize two-valued models, in that the value range is allowed to be any complete Boolean algebra instead of just the Boolean algebra 2. Boolean-valued models are interesting in multiple aspects: philosophical, logical, and mathematical. The primary goal of this paper is to extend a number of critical model-theoretic notions and to generalize a number of important model-theoretic results based on these notions to Boolean-valued models. For instance, we will investigate (first-order) Boolean valuations, which are natural (...) generalizations of (first-order) theories, and prove that Boolean-valued models are sound and complete with respect to Boolean valuations. With the help of Boolean valuations, we will also discuss the Löwenheim-Skolem theorems on Boolean-valued models. (shrink)

TheoremEvery model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented.

Among the results of this paper are the following: 1. Every Boolean (ultra) power is the union of an updirected elementary family of direct ultrapowers. 2. Under certain conditions, a finitely iterated Boolean ultrapower is isomorphic to a single Boolean ultrapower. 3. A ω-bounded filtral power is an elementary substructure of a filtral power. 4. Let K be an elementary class closed under updirected unions (e.g., if K is an amalgamation class); then K is closed under finite products if and (...) only if K is closed under reduced products if and only if K is a Horn class. (shrink)

A bounded ultrasheaf is a nonstandard universe constructed from a superstructure in a Boolean valued model of set theory. We consider the bounded elementary embeddings between bounded ultrasheaves. Then the standardization principle is true if and only if the ultrafilters are comparable by the Rudin-Frolik order. The base concept is that the bounded elementary embeddings correspond to the complete Boolean homomorphisms. We represent this by the Rudin-Keisler order of ultrafilters of Boolean algebras.

Two real-valued deduction schemes are introduced, which agree on $\vdash \triangle$ but not on $\Gamma \vdash \triangle$ , where Δ and ▵ are finite sets of formulae. Using the first scheme we axiomatize real-valued equality so that it induces metrics on the domains of appropriate structures. We use the second scheme to reduce substitutivity of equals to uniform continuity, with respect to the metric equality, of interpretations of predicates in structures. This continuity extends from predicates to arbitrary formulae and the (...) appropriate models have completions resembling analytic completions of metric spaces. We provide inference rules for the two deductions and discuss definability of each of them by means of the other. (shrink)

Sheaves of structures are useful to give constructions in universal algebra and model theory. We can describe their logical behavior in terms of Heyting‐valued structures. In this paper, we first provide a systematic treatment of sheaves of structures and Heyting‐valued structures from the viewpoint of categorical logic. We then prove a form of Łoś's theorem for Heyting‐valued structures. We also give a characterization of Heyting‐valued structures for which Łoś's theorem holds with respect to any maximal filter.

This paper critically examines two arguments against the generic multiverse, both of which are due to W. Hugh Woodin. Versions of the first argument have appeared a number of times in print, while the second argument is relatively novel. We shall investigate these arguments through the lens of two different attitudes one may take toward the methodology and metaphysics of set theory; and we shall observe that the impact of these arguments depends significantly on which of these attitudes is upheld. (...) Our examination of the second argument involves the development of a new model for Steel’s multiverse theory, which is delivered in the Appendix. (shrink)

In this paper, we provide a new characterization of Keisler’s order in terms of saturation of Boolean ultrapowers. To do so, we apply and expand the framework of ‘separation of variables’ recently developed by Malliaris and Shelah. We also show that good ultrafilters on Boolean algebras are precisely the ones which capture the maximum class in Keisler’s order, answering a question posed by Benda in 1974.

Let $\omega$ be the first infinite ordinal (or the set of all natural numbers) with the usual order $<$ . In § 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of $\omega$ , whose cardinality is (1) a singular strong limit cardinal, (2) a strongly inaccessible cardinal. This answers two questions in [1], modulo the assumption of supercompactness. In § 2 we construct several $\lambda$ -Archimedean ultrapowers of $\omega$ under some large cardinal (...) assumptions. For example, we show that, assuming the consistency of a measurable cardinal, there may exist a $\lambda$ -Archimedean ultrapower of $\omega$ for some uncountable cardinal $\lambda$ . This answers a question in [8], modulo the assumption of measurability. (shrink)

A general duality connecting the level of a formal theory and of a metatheory is proposed. Because of the role of natural numbers in a metatheory the existence of a dual theory is conjectured, in which the natural numbers become formal in the theory but in formalizing non-formal natural numbers taken from the dual metatheory these numbers become nonstandard. For any formal theory there may be in principle a dual theory. The dual shape of the lattice of projections over separable (...) Hilbert space is exhibited. The crucial ingredient of this dual theory is set-theoretical (Cohen) forcing. Then, some attempts have been made to exhibit the dual shape of the exotic smooth (small) structures on topological ℝ4. There are striking similarities of both pictures. Nonstandard solutions of the equations of motion of 10-dimensional superstring of IIB type are described as a model theoretic extension of standard ones. Based on Brans conjecture one can predict the existence of sources of gravity in 4 dimensions. By their dual origins they carry quantum information as well. The generalized Maldacena conjecture appears naturally, which sheds light on a definition of background independent string theory. (shrink)

We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so‐called pseudo proof systems proposed for study by Krajíček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. We show that the existence of mad pseudo proof systems is equivalent to the existence of a randomized polynomial time procedure with a highly restrictive use of randomness which produces satisfiable formulas whose satisfying assignments are probably hard to find.

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 U of B such that the Boolean ultrapower of the real line modulo U 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. (shrink)