English
Related papers

Related papers: The set-theoretic Kaufmann-Clote question

200 papers

In light of the celebrated theorem of Vop\v{e}nka (1972), proving in ZFC that every set is generic over HOD, it is natural to inquire whether the set-theoretic universe $V$ must be a class-forcing extension of HOD by some possibly…

Logic · Mathematics 2017-09-25 Joel David Hamkins , Jonas Reitz

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

Logic · Mathematics 2022-03-15 Makoto Fujiwara , Taishi Kurahashi

This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…

General Mathematics · Mathematics 2014-04-28 Enrique Coiras

The Duffin-Schaeffer conjecture is a central open problem in metric number theory. Let $\psi~\mathbb{N} \mapsto \mathbb{R}$ be a non-negative function, and set $\mathcal{E}_n :=\bigcup \left( \frac{a - \psi(n)}{n},\frac{a+\psi(n)}{n}…

Number Theory · Mathematics 2019-07-11 Christoph Aistleitner

For a (minimal) Arithmetical theory with higher Order Objects, i.e. a (minimal) Cartesian closed arithmetical theory -- coming as such with the corresponding closed evaluation -- we interprete here map codes, out of [A,B] say,into these…

Category Theory · Mathematics 2008-10-15 Michael Pfender

We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…

Logic · Mathematics 2009-08-05 Moshe Kamensky

It is sometimes desirable in choiceless constructions of set theory that one iteratively extends some ground model without adding new sets of ordinals after the first extension. Pushing this further, one may wish to have models $V \subseteq…

Logic · Mathematics 2025-10-15 Calliope Ryan-Smith , Jonathan Schilhan , Yujun Wei

A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…

Logic · Mathematics 2008-12-15 Chantal Berline , Giulio Manzonetto , Antonio Salibra

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

We show that induction over $\Delta(\mathbb R)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The…

Logic · Mathematics 2021-07-07 Anton Freund

A Steiner triple system is a set $S$ together with a collection $\mathcal{B}$ of subsets of $S$ of size 3 such that any two elements of $S$ belong to exactly one element of $\mathcal{B}$. It is well known that the class of finite Steiner…

Logic · Mathematics 2025-04-01 Silvia Barbina , Enrique Casanovas

There are certain countably generated sigma-algebras of sets in the real line which do not admit any non-zero, sigma-finite, diffused (or, continuous) measure. Such countably generated sigma-algebras can be obtained by the use of some…

Functional Analysis · Mathematics 2020-02-04 Sanjib Basu , Debasish Sen

This paper proves a commutative algebraic extension of a generalized Skolem-Mahler-Lech theorem due to the first author. Let $A$ be a finitely generated commutative $K$-algebra over a field of characteristic $0$, and let $\sigma$ be a…

Algebraic Geometry · Mathematics 2015-10-06 Jason P. Bell , Jeffrey C. Lagarias

Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that \[\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n^{-1/2} \big) =…

Probability · Mathematics 2025-01-09 Ashwin Sah , Julian Sahasrabudhe , Mehtaab Sawhney

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin

We consider the minimal free resolution of a generic set of n+1 forms (not necessarily of the same degree) in a polynomial ring of n variables. The Hilbert function for such an ideal is known, thanks to a result of Stanley and of Watanabe.…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Rosa Miró-Roig

Kirszbraun's Theorem states that every Lipschitz map $S\to\mathbb R^n$, where $S\subseteq \mathbb R^m$, has an extension to a Lipschitz map $\mathbb R^m \to \mathbb R^n$ with the same Lipschitz constant. Its proof relies on Helly's Theorem:…

Logic · Mathematics 2014-02-26 Matthias Aschenbrenner , Andreas Fischer

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…

Logic · Mathematics 2025-07-08 Michele Bailetti

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

Logic · Mathematics 2009-12-09 John Goodrick , Michael C. Laskowski

Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…

Combinatorics · Mathematics 2024-09-11 Jorge Garcia , Rosemarie Bongers , Jonathan Detgen , Walter Morales
‹ Prev 1 8 9 10 Next ›