中文
相关论文

相关论文: Brown's lemma in second-order arithmetic

200 篇论文

We establish a version of Gabber's presentation lemma in the setting of varieties with an action by the finite group of order 2.

代数几何 · 数学 2024-03-08 Tom Bachmann

A cyclic proof system gives us another way of representing inductive definitions and efficient proof search. In 2011 Brotherston and Simpson conjectured the equivalence between the provability of the classical cyclic proof system and that…

计算机科学中的逻辑 · 计算机科学 2017-12-12 Stefano Berardi , Makoto Tatsuta

This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Anupam Das , Colin Riba

We study the reverse mathematics of characterization theorems of regular countable second countable spaces (or $CSCS$ for short). We prove that arithmetic comprehension is equivalent over $\textbf{RCA}_0$ to every $T_3$ $CSCS$ being…

逻辑 · 数学 2024-10-30 Giorgio G. Genovesi

We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…

逻辑 · 数学 2011-11-01 François G. Dorais

Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.

组合数学 · 数学 2013-06-26 Landon Rabern

The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…

机器学习 · 计算机科学 2026-05-28 Xinyu Liu , Zixuan Xie , Shangtong Zhang

Second-order quantifier-elimination is the problem of finding, given a formula with second-order quantifiers, a logically equivalent first-order formula. While such formulas are not computable in general, there are practical algorithms and…

计算机科学中的逻辑 · 计算机科学 2025-06-03 Fabian Achammer , Stefan Hetzl , Renate A. Schmidt

We establish a Brownian extension to Selberg's central limit theorem for the Riemann zeta function. This implies various limiting distributions for $\zeta$, including an analogue of the reflection principle for the maximum of the Brownian…

数论 · 数学 2025-05-13 Louis Vassaux

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

逻辑 · 数学 2025-10-06 Mikhail Rybakov

In this short note we prove the logarithmic Sobolev inequality with derivatives of fractional order on $\mathbb{R}^n$ with an explicit expression for the constant. Namely, we show that for all $0<s<\frac{n}{2}$ and $a>0$ we have the…

泛函分析 · 数学 2023-02-13 Marianna Chatzakou , Michael Ruzhansky

This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman--Sondermann theorem within the framework of reverse…

逻辑 · 数学 2024-04-25 Benedict Eastaugh

It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…

经典分析与常微分方程 · 数学 2021-10-13 el Houcein el Abdalaoui

This paper proves that the equational theory of the class $RA_{\alpha}^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_{\alpha}^{cp}$, for finite $\alpha$. That is, substitutions of…

逻辑 · 数学 2025-06-17 Hajnal Andréka , Zalán Gyenis , István Németi

Higman's lemma states that for any well partial order $X$, the partial order $X^*$ of finite sequences with members from $X$ is also well. By combining results due to Girard as well as Sch\"{u}tte and Simpson, one can show that Higman's…

逻辑 · 数学 2025-07-30 Patrick Uftring

We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…

计算机科学中的逻辑 · 计算机科学 2023-12-05 Arno Pauly , Cécilia Pradic , Giovanni Solda

Let $C_2$ be the cyclic group of order two. We show that the $RO(C_2)$-graded Bredon cohomology of a finite Rep($C_2$)-complex is free as a module over the cohomology of a point when using coefficients in the constant Mackey functor…

代数拓扑 · 数学 2021-09-14 Eric Hogle , Clover May

We study the pigeonhole principle for $\Sigma_2$-definable injections with domain twice as large as the codomain, and the weak K\"onig lemma for $\Delta^0_2$-definable trees in which every level has at least half of the possible nodes. We…

逻辑 · 数学 2019-12-10 David Belanger , Chitat Chong , Wei Wang , Tin Lok Wong , Yue Yang

The Hopf Lemma for second order elliptic operators is proved to hold in domains with $C^{1,\alpha}$, and even less regular, boundaries. It need not hold for $C^1$ boundaries. Corresponding results are proved for second order parabolic…

偏微分方程分析 · 数学 2011-11-10 YanYan Li , L. Nirenberg

Let n be finite >2. We show that any class between S\Nr_n\CA_{n+3} and RCA_n is not atom canonical, and any class containing the class of completely representable algebras and contained in S_c\Nr_n\CA_{n+3} is not elementary. We show that…

逻辑 · 数学 2014-01-07 Tarek Sayed Ahmed