English
Related papers

Related papers: Inaccessibility and Subinaccessibility. In two par…

200 papers

$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…

Logic · Mathematics 2022-09-20 David Schrittesser

We outline a definition of accessible and presentable objects in a 2-category $\mathcal K$ endowed with a "KZ context", that is to say a pair of lax-idempotent monads interacting in a prescribed way; this perspective suggests a unified…

Category Theory · Mathematics 2025-08-05 Ivan Di Liberti , Fosco Loregian

This is the report-version of a mini-series of two articles on the foundations of satisfiability of conjunctive normal forms with non-boolean variables, to appear in Fundamenta Informaticae, 2011. These two parts are here bundled in one…

Discrete Mathematics · Computer Science 2012-02-15 Oliver Kullmann

We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…

Logic · Mathematics 2008-05-13 Paolo Lipparini

Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…

Combinatorics · Mathematics 2019-09-17 S. Gill Williamson

The aim of this paper is to provide the mathematical framework for analyzing the possibility of rendering one dimensional objects visible with difficulty and ultimately invisible,by changing the experimental conditions to which they are…

Strongly Correlated Electrons · Physics 2010-06-01 V. Celebonovic

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

Logic · Mathematics 2018-01-30 Dilip Raghavan , Saharon Shelah

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

Logic · Mathematics 2026-04-09 Hrafn Valtýr Oddsson

If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

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

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

Logic · Mathematics 2022-02-22 Assaf Rinot , Jing Zhang

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

Computational Complexity · Computer Science 2007-05-23 Tao Jiang , Ming Li , Paul Vitanyi

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

Computational Complexity · Computer Science 2007-05-23 Harry Buhrman , Tao Jiang , Ming Li , Paul Vitanyi

Given an inaccessible J\'onsson cardinal $\lambda$, a sequence of results due to Shelah from Cardinal Arithmetic and Sh413 tell us that $\lambda$ must be at least $\lambda\times\omega$-Mahlo. We may then ask ourselves whether we can improve…

Logic · Mathematics 2019-12-03 Shehzad Ahmed

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

Logic · Mathematics 2024-03-26 Gabriele Gullà

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

Logic · Mathematics 2022-06-24 Alec Rhea

We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…

Logic · Mathematics 2024-06-19 Alejandro Poveda

This is supplementary material to "Realizations of a special class of admittances with strictly lower complexity than canonical forms" [1], which presents the detailed proofs of some results. For more background information, refer to…

Optimization and Control · Mathematics 2015-01-20 Michael Z. Q. Chen , Kai Wang , Zhan Shu , Chanying Li

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

Logic · Mathematics 2015-06-15 Erin Carmody

We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…

Logic · Mathematics 2016-09-07 Harvey M. Friedman