Related papers: The Consistency of $ZFC+CIFS$
We show there is a residual set of non-Anosov $C^{\infty}$ Axiom A diffeomorphisms with the no cycles property whose elements have trivial centralizer. If $M$ is a surface and $2\leq r\leq \infty$, then we will show there exists an open and…
We prove that $ZF+DC+"$there exists a transcendence basis for the reals$"+"$there is no well-ordering of the reals$"$ is consistent relative to $ZFC$. This answers a question of Larson and Zapletal.
Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane have uniformly perfect attractor sets, while other conditions imply the attractor is pointwise thin, and thus…
Given a $C^2$- Anosov diffemorphism $f: M \rightarrow M,$ we prove that the jacobian condition $Jf^n(p) = 1,$ for every point $p$ such that $f^n(p) = p,$ implies transitivity. As application in the celebrated theory of Sinai-Ruelle-Bowen,…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…
We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.
In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…
A canonical cover generalizing the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used…
A $\sigma$-ideal $\cal{I}$ on a set $X$ is supersaturated if for every family $\cal{F}$ of $\cal{I}$-positive sets with $|\cal{F}| < \mathrm{add}(\cal{I})$, there exists a countable set that meets every set in $\cal{F}$. We show that many…
We study the compactification of nonautonomous systems with autonomous limits and related dynamics. Although the $C^{1}$ extension of the compactification was well established, a great number of problems arising in bifurcation and stability…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
Given a compact space in a fixed universe of set theory, one can naturally define its interpretation in any ZFC extension of the universe. We investigate the stability of some classes of compact spaces with respect to extensions of this…
In this paper, following an idea of Christophe Chalons, I propose a new kind of forcing axiom, the Maximality Principle, which asserts that any sentence phi holding in some forcing extension V^P and all subsequent extensions V^P*Q holds…
Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We prove the so called Liv\v{s}ic theorem for cocycles taking values in the group of $C^{1+\beta}-diffeomorphisms of any closed manifold of arbitrary dimension. Since no localization hypothesis is assumed, this result is completely global…
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…
We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order…
We consider the decidability of the verification problem of programs \emph{modulo axioms} --- that is, verifying whether programs satisfy their assertions, when the functions and relations it uses are assumed to interpreted by arbitrary…
I introduce an approach for automated reasoning in first order set theories that are not finitely axiomatizable, such as $ZFC$, and describe its implementation alongside the automated theorem proving software E. I then compare the results…