English
Related papers

Related papers: Local Sentences and Mahlo Cardinals

200 papers

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…

Probability · Mathematics 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…

Logic · Mathematics 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…

Mathematical Physics · Physics 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…

Algebraic Geometry · Mathematics 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…

Classical Analysis and ODEs · Mathematics 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…

Analysis of PDEs · Mathematics 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…

Number Theory · Mathematics 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…

Programming Languages · Computer Science 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…

Logic · Mathematics 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…

Logic · Mathematics 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…

Quantum Physics · Physics 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…

Logic in Computer Science · Computer Science 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…

Logic · Mathematics 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…

Logic · Mathematics 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,…

Logic · Mathematics 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…

Information Theory · Computer Science 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.…

Logic · Mathematics 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…

Representation Theory · Mathematics 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…

Logic in Computer Science · Computer Science 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…

Logic · Mathematics 2026-03-17 Maxwell Levine , Heike Mildenberger