中文
相关论文

相关论文: Local Sentences and Mahlo Cardinals

200 篇论文

We introduce the notion of linear multifractional stable sheets in the broad sense (LMSS) with $\alpha\in(0,2]$, to include both linear multifractional Brownian sheets ($\alpha=2$) and linear multifractional stable sheets ($\alpha<2$). The…

概率论 · 数学 2022-06-16 Yujia Ding , Qidi Peng , Yimin Xiao

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

逻辑 · 数学 2025-05-22 Will Boney , Jonathan Osinski

We consider collections of $N$ chordal random curves obtained from a critical lattice model on a planar graph, in the limit when a fine-mesh graph approximates a simply-connected domain. We define and study candidates for such limits in…

数学物理 · 物理学 2019-03-26 Alex Karrila

The goal of this note is to show that in the case of transversal intersections the "true local terms" appearing in the Lefschetz trace formula equal to the "naive local terms". To prove the result we extend the method of [Va], where the…

代数几何 · 数学 2021-11-29 Yakov Varshavsky

We establish the equivalence between the regularity (rectifiability) of sets and suitable estimates on the oscillation of the gradient for smooth non-local distance functions. A prototypical example of such a distance was introduced, as…

经典分析与常微分方程 · 数学 2022-08-16 Max Engelstein , Cole Jeznach , Svitlana Mayboroda

We study variational problems for second order supremal functionals $\mathrm F_\infty(u)= \|F(\cdot,u,\mathrm D u,\mathrm{A}\!:\!\mathrm D^2u)\|_{\mathrm L^{\infty}(\Omega)}$, where $F$ satisfies certain natural assumptions, $\mathrm A$ is…

偏微分方程分析 · 数学 2024-03-20 Nikos Katzourakis , Roger Moser

Let F be a p-adic field and n a positive integer. The local Langlands conjecture asserts the existence of a bijection between irreducible admissible representations of GL(n,F) and n-dimensional admissible representations of the Weil-Deligne…

数论 · 数学 2008-02-03 Michael Harris

We study the first-order probabilistic programming language introduced by Staton et al. (2016), but with an additional language construct, $\mathbf{stat}$, that, like the fixpoint operator of Atkinson et al. (2018), converts the description…

编程语言 · 计算机科学 2019-12-17 Ekansh Sharma , Daniel M. Roy

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

逻辑 · 数学 2015-06-15 Erin Carmody

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

逻辑 · 数学 2010-12-10 Matteo Viale , Christoph Weiß

We give a necessary condition that a separable measurement can be implemented by local quantum operations and classical communication (LOCC) in any finite number of rounds of communication, generalizing and strengthening a result obtained…

量子物理 · 物理学 2015-07-01 Scott M. Cohen

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

计算机科学中的逻辑 · 计算机科学 2018-05-10 Alexis Bès , Christian Choffrut

As Paris and Harrington have famously shown, Peano Arithmetic does not prove that for all numbers $k,m,n$ there is an $N$ which satisfies the statement $\operatorname{PH}(k,m,n,N)$: For any $k$-colouring of its $n$-element subsets the set…

逻辑 · 数学 2020-08-06 Anton Freund

We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…

逻辑 · 数学 2026-05-05 Radek Honzik

We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language,…

逻辑 · 数学 2017-10-25 Mojtaba Mojtahedi

Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several works have thus been…

信息论 · 计算机科学 2019-06-07 Matthias Grezet , Ragnar Freij-Hollanti , Thomas Westerbäck , Camilla Hollanti

We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…

逻辑 · 数学 2010-12-10 Christoph Weiß

Let F be a non-archimedean local field. We establish the local Langlands correspondence for all inner forms of the group $SL_n (F)$. It takes the form of a bijection between, on the one hand, conjugacy classes of Langlands parameters for…

表示论 · 数学 2016-12-09 Anne-Marie Aubert , Paul Baum , Roger Plymen , Maarten Solleveld

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of…

计算机科学中的逻辑 · 计算机科学 2019-05-10 Andreas Teucke , Marco Voigt , Christoph Weidenbach

Cummings, Foreman, and Magidor investigated the extent to which square principles are compact at singular cardinals. The first author proved that if $\kappa$ is a singular strong limit of uncountable cofinality, all scales on $\kappa$ are…

逻辑 · 数学 2026-03-17 Maxwell Levine , Heike Mildenberger