English
Related papers

Related papers: The Ordering Principle and Higher Dependent Choice

200 papers

We show that Vopenka's Principle and Vopenka cardinals are indestructible under reverse Easton forcing iterations of increasingly directed-closed partial orders, without the need for any preparatory forcing. As a consequence, we are able to…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor

We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1)…

Logic · Mathematics 2025-12-22 Vladimir Kanovei , Vassily Lyubetsky

We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{\kappa, \kappa}$, this allows us to characterize any large cardinal…

Logic · Mathematics 2019-03-19 Will Boney

We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Logic · Mathematics 2007-05-23 Saharon Shelah , Masahiro Shioya

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

Logic · Mathematics 2017-02-21 Shimon Garti

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

Logic · Mathematics 2022-10-14 Brent Cody

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

We give a survey of cardinal charcteristics of the higher Cicho\'n diagram defined on the higher Baire space ${}^\kappa\kappa$ for $\kappa$ regular with $2^{<\kappa}=\kappa$. Specifically, we will compare consistency proofs from the…

Logic · Mathematics 2025-03-07 Tristan van der Vlugt

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

Logic · Mathematics 2024-01-30 David J. Fernández-Bretón

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…

Logic · Mathematics 2007-05-23 Arthur W. Apter , James Cummings , Joel David Hamkins

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

Logic · Mathematics 2018-03-09 Vera Fischer , Daniel T. Soukup

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

We consider several notions of well-foundedness of cardinals in the absence of the Axiom of Choice. Some of these have been conflated by some authors, but we separate them carefully. We then consider implications among these, and also…

Logic · Mathematics 2024-01-17 Andreas Blass , Dhruv Kulshreshtha

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

Computational Complexity · Computer Science 2018-04-24 Mark Inman

In the context of large cardinals, the classical diamond principle Diamond_kappa is easily strengthened in natural ways. When kappa is a measurable cardinal, for example, one might ask that a Diamond_kappa sequence anticipate every subset…

Logic · Mathematics 2007-05-23 Joel David Hamkins

We derive a new high-order compact finite difference scheme for option pricing in stochastic volatility models. The scheme is fourth-order accurate in space and second-order accurate in time. Under some restrictions, theoretical results…

Computational Finance · Quantitative Finance 2014-04-23 Bertram Düring , Michel Fournié

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

General Mathematics · Mathematics 2009-04-15 Slavko Rede