Related papers: A Statement of the Fundamental Lemma
This paper explores the semantics of a combinatory fragment of reFLect, the lambda-calculus underlying a functional language used by Intel Corporation for hardware design and verification. ReFLect is similar to ML, but has a primitive data…
In the geometric version of the Langlands correspondence, irregular singular point connections play the role of Galois representations with wild ramification. In this paper, we develop a geometric theory of fundamental strata to study…
We describe some new general constructions of $p$-adic $L$-functions attached to certain arithmetically defined complex $L$-functions coming from motives over $\bold Q$ with coefficiens in a number field $T$, with $[T:\bold Q]<\infty$.…
A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
Langlands duality is one of the most influential topics in mathematical research. It has many different appearances and influential subtopics. Yet there is a topic that until now seems unrelated to the Langlands program. That is the topic…
Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics…
We provide an introduction to the theory of Eisenstein series and automorphic forms on real simple Lie groups G, emphasising the role of representation theory. It is useful to take a slightly wider view and define all objects over the…
In this paper, we introduce a fundamental framework to create a bridge between Probability Theory and Fuzzy Logic. Indeed, our theory formulates a random experiment of selecting crisp elements with the criterion of having a certain fuzzy…
In this article, we are concerned with the Langlands functoriality conjecture. Cogdell, Kim, Piatetski-Shapiro and Shahidi proved functioriality conjecture in the case of a globally generic cuspidal automorphic representation for the split…
We consider construction of Lagrangians which are candidates for p-adic sector of an adelic open scalar string. Such Lagrangians have their origin in Lagrangian for a single p-adic string and contain the Riemann zeta function with the…
Drinfeld's lemma is a powerful tool for splitting $\ell$-adic local systems defined over a product of connected schemes over a finite field. In this paper, we show that Drinfeld's lemma also holds true for algebraic stacks.
We present probabilistic neural programs, a framework for program induction that permits flexible specification of both a computational model and inference algorithm while simultaneously enabling the use of deep neural networks.…
With the technology of the time, Kowalski's seminal 1974 paper {\em Predicate Logic as a Programming Language} was a breakthrough for the use of logic in computer science. It introduced two fundamental ideas: on the declarative side, the…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
We prove a conjecture of Denef on parameterized $p$-adic analytic integrals using an analytic cell decomposition theorem, which we also prove in this paper. This cell decomposition theorem describes piecewise the valuation of analytic…
Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering "set-inclusion". In the case of normal logic programs there do not exist least models in general. However, according to…
The goal of this paper is to reformulate the conjectural "Ihara lemma" for $U(n)$ in terms of the local Langlands correspondence in families $\tilde{\pi}_{\Sigma}(\cdot)$, as currently being developed by Emerton and Helm. The reformulation…
A close connection between the no-name lemma (concerning algebraic groups acting on vector bundles) and the existence of sufficiently many independent rational covariants is pointed out. In particular, this leads to a new natural proof of…
Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous data types" such as the real line. So far however, they…