English
Related papers

Related papers: Typicality \`{a} la Russell in set theory

200 papers

A generalized set theory (GST) is like a standard set theory but also can have non-set structured objects that can contain other structured objects including sets. This paper presents Isabelle/HOL support for GSTs, which are treated as type…

Logic in Computer Science · Computer Science 2022-07-26 Ciarán Dunne , J. B. Wells

In this article we study a class of central extensions of $\mathbb{Z}\wr\mathbb{Z}$, as first described by Hall. On the one hand, we consider groups of this type with cyclic centre, our construction yields a rich class of groups. In…

Group Theory · Mathematics 2026-01-23 Lukas Vandeputte

We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $\emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the…

Logic · Mathematics 2025-11-18 Ehud Hrushovski , Krzysztof Krupiński , Anand Pillay

This paper introduces Relational Type Theory (RelTT), a new approach to type theory with extensionality principles, based on a relational semantics for types. The type constructs of the theory are those of System F plus relational…

Logic in Computer Science · Computer Science 2021-01-26 Aaron Stump , Benjamin Delaware , Christopher Jenkins

In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context…

Logic in Computer Science · Computer Science 2016-03-24 Michele Pagani , Christine Tasson , Lionel Vaux

This thesis introduces the idea of two-level type theory, an extension of Martin-L\"of type theory that adds a notion of strict equality as an internal primitive. A type theory with a strict equality alongside the more conventional form of…

Logic in Computer Science · Computer Science 2017-02-17 Paolo Capriotti

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Computational Complexity · Computer Science 2013-09-24 Armin Hemmerling

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

Information Theory · Computer Science 2016-11-17 Junekey Jeon

Homotopy type theory (HoTT) can be seen as a generalisation of structural set theory, in the sense that 0-types represent structural sets within the more general notion of types. For material set theory, we also have concrete models as…

Logic · Mathematics 2025-10-31 Håkon Robbestad Gylterud , Elisabeth Stenholm

This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…

Mathematical Physics · Physics 2023-09-06 Klaas Landsman

An algebraization of the notion of topology has been proposed more than seventy years ago in a classical paper by McKinsey and Tarski. However, in McKinsey and Tarski's setting the model theoretical notion of homomorphism does not…

General Topology · Mathematics 2025-07-24 Paolo Lipparini

Librationist set theory \pounds ${}$ is developed. It descends from semantics for truth, initiated by Kripke, and others. # extends \pounds, of Librationist closures of the paradoxes in Logic and Logical Philosophy 21(4), 323-361, 2012.…

Logic · Mathematics 2025-05-13 Frode A. Bjørdal

A new mathematical object called a skand is introduced, which turns out in general to be a non-well-founded set. Skands of finite lengths are ordinary well-founded sets, and skands of very long length (like the hyper-skand of all ordinals)…

Logic · Mathematics 2012-08-03 Ju. T. Lisica

In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…

Logic · Mathematics 2025-10-03 Łukasz Kamiński

Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…

Commutative Algebra · Mathematics 2019-10-15 Dmitry Kerner

Let G be a group and H be a subgroup of G which is either finite or of finite index in G. In this note, we give some characterizations for normality of H in G. As a consequence we get a very short and elementary proof of the Main Theorem of…

Group Theory · Mathematics 2012-03-13 Vipul Kakkar , R. P. Shukla

We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class…

Logic · Mathematics 2016-09-14 Joel David Hamkins , Cole Leahy

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 Egbert Rijke

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If…

Group Theory · Mathematics 2025-04-07 Leonid Polterovich , Yehuda Shalom , Zvi Shem-Tov