中文
相关论文

相关论文: Structures Associated with Real Closed Fields and …

200 篇论文

We study the arithmetic structure of the exceptional set of projections. For any bounded subset $E\subset \mathbb{R}^d$, let $$ \Omega=\{\xi\in \mathbb{R}: \dim_B(E+\xi E)=\dim_B E\}. $$ We prove that either $\Omega=\{0\}$ or $\Omega$ is a…

经典分析与常微分方程 · 数学 2024-11-18 Changhao Chen , Zhengyan Miao

In this paper, we prove the following Theorems 1. An extremally disconnected space $X$ has the semi-Menger property if and only if One does not have a winning strategy in the game $G_{fin}(sO,sO)$. 2. An extremally disconnected space $X$…

一般拓扑 · 数学 2023-03-10 Manoj Bhardwaj , Alexander V. Osipov

Let $\mathcal{Z(R)}$ be the set of zero divisor elements of a commutative ring $R$ with identity and $\mathcal{M}$ be the space of minimal prime ideals of $R$ with Zariski topology. An ideal $I$ of $R$ is called strongly dense ideal or…

一般拓扑 · 数学 2014-01-31 A. Taherifar

We use a new construction of an o-minimal structure, due to Lipshitz and Robinson, to answer a question of van den Dries regarding the relationship between arbitrary o-minimal expansions of real closed fields and structures over the real…

逻辑 · 数学 2007-05-23 Ehud Hrushovski , Ya'acov Peterzil

This article is Part I in a series of three papers devoted to determining the minimal complexity of scales in the inner model $K(\mathbb{R})$. Here, in Part I, we shall complete our development of a fine structure theory for $K(\mathbb{R})$…

逻辑 · 数学 2007-05-23 D. W. Cunningham

We describe the Dedekind cuts explicitly in terms of non-standard rational numbers. This leads to another construction of a Dedekind complete totally ordered field or, equivalently, to another proof of the consistency of the axioms of the…

逻辑 · 数学 2011-01-21 James F. Hall , Todor D. Todorov

We present axioms for the real numbers by omitting the field axioms and then derive the field properties of the real numbers. We prove all our theorems constructively.

逻辑 · 数学 2021-09-13 Jean S. Joseph

Church's Higher Order Logic is a basis for influential proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We factor HOL into a constructive core plus axioms of…

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

Let $\mathcal{R}$ be an expansion of the ordered real additive group. When $\mathcal{R}$ is o-minimal, it is known that either $\mathcal{R}$ defines an ordered field isomorphic to $(\mathbb{R},<,+,\cdot)$ on some open subinterval…

逻辑 · 数学 2021-03-09 Philipp Hieronymi , Erik Walsberg

We investigate integration of classes of real-valued continuous functions on (0,1]. Of course difficulties arise if there is a non-$L^1$ element in the class, and the Hadamard finite part integral ({\em p.f.}) does not apply. Such singular…

泛函分析 · 数学 2014-08-21 Ovidiu Costin , Harvey M. Friedman

This paper studies structural consequences of supercompactness of $\omega_1$ under $\sf{ZF}$. We show that the Axiom of Dependent Choice $(\sf{DC})$ follows from "$\omega_1$ is supercompact". "$\omega_1$ is supercompact" also implies that…

逻辑 · 数学 2019-04-04 Daisuke Ikegami , Nam Trang

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Viktor Kuncak , Martin Rinard

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…

逻辑 · 数学 2008-06-13 Arnold W. Miller

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

数论 · 数学 2007-05-23 Ernie Croot

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

逻辑 · 数学 2010-10-01 Damir D. Dzhafarov , Carl Mummert

Given a model $\mathcal{M}$ of set theory, and a nontrivial automorphism $j$ of $\mathcal{M}$, let $\mathcal{I}_{\mathrm{fix}}(j)$ be the submodel of $\mathcal{M}$ whose universe consists of elements $m$ of $\mathcal{M}$ such that $j(x)=x$…

逻辑 · 数学 2016-11-24 Ali Enayat , Matt Kaufmann , Zachiri McKenzie

We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…

逻辑 · 数学 2023-01-02 Daisuke Ikegami , Philipp Schlicht

The statement of Lemma 3.1 in the published paper is not correct. Lemma 3.1 is needed for the proof of Theorem 3.2. Theorem 3.2 as originally stated is true but its "proof" is not correct. Here we change the statements and proofs of Lemma…

环与代数 · 数学 2016-01-28 S. Paul Smith

Although irregular vectors for the Virasoro algebra are widely used in modern mathematical physics, a rigorous existence and uniqueness theorem in arbitrary rank has not been available in the literature. In this paper, we develop an…

数学物理 · 物理学 2026-05-28 Hajime Nagoya

While statistical learning methods have proved powerful tools for predictive modeling, the black-box nature of the models they produce can severely limit their interpretability and the ability to conduct formal inference. However, the…

机器学习 · 统计学 2016-08-30 Lucas Mentch , Giles Hooker