English
Related papers

Related papers: Appendix to "Inconsistency of Inaccessibility"

200 papers

This supplementary part of the paper gr-qc 9312038 contains the necessary proofs of the claims stated in the main part.

General Relativity and Quantum Cosmology · Physics 2007-05-23 S. Tertychniy

Upon presenting the proof of Theorem 3.3 in "Maximal chains in $$ and ultrapowers of the integers" I discovered that it is not entirely correct and certainly some details should be added. I have therefore written an addendum to the paper…

Logic · Mathematics 2008-02-03 Saharon Shelah , Juris Steprāns

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

We consider mainly the following version of set theory:"ZF + DC and for every $\lambda,\lambda^{\aleph_0}$ is well ordered", our thesis is that this is a reasonable set theory, e.g. much can be said. In particular, we prove that for a…

Logic · Mathematics 2021-09-24 Saharon Shelah

In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.

Dynamical Systems · Mathematics 2026-02-24 Jorge Fariña-Asategui , Rafe Jones , Santiago Radi

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Logic · Mathematics 2014-06-17 Asaf Karagila

When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…

Logic in Computer Science · Computer Science 2023-04-12 Gilles Dowek , Ying Jiang

The main result of this paper is an improvement of the upper bound on the cardinal invariant ${\mathord{\mathrm{cov}}}^{\ast}({\mathcal{Z}}_{0})$ that was discovered by Raghavan and Shelah in an earlier paper. Here ${\mathcal{Z}}_{0}$ is…

Logic · Mathematics 2017-12-12 Dilip Raghavan

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…

Logic · Mathematics 2007-05-23 Joel David Hamkins

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

Logic · Mathematics 2019-01-29 Saharon Shelah

G\"odel's argument for the First Incompleteness Theorem is, structurally, a proof by contradiction. This article intends to reframe the argument by, first, isolating an additional assumption the argument relies on, and then, second, arguing…

Logic · Mathematics 2020-07-02 Joachim Derichs

Recent results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's Theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komj\'ath, the…

Combinatorics · Mathematics 2025-06-12 Lorenzo Carlucci , David J. Fernández-Bretón

We present a variation of the proof in the first author's "Mob families and mad families" of Con(b<a), which in particular removes some of the obstacles to generalising the argument to uncountable cardinals.

Logic · Mathematics 2014-09-26 Jörg Brendle , Andrew D. Brooke-Taylor

We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…

Logic · Mathematics 2020-05-07 Yair Hayut , Asaf Karagila

The aim of this paper is to give an existence result for a class of one-dimensional, non-convex, non-coercive problems in the Calculus of Variations. The main tools for the proof are an existence theorem in the convex case and the closure…

funct-an · Mathematics 2008-02-03 Graziano Crasta , Annalisa Malusa

This text is an appendix to our work "On the growth of Kronecker coefficients", arXiv:1607.02887. Here, we provide some complementary theorems, remarks, and calculations that for the sake of space are not going to appear into the final…

Representation Theory · Mathematics 2016-11-23 Emmanuel Briand , Amarpreet Rattan , Mercedes Rosas

We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box…

Logic · Mathematics 2016-09-06 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

The relationship between the large cardinal notions of strong compactness and supercompactness cannot be determined under the standard ZFC axioms of set theory. Under a hypothesis called the Ultrapower Axiom, we prove that the notions are…

Logic · Mathematics 2018-10-12 Gabriel Goldberg