Related papers: OD elements of countable OD sets in the Solovay mo…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
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…
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…
Eight categorical soundness and completeness theorems are established within the framework of algebraic theories. Exactly six of the eight deduction systems exhibit complete semantics within the cartesian monoidal category of sets. The…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…
We study a one-dimensional ordinary differential equation modelling optical conveyor belts, showing in particular cases of physical interest that periodic solutions exist. Moreover, under rather general assumptions it is proved that the set…
Ehrenfeucht's lemma (1973) asserts that whenever one element of a model of Peano arithmetic is definable from another, then they satisfy different types. We consider here the analogue of Ehrenfeucht's lemma for models of set theory. The…
A reduction of properties (invariants) of compact sets of real numbers to properties of countable orders is presented here. Discussed here is also an embedding property of some compact sets that are called t$\mathbb R$-sets. Among others,…
A real X is defined to be relatively c.e. if there is a real Y such that X is c.e.(Y) and Y does not compute X. A real X is relatively simple and above if there is a real Y <_T X such that X is c.e.(Y) and there is no infinite subset Z of…
Solovay's random-real forcing (1971) is the standard way of producing real-valued measurable cardinals. Following questions of Fremlin, by giving a new construction, we show that there are combinatorial, measure-theoretic properties of…
Assuming $M_1$, the canonical inner model with one Woodin cardinal exists, we construct a model in which the nonstationary ideal on $\omega_1$ is $\aleph_2$-saturated, $\Delta_1$-definable with $\omega_1$ as the only parameter and there is…
We isolate a class, say $\mathcal{A}$, of global real analytic functions such that, each global semi-analytic set defined by $\mathcal{A}$ has only finitely many connected components and each component is also a global semi-analytic set…
In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (ODE), also known as finite differences. Doing so, we pointed…
This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…
We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…
This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
A sufficient condition for existence of a solution of a differential inclusion with a uniformly bounded right-hand side that has nonempty closed (possibly nonconvex) values is obtained. An Olech-type result is obtained as a corollary. An…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.