English
Related papers

Related papers: On Russell typicality in Set Theory

200 papers

A set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD $\subseteq$ HNT $\subseteq$ V holds.…

Logic · Mathematics 2021-11-29 Vladimir Kanovei , Vassily Lyubetsky

We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class…

Logic · Mathematics 2023-03-22 Athanassios Tzouvaras

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

Logic · Mathematics 2023-12-20 Zuhair Al-Johar

In constructive set theory, an ordinal is a hereditarily transitive set. In homotopy type theory (HoTT), an ordinal is a type with a transitive, wellfounded, and extensional binary relation. We show that the two definitions are equivalent…

Logic in Computer Science · Computer Science 2023-08-15 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

General Mathematics · Mathematics 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

Logic · Mathematics 2025-11-04 Frank Quinn

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…

Logic · Mathematics 2023-03-22 Athanassios Tzouvaras

A conjecture of Leader, Russell and Walters in Euclidean Ramsey theory says that a finite set is Ramsey if and only if it is congruent to a subset of a set whose symmetry group acts transitively. As they have shown the ``if" direction of…

Combinatorics · Mathematics 2019-05-14 Vassilis Kanellopoulos , Miltiadis Karamanlis

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

When working in Homotopy Type Theory and Univalent Foundations, the traditional role of the category of sets, Set, is replaced by the category hSet of homotopy sets (h-sets); types with h-propositional identity types. Many of the properties…

Logic in Computer Science · Computer Science 2025-02-19 Daniel Gratzer , Håkon Gylterud , Anders Mörtberg , Elisabeth Stenholm

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

Logic · Mathematics 2022-04-21 Emil Jeřábek

The assertion that every definable set has a definable element is equivalent over ZF to the principle $V=\text{HOD}$, and indeed, we prove, so is the assertion merely that every $\Pi_2$-definable set has an ordinal-definable element.…

Logic · Mathematics 2017-06-23 François G. Dorais , Joel David Hamkins

This work presents theorems which state (i) Z is a proper subset for any bijection f between A and Z, where Z is contained in P(A), A is a non-finite set and |Z|=|A|, and (ii) being Z a proper subset of P(A) nothing affirms or denies that…

General Mathematics · Mathematics 2007-05-23 Jailton C. Ferreira

We study models of HST, a nonstandard set theory which includes, in particular, the ZFC Replacement and Separation schemata in the language containing the membership and standardness predicates, and Saturation for well-orderable families of…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Michael Reeken

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Logic · Mathematics 2019-06-14 Paul Blain Levy

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…

Logic · Mathematics 2021-07-27 Zuhair Al-Johar

The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…

Logic · Mathematics 2016-11-16 Alex Citkin
‹ Prev 1 2 3 10 Next ›