Related papers: Minimal axiomatic frameworks for definable hyperre…
We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…
We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…
A construction of the real number system based on almost homomorphisms of the integers Z was proposed by Schanuel, Arthan, and others. We combine such a construction with the ultrapower or limit ultrapower construction, to construct the…
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 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.…
Assume ZF (without the Axiom of Choice). Let $j:V_\varepsilon\to V_\delta$ be a non-trivial $\in$-cofinal $\Sigma_1$-elementary embedding, where $\varepsilon,\delta$ are limit ordinals. We prove some restrictions on the constructibility of…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
In our paper "Essential normality, essential norms and hyperrigidity" we claimed that the restriction of the identity representation of a certain operator system (constructed from a polynomial ideal) has the unique extension property,…
This paper unifies problems and results related to (embedding) universal and homomorphism universal structures. On the one side we give a new combinatorial proof of the existence of universal objects for homomorphism defined classes of…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…
We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
We prove that a countable simple unidimensional theory that eliminates hyperimaginaries is supersimple. This solves a problem of Shelah in the more general context of simple theories under weak assumptions.
It is a well-known result that, after adding one Cohen real, the transcendence degree of the reals over the ground-model reals is continuum. We extend this result for a set $X$ of finitely many Cohen reals, by showing that, in the forcing…
In standard construction of hyperrational numbers using an ultrapower we assume that the ultrafilter is selective. It makes possible to assign real value to any finite hyperrational number. So, we can consider hyperrational numbers with…
We analyze recent criticisms of the use of hyperreal probabilities as expressed by Pruss, Easwaran, Parker, and Williamson. We show that the alleged arbitrariness of hyperreal fields can be avoided by working in the Kanovei-Shelah model or…
Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$,…