Related papers: Recursive Completion in Higher K-Models: Front-See…
This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…
We let R be an o-minimal expansion of a field, V a convex subring, and $(R_0, V_{0})$ an elementary substructure of (R,V). We let L be the language consisting of a language for R, in which R has elimination of quantifiers, and a predicate…
There has been considerable attention devoted to models that learn to jointly infer an expression's syntactic structure and its semantics. Yet, \citet{NangiaB18} has recently shown that the current best systems fail to learn the correct…
In this paper we introduce a homotopy theoretic technique for proving that the $K$-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically…
RL-trained Lean theorem provers mode-collapse at inference time: on miniF2F-test with DeepSeek-Prover-V1.5-RL, doubling the i.i.d.\ sampling budget from $k{=}32$ to $k{=}64$ produces zero additional solved theorems (42/244 in both cases). A…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
We give a characterization, with respect to a large class of models of untyped $\lambda$-calculus, of those models that are fully abstract for head-normalization, i.e., whose equational theory is $\mathcal{H}^*$. An extensional K-model $D$…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
Given an automorphic line bundle ${\mathcal O}_X(k)$ of weight $k$ on the Drinfel'd upper half plane $X$ over a local field $K$, we construct a ${\rm GL}_2(K)$-equivariant integral lattice ${\mathcal O}_{\widehat{\mathfrak X}}(k)$ in…
We provide a partial solution to the problem of defining a constructive version of Voevodsky's simplicial model of univalent foundations. For this, we prove constructive counterparts of the necessary results of simplicial homotopy theory,…
We address two problems regarding the structure and representation theory of finite W-algebras associated with the general linear Lie algebras. Finite W-algebras can be defined either via the Whittaker model of Kostant or, equivalently, by…
We use topological K-theory to study non-singular varieties with quadratic entry locus. We thus obtain a new proof of Russo's Divisibility Property for locally quadratic entry locus manifolds. In particular we obtain a K-theoretic proof of…
Retrieval-augmented language models can better adapt to changes in world state and incorporate long-tail knowledge. However, most existing methods retrieve only short contiguous chunks from a retrieval corpus, limiting holistic…
For an arbitrary simplicial complex K, Davis and Januszkiewicz have defined a family of homotopy equivalent CW-complexes whose integral cohomology rings are isomorphic to the Stanley-Reisner algebra of K. Subsequently, Buchstaber and Panov…
We develop a theory of completeness for weight structures on stable categories, dual to the theory of complete t-structures. As in the bounded case, we show that complete weight structures are determined by their weight heart, giving rise…
In this note, we continue to be interested in the relationship that connects the restricted distribution of finitude at the local level of intermediate fields of a purely inseparable extension $K/k$ to the absolute or global finitude of…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
In this paper we prove that the set of tuples of edge lengths in $K_1\times K_2$ corresponding to a finite tree has non-empty interior, where $K_1,K_2\subset \mathbb{R}$ are Cantor sets of thickness $\tau(K_1)\cdot \tau(K_2) >1$. Our method…
We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…
It is known that, among all the monotone decompositions of a planar compact set K with Peano hyperspaces, there exists a unique one that is finer than all the others. We call it the "core decomposition" of K with Peano hyperspace. The…