Related papers: Lambda theories of effective lambda models
Let $G$ be a reductive algebraic group over a $p$-adic field or number field $K$, and let $V$ be a $K$-linear faithful representation of $G$. A lattice $\Lambda$ in the vector space $V$ defines a model $\hat{G}_{\Lambda}$ of $G$ over…
We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
Non-Archimedean mathematics (in particular, nonstandard analysis) allows to construct some useful models to study certain phenomena arising in PDE's; for example, it allows to construct generalized solutions of differential equations and…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
We investigate the H\'enon-Lane-Emden system defined by $- \Delta u=|x|^a |v|^{p-1}v$ and $- \Delta v=|x|^b |u|^{q-1}u$ in $\mathbb{R}^N \!\setminus\! \{0\}$. We begin by establishing a general Liouville-type theorem for the subcritical…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
Using the hierarchy of scales between the mass, $M$, and the width, $\Gamma$, of a heavy, unstable particle we construct an effective theory that allows calculations for resonant processes to be systematically expanded in powers of the…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Bernardy et al. [2018] proposed a linear type system $\lambda^q_\to$ as a core type system of Linear Haskell. In the system, linearity is represented by annotated arrow types $A \to_m B$, where $m$ denotes the multiplicity of the argument.…
We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…
Let $R$ be a standard graded Noetherian algebra over an infinite field $K$ and $M$ a finitely generated $\mathbb{Z}$-graded $R$-module. Then for any graded ideal $I\subseteq R_+$ of $R$, we show that there exist integers $e_1\geq e_2$ such…
Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that…
We show that for every non-spherical set $X$ in $\mathbb{E}^d$, there exists a natural number $m$ and a red/blue-colouring of $\mathbb{E}^n$ for every $n$ such that there is no red copy of X and no blue progression of length $m$ with each…
We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated…
In this paper it is stressed that there is no {\em physical} reason for symmetries to be linear and that Lie group theory is therefore too restrictive. We illustrate this with some simple examples. Then we give a readable review on the…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…
Building off of recent results on Keisler's order, we show that consistently, $\leq_{SP}$ has infinitely many classes. In particular, we define the property of $\leq k$-type amalgamation for simple theories, for each $2 \leq k < \omega$. If…
In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…