中文
相关论文

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

200 篇论文

In an extended abstract Ressayre considered real closed exponential fields and integer parts that respect the exponential function. He outlined a proof that every real closed exponential field has an exponential integer part. In the present…

逻辑 · 数学 2013-01-01 Paola D'Aquino , Julia F. Knight , Salma Kuhlmann , Karen Lange

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

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…

逻辑 · 数学 2026-02-24 Valentyn Khokhlov

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

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim

The Axiom of Choice (AC for short) is the most (in)famous axiom of the usual foundations of mathematics, ZFC set theory. The (non-)essential use of AC in mathematics has been well-studied and thoroughly classified. Now, fragments of…

逻辑 · 数学 2020-11-04 Dag Normann , Sam Sanders

It is well-known that within Zermelo-Fraenkel set theory (ZF), the Axiom of Choice (AC) implies the Maximal Ideal Theorem (MIT), namely that every nontrivial commutative ring has a maximal ideal. The converse implication MIT $\Rightarrow$…

交换代数 · 数学 2025-06-30 Alexei Entin

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

逻辑 · 数学 2021-07-26 Asaf Karagila

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

综合数学 · 数学 2021-06-15 Marcoen J. T. F. Cabbolet

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

逻辑 · 数学 2011-12-13 Eric J. Hall , Saharon Shelah

In this memoir, we seek to construct a dynamical theory as complete as possible to describe the algebraic properties of the field of real numbers in constructive mathematics without axiom of dependent choice. We propose a theory which turns…

逻辑 · 数学 2024-10-18 Henri Lombardi , Assia Mahboubi

Let K be a field and \tilde{K} denote the set of all r \in K for which there exists a finite set A(r) with {r} \subseteq A(r) \subseteq K such that each mapping f:A(r) \to K that satisfies: if 1 \in A(r) then f(1)=1, if a,b \in A(r) and a+b…

逻辑 · 数学 2007-05-23 Apoloniusz Tyszka

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…

计算机科学中的逻辑 · 计算机科学 2019-06-11 Tianyu Sun , Wensheng Yu

Let K be a subfield of the real field, D be a discrete subset of K and f : D^n -> K be a function such that f(D^n) is somewhere dense. Then (K,f) defines the set of integers. We present several applications of this result. We show that K…

逻辑 · 数学 2011-12-23 Philipp Hieronymi

We develop an abstract axiomatic theory of tie-breaking. A tie-breaking input consists of a finite set N of players, a weak order on N representing the standings to be refined, and an auxiliary information item drawn from a set on which the…

计算机科学与博弈论 · 计算机科学 2026-05-25 Frank M. V. Feys

We show that every henselian valued field $L$ of residue characteristic 0 admits a proper subfield $K$ which is dense in $L$. We present conditions under which this can be taken such that $L|K$ is transcendental and $K$ is henselian. These…

交换代数 · 数学 2010-03-31 Franz-Viktor Kuhlmann

We introduce a formal theory called Flow where the intended interpretation of its terms is that of function. We prove ZF, ZFC and ZFU (ZF with atoms) can be immersed within Flow as natural consequences from our framework. Our first…

The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…

计算机科学中的逻辑 · 计算机科学 2021-04-27 Lawrence C. Paulson
‹ 上一页 1 2 3 10 下一页 ›