English
Related papers

Related papers: Choiceless large cardinals and set-theoretic poten…

200 papers

In other work we have outlined how, building on ideas of Welch and Roberts, one can motivate believing in the existence of supercompact cardinals. After making this observation we strove to formulate a justification for large-cardinal…

Logic · Mathematics 2018-01-03 Rupert McCallum

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of…

Logic · Mathematics 2025-09-17 Juan P. Aguilera , Joan Bagaria , Philipp Lücke

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

Logic · Mathematics 2022-02-07 Andrew Swan

We work in the setting of Zermelo-Fraenkel set theory without assuming the Axiom of Choice. We consider sets with the Boolean operations together with the additional structure of comparing cardinality (in the Cantorian sense of injections).…

Logic · Mathematics 2025-01-16 Matthew Harrison-Trainor , Dhruv Kulshreshtha

This paper addresses fundamental issues on the nature of the concepts and structures of fuzzy logic, focusing, in particular, on the conceptual and functional differences that exist between probabilistic and possibilistic approaches. A…

Artificial Intelligence · Computer Science 2013-04-05 Enrique H. Ruspini

When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…

Artificial Intelligence · Computer Science 2013-02-18 Choh Man Teng

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

Logic · Mathematics 2023-09-27 Victoria Gitman , Richard Matthews

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 present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

It is well-known that a finite axiomatization of Zermelo-Fraenkel set theory (ZF) is not possible in the same first-order language. In this note we show that a finite axiomatization is possible if we extent the language of ZF with the new…

General Mathematics · Mathematics 2018-06-05 Marcoen Cabbolet

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

Logic · Mathematics 2023-06-22 David Asperó , Asaf Karagila

Probabilistic argumentation is an alternative to causal modeling with Bayesian networks. Probabilistic argumentation structures (PAS) are defined on families of compatible frames (f.c.f). This is a generalization of the usual multivariate…

Information Theory · Computer Science 2018-10-09 Juerg Kohlas

We study the logical structure of Teichm{\"u}ller-Tukey lemma, a maximality principle equivalent to the axiom of choice and show that it corresponds to the generalisation to arbitrary cardinals of update induction, a well-foundedness…

Logic in Computer Science · Computer Science 2024-05-17 Hugo Herbelin

The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…

Logic · Mathematics 2016-08-31 Samuel Drapeau , Asgar Jamneshan , Martin Karliczek , Michael Kupper

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

A transitive model $M$ of ZFC is called a ground if the universe $V$ is a set forcing extension of $M$. We show that the grounds of $V$ are downward set-directed. Consequently, we establish some fundamental theorems on the forcing method…

Logic · Mathematics 2018-07-23 Toshimichi Usuba

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Logic · Mathematics 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

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…

Logic · Mathematics 2017-04-06 Giorgio Audrito , Silvia Steila

In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…

Logic · Mathematics 2020-01-07 Toshimichi Usuba