English
Related papers

Related papers: A null ideal for inaccessibles

200 papers

For certain uncountable cardinals $\kappa$ we produce a group of cardinality $\kappa$ which is freely indecomposable, strongly $\kappa$-free, and whose abelianization is free abelian of rank $\kappa$. The construction takes place in…

Group Theory · Mathematics 2020-10-07 Samuel M. Corson

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a…

Formal Languages and Automata Theory · Computer Science 2017-08-25 Martin Sulzmann , Peter Thiemann

After small forcing, any < kappa-closed forcing will destroy the supercompactness, even the strong compactness, of kappa .

Logic · Mathematics 2008-02-03 Joel David Hamkins , Saharon Shelah

Our aim is to improve the negative results i.e. non-existence of limit models, and the failure of the generic pair property from math.LO/0609636 to inaccessible lambda as promised there. The motivation is that in [Sh:F756] the positive…

Logic · Mathematics 2011-01-06 Saharon Shelah

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…

Logic · Mathematics 2015-10-15 Carolin Antos , Sy-David Friedman

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…

Logic in Computer Science · Computer Science 2026-01-23 Thorsten Wißmann , Bálint Kocsis , Jurriaan Rot , Ruben Turkenburg

We study the influence of the existence of large cardinals on the existence of wellorderings of power sets of infinite cardinals $\kappa$ with the property that the collection of all initial segments of the wellordering is definable by a…

Logic · Mathematics 2017-04-04 Philipp Lücke , Philipp Schlicht

We show that if the universe is self-iterable and $\kappa$ is an inaccessible limit of Woodin cardinal then $AD_R + "\Theta$ is regular" holds in the derived model at $\kappa$. The proof is fine-structure free, and only assumes basic…

Logic · Mathematics 2021-11-15 Grigor Sargsyan , Takehiko Gappo

Usuba has asked whether the $\kappa$-mantle, the intersection of all grounds that extend to $V$ via a forcing of size ${<}\kappa$, is always a model of ZFC. We give a negative answers by constructing counterexamples where $\kappa$ is a…

Logic · Mathematics 2024-03-15 Andreas Lietz

We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…

Logic · Mathematics 2025-01-20 John Krueger , Sarka Stejskalova

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

Commutative Algebra · Mathematics 2017-07-28 Danny A. J. Gomez-Ramirez , Holger Brenner

Assume ZFC. Let $\kappa$ be a cardinal. Recall that a ${<\kappa}$-ground is a transitive proper class $W$ modelling ZFC such that $V$ is a generic extension of $W$ via a forcing $\mathbb{P}\in W$ of cardinality ${<\kappa}$, and the…

Logic · Mathematics 2025-05-14 Farmer Schlutzenberg

Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…

Logic · Mathematics 2025-02-05 Miguel A. Cardona , Miroslav Repický , Saharon Shelah

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

Logic in Computer Science · Computer Science 2024-05-24 Ludwig Staiger

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Logic · Mathematics 2020-05-27 Alejandro Poveda , Assaf Rinot , Dima Sinapova

We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…

Logic · Mathematics 2021-04-20 Assaf Rinot

We introduce and investigate a class of non-separable tree-like Banach spaces. As a consequence, we prove that we can not achieve a satisfactory extension of Rosenthal's $\ell_1$-theorem to spaces of the type $\ell_1(\kappa)$, for $\kappa$…

Functional Analysis · Mathematics 2012-10-03 Costas Poulios

Let $\kappa$ be an inaccessible cardinal, $\mathfrak{U}$ be a universal algebra, and $\sim$ be the equivalence relation on $\mathfrak{U}^{\kappa}$ of eventual equality. From mild assumptions on $\kappa$ we give general constructions of…

Logic · Mathematics 2022-11-28 Samuel M. Corson , Saharon Shelah
‹ Prev 1 4 5 6 7 8 10 Next ›