Related papers: A Logspace Constructive Proof of L=SL

In this article, we develop the theory of weighted $L^2$ Sobolev spaces on unbounded domains in $\mathbb R^n$. As an application, we establish the elliptic theory for elliptic operators and prove trace and extension results analogous to the…

Linear logic (LL) is a resource-aware, abstract logic programming language that refines both classical and intuitionistic logic. Linear logic semantics is typically presented in one of two ways: by associating each formula with the set of…

We present an exposition of the Auinger-Steinberg proof of the Ribes-Zalesski\u{i} product theorem for pro-V topologies, where V is a pseudovariety of groups closed under extensions with abelian kernel. This proof is self-contained and is…

Potential theory on the complement of a subset of the real axis attracts a lot of attention both in function theory and applied sciences. The paper discusses one aspect of the theory - the logarithmic capacity of closed subsets of the real…

Large language models (LLMs), with demonstrated reasoning abilities across multiple domains, are largely underexplored for time-series reasoning (TsR), which is ubiquitous in the real world. In this work, we propose TimerBed, the first…

Recent large vision-language models (LVLMs) have demonstrated impressive reasoning ability by generating long chain-of-thought (CoT) responses. However, CoT reasoning in multimodal contexts is highly vulnerable to visual hallucination…

We construct a Lie-Rinehart algebra over an infinitesimal extension of the space of initial value fields for Einstein's equations. The bracket relations in this algebra are precisely those of the constraints for the initial value problem.…

Signal Temporal Logic (STL) is a convenient formalism to express bounded horizon properties of autonomous critical systems. STL extends LTL to real-valued signals and associates a non-singleton bound interval to each temporal operators. In…

We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…

In the recent paper arXiv:1807.02721, B. Lawrence and A. Venkatesh develop a method of proving finiteness theorems in arithmetic geometry by studying the geometry of families over a base variety. Their results include a new proof of both…

Let $p$ be a prime number and $F$ a totally real number field unramified at places above $p$. Let $\bar{r}:\operatorname{Gal}(\bar F/F)\rightarrow\operatorname{GL}_2(\bar{\mathbb{F}_p})$ be a modular Galois representation which satisfies…

The well-known Baker-Campbell-Hausdorff theorem in Lie theory says that the logarithm of a noncommutative product e X e Y can be expressed in terms of iterated commutators of X and Y. This paper provides a gentle introduction t{\'o}…

Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in the context of knowledge integration, allowing one to reason…

The uniform interpolation property in a given logic can be understood as the definability of propositional quantifiers. We mechanise the computation of these quantifiers and prove correctness in the Coq proof assistant for three modal…

Reinforcement learning (RL) with continuous time and state/action spaces is often data-intensive and brittle under nuisance variability and shift, motivating methods that exploit value-preserving structures to stabilize and improve…

The logarithm of the Kontsevich-Kuperberg-Thurston invariant counts embeddings of connected trivalent graphs in an oriented rational homology sphere, using integrals on configuration spaces of points in the given manifold. It is a universal…

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

We discuss the theory of Lie algebras in Lean's Mathlib library. Using nilpotency as the theme, we outline a computer formalisation of Engel's theorem and an application to root space theory. We emphasise that all arguments work with…

Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…

We give a sufficient and necessary condition for a probability measure $\mu$ on the real line to satisfy the logarithmic Sobolev inequality for convex functions. The condition is expressed in terms of the unique left-continuous and…