中文
相关论文

相关论文: Remarks on Barr's theorem: Proofs in geometric the…

200 篇论文

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

逻辑 · 数学 2023-09-27 Richard Matthews , Michael Rathjen

We construct the geometric Langlands functor in one direction (from the automorphic to the spectral side) in characteristic zero settings (i.e., de Rham and Betti). We prove that various forms of the conjecture (de Rham vs Betti, restricted…

代数几何 · 数学 2025-10-02 Dennis Gaitsgory , Sam Raskin

In this memoir, we seek to construct a constructive theory that is as complete as possible to describe the algebraic properties of the real number field in constructive mathematics without a dependent choice axiom. To this purpose, we use a…

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

This book presents our case in defense of a constructivist epistemological framework and the use of compatible statistical theory and inference tools. The basic metaphor of decision theory is the maximization of a gambler's expected…

其他统计学 · 统计学 2025-12-25 J. M. Stern

It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…

范畴论 · 数学 2015-11-25 Dragan Masulovic , Lynn Scow

We study `definable' subsets of Baire space $\mathcal{N}$. The logic of our arguments is intuitionistic and we use L.E.J.~Brouwer's Thesis on bars in $\mathcal{N}$ and his continuity axioms. We avoid the operation of taking the complement…

逻辑 · 数学 2022-04-22 Wim Veldman

In this paper we present a proof of the BMZ Reduction Lemma with a motivational perspective, and state this lemma for maps to manifolds using the classical definition of cohomological dimension. The lemma, proved and utilized in [4], gives…

代数拓扑 · 数学 2015-02-27 Satya Deo

We describe an infinitary logic for metric structures which is analogous to $L_{\omega_1, \omega}$. We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using…

逻辑 · 数学 2019-05-31 Christopher J. Eagle

We use derived localization of the bar and nerve constructions to provide simple proofs of a number of results in algebraic topology. This includes a recent generalization of Adams' cobar-construction to the non-simply connected case, and a…

代数拓扑 · 数学 2021-09-30 Joe Chuang , Julian Holstein , Andrey Lazarev

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

Boolos's proof of incompleteness is extended straightforwardly to yield simple ``diagonalization-free'' proofs of some classical limitative theorems of logic.

逻辑 · 数学 2007-05-23 Gyorgy Sereny

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

数据结构与算法 · 计算机科学 2015-03-19 Martin Grohe , Dániel Marx

This article contains a complete proof of Gabrielov's rank Theorem, a fundamental result in the study of analytic map germs. Inspired by the works of Gabrielov and Tougeron, we develop formal-geometric techniques which clarify the difficult…

复变函数 · 数学 2021-06-30 André Belotto da Silva , Octave Curmi , Guillaume Rond

This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…

计算机科学中的逻辑 · 计算机科学 2014-09-01 Ernst-Erich Doberkat

The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…

人工智能 · 计算机科学 2024-01-23 Pedro Quaresma , Pierluigi Graziani , Stefano M. Nicoletti

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

代数几何 · 数学 2008-08-20 E. Daniyarova , A. Myasnikov , V. Remeslennikov

This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos,…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Ian Orton , Andrew M. Pitts

A well-known conjecture of Gross and Zagier states that the values of the higher automorphic Green's function at pairs of points with complex multiplication in the upper half-plane are proportional to the logarithm of an algebraic number.…

数论 · 数学 2025-08-19 Francis Brown , Tiago J. Fonseca

The goal of this notice is to present a proof of Bachet's conjecture based exclusively on the fundamental theorem of arithmetic. The novelty of this proof consists in its introduction of a partial order on rational integers through the…

数论 · 数学 2013-10-22 Felix Sidokhine

For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…

离散数学 · 计算机科学 2009-09-29 R. R. Kamalian , V. V. Mkrtchyan