中文
相关论文

相关论文: The pair $(\aleph_n,\aleph_0)$ may fail $\aleph_0$…

200 篇论文

A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…

概率论 · 数学 2018-02-02 Moumanti Podder

Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…

逻辑 · 数学 2016-05-03 Jacob Davis

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

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

We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T|<= mu, I subseteq C, |I| >=beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an…

逻辑 · 数学 2009-02-15 Saharon Shelah

We begin with the existence of groups with trivial duals for cardinals aleph_n (n in omega). Then we derive results about strongly aleph_n-free abelian groups of cardinality aleph_n (n in omega) with prescribed free, countable endomorphism…

群论 · 数学 2007-05-23 Rüdiger Göbel , Saharon Shelah

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

逻辑 · 数学 2026-04-09 Hrafn Valtýr Oddsson

We consider relational semantics (R-models) for the Lambek calculus extended with intersection and explicit constants for zero and unit. For its variant without constants and a restriction which disallows empty antecedents, Andreka and…

计算机科学中的逻辑 · 计算机科学 2024-02-14 Stepan L. Kuznetsov

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…

逻辑 · 数学 2015-03-03 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

综合数学 · 数学 2010-02-25 J. A. Perez

The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…

逻辑 · 数学 2020-04-17 Ziemowit Kostana

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

逻辑 · 数学 2026-05-14 Mohammad Golshani , Grigorii Stepanov , Reihane Zoghifard

It is proved consistent with either CH or the negation of CH that there is an aleph_1-separable group of cardinality aleph_1 which does not have a coherent system of projections. It had previously been shown that it is consistent with not…

逻辑 · 数学 2016-09-06 Paul C. Eklof , Alan H. Mekler , Saharon Shelah

We study two analogs, for modular forms over $\mathbb{F}_{q}(T)$, of the pairing between Hecke algebra and cusp forms given by the first coefficient in the expansion. For Drinfeld modular forms, the $\mathbb{C}_{\infty}$-pairing is provided…

数论 · 数学 2024-08-22 Cécile Armana

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

逻辑 · 数学 2019-12-24 Vera Fischer

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…

计算机科学中的逻辑 · 计算机科学 2021-05-26 Rineke Verbrugge

We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…

综合数学 · 数学 2016-08-30 Ahmad Sabihi

We give several new equivalences of $NIP$ for formulas and new proofs of known results using [T87] and [HOR91]. We emphasize that Keisler measures are more complicated than types (even in $NIP$ context), in an analytic sense. Among other…

逻辑 · 数学 2024-08-28 Karim Khanaki

We investigate a notion called uniqueness in power kappa that is akin to categoricity in power kappa, but is based on the cardinality of the generating sets of models instead of on the cardinality of their universes. The notion is quite…

逻辑 · 数学 2016-09-06 Steven Givant , Saharon Shelah

The Wholeness Axioms, proposed by Paul Corazza, axiomatize the existence of an elementary embedding j:V-->V. Formalized by augmenting the usual language of set theory with an additional unary function symbol j to represent the embedding,…

逻辑 · 数学 2007-05-23 Joel David Hamkins

Suppose that $K$ is a characteristic zero field with infinite transcendence degree over its prime subfield. We show that if there is a gt-henselian topology on $K$ then there are $2^{2^{|K|}}$ pairwise incomparable gt-henselian topologies…

逻辑 · 数学 2025-12-29 Erik Walsberg