相关论文: PCF without choice
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We introduce the notion of $\mathcal{C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and…
We introduce a model-theoretic characterization of Magidor cardinals, from which we infer that Magidor filters are beyond ZFC-inconsistency
Theorem: There is a {\em complete sentence} $\phi$ of $L_{\omega_1,\omega}$ such that $\phi$ has maximal models in a set of cardinals $\lambda$ that is cofinal in the first measurable $\mu$ while $\phi$ has no maximal models in any $\chi…
Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
The search for a logic capturing PTIME is a long standing open problem in finite model theory. One of the most promising candidate logics for this is Choiceless Polynomial Time with counting (CPT). Abstractly speaking, CPT is an…
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…
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of this form. It…
Assuming the existence of a supercompact cardinal and an inaccessible above it, we construct a model of ZFC, in which all uncountable regular cardinals are inaccessible in HOD.
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…
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…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…
We show how the categorical logic of untyped, simply typed and dependently typed lambda calculus can be structured around the notion of category with family (cwf). To this end we introduce subcategories of simply typed cwfs (scwfs), where…
We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…