English
Related papers

Related papers: On Separating Wholeness Axioms

200 papers

We introduce the theory $\mathrm{PF}^{+,\times}$ of pseudofinite fields with generic additive and multiplicative character added as continuous logic predicates. Using the Weil bounds on character sums over finite fields as well as the…

Logic · Mathematics 2025-11-26 Stefan Marian Ludwig

Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…

Logic · Mathematics 2015-07-01 Jean-Louis Krivine

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been…

Logic · Mathematics 2024-03-19 Farmer Schlutzenberg

It is well known that pretameness implies the forcing theorem, and that pretameness is characterized by the preservation of the axioms of $\mathsf{ZF}^-$, that is $\mathsf{ZF}$ without the power set axiom, or equivalently, by the…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Schlicht

We show that assuming $\mathsf{ZF}+\mathsf{AD}^+ +$ "$V = \mathrm{L} \bigl(\wp (\mathbb{R})\bigr)$", any poset which increases $\Theta$ does not preserve the truth of $\mathsf{AD}$. We also show that in $\mathsf{ZF} + \mathsf{AD}$, any…

Logic · Mathematics 2023-04-04 Daisuke Ikegami , Nam Trang

We prove the consistency of the inequality $\mathfrak{r}_{\mathsf{nwd}}<\mathfrak{irr}$, which in turn implies the consistency of $\mathfrak{r}_\mathsf{nwd}<\mathfrak{i}$ and $\mathfrak{r}_{\mathsf{scatt}}<\mathfrak{irr}$. This answers one…

Logic · Mathematics 2025-05-05 Jonathan Cancino Manríquez

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

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…

Logic in Computer Science · Computer Science 2019-02-05 John Hester

The presence of an additive conserved quantity imposes a limitation on the measurement process. According to the Wigner-Araki-Yanase theorem, the perfect repeatability and the distinguishability on the apparatus cannot be attained…

Quantum Physics · Physics 2007-05-23 Takayuki Miyadera , Hideki Imai

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

Logic in Computer Science · Computer Science 2013-06-26 Vijay Ganesh , Mia Minnes , Armando Solar-Lezama , Martin Rinard

We consider a non-homogeneous nonlinear stochastic difference equation X_{n+1} = X_n (1 + f(X_n)\xi_{n+1}) + S_n, and its important special case X_{n+1} = X_n (1 + \xi_{n+1}) + S_n, both with initial value X_0, non-random decaying free…

Probability · Mathematics 2011-10-19 Gregory Berkolaiko , Alexandra Rodkina

In this note we provide a (decidable) graph-structural characterisation of the infiniteness of $L(w_1, ..., w_k)$, where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_{w_k}\}$ is the set of all words that contain the same…

Formal Languages and Automata Theory · Computer Science 2019-10-29 Ryoma Sin'ya

We consider the following conjecture (from Huang, et al): Let $\Delta^+$ denote the upper half disc in $\mathbb{C}$ and let $\gamma = ( - 1, 1)$ (viewed as an interval in the real axis in $\mathbb{C}$). Assume that $F$ is a holomorphic…

Complex Variables · Mathematics 2015-08-13 Abtin Daghighi , Steven G. Krantz

We show that (1) If ZF is consistent then the following theory is consistent "ZF + DC(omega_{1}) + Every set of reals has Baire property" and (2) If ZF is consistent then the following theory is consistent "ZFC + `every projective set of…

Logic · Mathematics 2019-08-27 Haim Judah , Saharon Shelah

Given a nonnegative function $\psi : \N \to \R $, let $W(\psi)$ denote the set of real numbers $x$ such that $|nx -a| < \psi(n) $ for infinitely many reduced rationals $a/n (n>0) $. A consequence of our main result is that $W(\psi)$ is of…

Number Theory · Mathematics 2009-03-20 Alan Haynes , Andrew Pollington , Sanju Velani

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

Logic · Mathematics 2013-03-12 Toshiyasu Arai

We investigate the logical strength of the cohesiveness principle when restricted to finite sequences of sets, denoted by fin-COH, over different base theories. Our main result shows that fin-COH entails $I\Sigma_1^0$ over the weaker base…

Logic · Mathematics 2026-02-17 Mengzhou Sun

Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…

Logic in Computer Science · Computer Science 2017-04-10 Marco Voigt

In this paper, we provide a positive answer to the question of Matthews whether $\mathsf{ZF}^-$ is consistent with a non-trivial cofinal Reinhardt elementary embedding $j\colon V\to V$. The consistency follows from $\mathsf{ZFC} + I_0$, and…

Logic · Mathematics 2025-08-08 Hanul Jeon
‹ Prev 1 4 5 6 7 8 10 Next ›