Related papers: A note on standard systems and ultrafilters
We show that the following two theories are equiconsistent: (T) ZFC, CH and "There is a dense ideal on the first uncountable cardinal such that if j is the generic embedding associated with it then its restriction on ordinals is independent…
I shall explore various senses in which ultrafinitism can be fruitfully understood as engaging with a potentialist perspective in mathematics. First, I explain that every model $M$ of the theory of finite arithmetic -- arithmetic with a…
We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
In this paper, we explore various ways in which a factor $\sigma$-algebra $\mathscr{B}$ can sit in a dynamical system $\mathbf{X} :=(X, \mathscr{A}, \mu, T)$, i.e. we study some possible structures of the extension $\mathscr{A} \rightarrow…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…
In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…
We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $\lambda^+$-saturated $\mathcal{B}$-valued models of…
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
The ultrapower $T^{\ast}$ of an arbitrary ordered set $T$ is introduced as an infinitesimal extension of $T$. It is obtained as the set of equivalence classes of the sequences in $T$, where the corresponding relation is generated by an…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
Let R be a sufficiently saturated o-minimal expansion of a real closed field, let O be the convex hull of the rationals in R, and let st: O^n \to \mathbb{R}^n be the standard part map. For X \subseteq R^n define st(X):=st(X \cap O^n). We…
In this paper we will show that for every cut $ I $ of any countable nonstandard model $ \mathcal{M} $ of $ \mathrm{I}\Sigma_{1} $, each $ I $-small $ \Sigma_{1} $-elementary submodel of $ \mathcal{M}$ is of the form of the set of fixed…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
The main motivation of this paper is the study of first-order model theoretic properties of structures having their roots in modal logic. We will focus on the connections between ultrafilter extensions and ultrapowers. We show that certain…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…