中文
相关论文

相关论文: The Axiom of Multiple Choice and Models for Constr…

200 篇论文

In this paper it is proved that, when $Q$ is a quiver that admits some closure, for any algebraically closed field $K$ and any finite dimensional $K$-linear representation $\mathcal{X}$ of $Q$, if ${\rm Ext}^1_{KQ}(\mathcal{X},KQ)=0$ then…

表示论 · 数学 2020-07-07 Ayako Itaba , Diego A. Mejia , Teruyuki Yorioka

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

计算机科学中的逻辑 · 计算机科学 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

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

The axiom of countable choice for reals is one of the most basic fragments of the axiom of choice needed in many parts of mathematics. Descriptive choice principles are a further stratification of this fragment by the descriptive complexity…

逻辑 · 数学 2023-07-20 Lucas Wansner , Ned J H Wontner

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

Motivated by possible applications to meromorphic dynamics, and generalising known properties of difference-closed fields, this paper studies the theory CCMA of compact complex manifolds with a generic automorphism. It is shown that while…

逻辑 · 数学 2021-07-14 Martin Bays , Martin Hils , Rahim Moosa

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

逻辑 · 数学 2021-06-21 Ali Enayat

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

逻辑 · 数学 2022-10-11 Joel David Hamkins

Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…

逻辑 · 数学 2025-07-18 Zachiri McKenzie

We show that the standard approach of minimal invariant sets, which applies Zorn's Lemma and is used to prove fixed point theorems for non-expansive mappings in Banach spaces can be applied without any reference to the full Axiom of Choice…

逻辑 · 数学 2017-01-16 Vassilios Gregoriades

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Martin Escardo

By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…

交换代数 · 数学 2010-10-26 Michael Wibmer

The main aim of this work is to show, in the absence of the Axiom of Choice, fundamental results on $\mathbf{E}$-compact extensions of $\mathbf{E}$-completely regular spaces, in particular, on Hewitt realcompactifications and Banaschewski…

一般拓扑 · 数学 2023-10-16 AliReza Olfati , Eliza Wajch

In this paper we examine the natural interpretation of a ramified type hierarchy into Martin-L\"of type theory with an infinite sequence of universes. It is shown that under this predicative interpretation some useful special cases of…

逻辑 · 数学 2017-04-25 Erik Palmgren

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Yves Bertot

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…

逻辑 · 数学 2012-02-17 Robert A. Van Wesep

Bishop's constructive mathematics school rejects the Law of Excluded Middle, but instead vastly makes use of weaker versions of the Choice. In this paper we pioneer an example, which shows that this road is not consistent, as our example…

逻辑 · 数学 2025-01-22 Babak Jabbar Nezhad

Finite \'etale covers of a connected scheme $X$ are parametrised by the \'etale fundamental group via the monodromy correspondence. This was generalised to an exodromy correspondence for constructible sheaves, first in the topological…

代数几何 · 数学 2024-10-10 Remy van Dobben de Bruyn

A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…

逻辑 · 数学 2009-09-25 Paul C. Eklof , Saharon Shelah

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

逻辑 · 数学 2007-05-23 Wilfrid Hodges , Saharon Shelah