中文
相关论文

相关论文: Every countable model of set theory embeds into it…

200 篇论文

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…

逻辑 · 数学 2012-06-12 Andreas Fackler

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

逻辑 · 数学 2025-08-12 Anand Pillay , Predrag Tanović

It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to…

逻辑 · 数学 2022-08-30 Tapani Hyttinen , Jouko Väänänen

We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…

微分几何 · 数学 2007-05-23 Benson Farb , Shmuel Weinberger

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

逻辑 · 数学 2025-08-07 James E. Hanson

We show that certain classes of modules have universal models with respect to pure embeddings. $Theorem.$ Let $R$ be a ring, $T$ a first-order theory with an infinite model extending the theory of $R$-modules and $K^T=(Mod(T), \leq_{pp})$…

逻辑 · 数学 2020-02-24 Thomas G. Kucera , Marcos Mazari-Armida

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

逻辑 · 数学 2022-06-24 Alec Rhea

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Wojciech Moczydlowski

We characterize those standard models M of ZFC which are embeddable, as the class of all standard sets, in a model of internal set theory IST. The necessary and sufficient condition is that 1) there is a wellordering < of M which does not…

逻辑 · 数学 2007-05-23 Vladimir Kanovei , Michael Reeken

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

逻辑 · 数学 2019-03-08 Philip Welch

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

群论 · 数学 2020-09-22 Vitaly Roman'kov

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…

逻辑 · 数学 2023-12-20 Zuhair Al-Johar

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

环与代数 · 数学 2008-01-09 Martin Goldstern

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

逻辑 · 数学 2019-01-11 Krzysztof Krupinski , Anand Pillay

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

逻辑 · 数学 2007-05-23 John Goodrick

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

逻辑 · 数学 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

We study the structural regularities and irregularities of the reals in inner models of set theory. Starting with $L$, G\"{o}del's constructible universe, our study of the reals is thus two-fold. On the one hand, we study how their…

逻辑 · 数学 2022-08-16 Martín Soto Quintanilla

We consider the algebra $\mathcal O(\mathsf M)$ of observables and the (formally) versal morphism $\eta: A \to \mathcal O(\mathsf M)$ defined by the noncommutative deformation functor $\mathsf{Def}_{\mathsf M}$ of a family $\mathsf M = \{…

表示论 · 数学 2019-12-09 Eivind Eriksen , Arvid Siqveland

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

泛函分析 · 数学 2008-12-18 Marianne Morillon

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

逻辑 · 数学 2021-11-30 Saeed Salehi