English
Related papers

Related papers: Self-similarity in the Foundations

200 papers

In this paper we exploit the structural properties of standard and non-standard models of set theory to produce models of set theory admitting automorphisms that are well-behaved along an initial segment of their ordinals. $\mathrm{NFU}$ is…

Logic · Mathematics 2013-10-22 Zachiri McKenzie

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

This article was motivated by the discovery of a potential new foundation for mainstream mathematics. The goals are to clarify the relationships between primitives, foundations, and deductive practice; to understand how to determine what…

History and Overview · Mathematics 2025-02-18 Frank Quinn

In this paper, we present a proof of the consistency of the New Foundations set theory ($\mathit{NF}$). $\mathit{NF}$'s main idea is to permit very large sets (including the Universal Set) by restricting set formation to stratified…

Logic · Mathematics 2025-09-05 Nicolás Sevilla Simón

We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…

Category Theory · Mathematics 2010-06-25 Misha Gavrilovich

Using techniques developed in the revision theory of truth, I build a model for the set theory NF (New Foundations) developed by Quine in ZF, therefore proving its consistency relative to ZF. The model is essentially a term model; the sets…

Logic · Mathematics 2007-05-23 Mika Oksanen

The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…

Computational Complexity · Computer Science 2017-01-09 Hubie Chen , Moritz Müller

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

This paper is primarily concerned with assessing a set-theoretical system, $S^*$, for the foundations of category theory suggested by Solomon Feferman. $S^*$ is an extension of NFU, and may be seen as an attempt to accommodate unrestricted…

Logic · Mathematics 2016-03-11 Ali Enayat , Paul Gorbow , Zachiri McKenzie

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…

Logic · Mathematics 2023-06-05 Frank Quinn

The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…

Logic · Mathematics 2019-02-27 Andrei Alexandru , Gabriel Ciobanu

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

Tanaka (1997) proved a powerful generalization of Friedman's self-embedding theorem that states that given a countable nonstandard model $(\mathcal{M},\mathcal{A})$ of the subsystem $\mathrm{WKL}_{0}$ of second order arithmetic, and any…

Logic · Mathematics 2020-02-25 Saeideh Bahrami

We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…

Logic in Computer Science · Computer Science 2026-02-03 Przemysław Andrzej Wałęga , Bernardo Cuenca Grau

Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…

Logic in Computer Science · Computer Science 2012-03-29 Arnon Avron

This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…

Machine Learning · Computer Science 2020-09-23 Balasubramaniam Srinivasan , Bruno Ribeiro

Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…

Logic · Mathematics 2024-01-02 Tim Button

The concept of definability of physical fields within a set-theoretical foundation is introduced. We propose an axiomatic set theory and show the Schroedinger equation and, more generally, a nonlinear sigma model come naturally out of the…

Mathematical Physics · Physics 2007-05-23 D. J. BenDaniel

When developing and assessing density functional theory methods, a finite basis set is usually employed. In most cases, however, the issue of basis set dependency is neglected. Here, we assess several basis sets and functionals. In…

Chemical Physics · Physics 2007-05-23 A. Daniel Boese , Jan M. L. Martin , Nicholas C. Handy