Related papers: Constructive Canonicity of Inductive Inequalities
We extend the notion of induced conjugacy classes in reductive groups, introduced by Lusztig and Spaltenstein for unipotent classes, to arbitrary classes. We study properties of equivariant fibrations of prehomogeneous affine spaces,…
Since Val Tannen's pioneer work on the combination of simply-typed lambda-calculus and first-order rewriting (LICS'88), many authors have contributed to this subject by extending it to richer typed lambda-calculi and rewriting paradigms,…
Induced representations of $\ast$-algebras by unbounded operators in Hilbert space are investigated. Conditional expectations of a $\ast$-algebra $\cA$ onto a unital $\ast$-subalgebra $\cB$ are introduced and used to define inner products…
Given a lattice $\Lambda$ in a locally compact abelian group $G$ and a measurable subset $\Omega$ with finite and positive measure, then the set of characters associated to the dual lattice form a frame for $L^2(\Omega)$ if and only if the…
We carry out a semantic study of the constructive modal logic CK. We provide a categorical duality linking the algebraic and birelational semantics of the logic. We then use this to prove Sahlqvist style correspondence and completeness…
State-of-the-Art (SOTA) claims pervade Artificial Intelligence (AI) and Machine Learning (ML) research. These claims rest on benchmark evaluations, where models are ranked by aggregate scores across tasks. Public benchmarks or leaderboards…
The logic underlying the Abella proof assistant includes mechanisms for interpreting atomic predicates through fixed point definitions that can additionally be treated inductively or co-inductively. However, the original formulation of the…
In this paper, we establish a coupling lemma for standard families in the setting of piecewise expanding interval maps with countably many branches. Our method merely requires that the expanding map satisfies Chernov's one-step expansion at…
In a previous paper, we recast Morgado hyperlattices and Sette implicative hyperlattices in lattice-theoretic terms. By utilizing swap structures induced by implicative lattices, we obtained a direct proof of soundness and completeness for…
We classify the irreducible modules of a rational Lorentzian lattice vertex operator algebra (LLVOA) based on an even, self-dual Lorentzian lattice $\Lambda\subset\mathbb{R}^{m,n}$ of signature $(m,n)$. We show that the set of isomorphism…
We classify canonical algebras such that for every dimension vector of a regular module the corresponding module variety is normal (respectively, a complete intersection). We also prove that for the dimension vectors of regular modules…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…
Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a…
Neural networks excel at pattern recognition but struggle with reliable logical reasoning, often violating basic logical principles during inference. We address this limitation by developing a categorical framework that systematically…
We present a general formalism to investigate the integrable properties of a large class of non-ultralocal models which in principle allows the construction of the corresponding lattice versions. Our main motivation comes from the su(1|1)…
We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…
Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and…
Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The journal of symbolic logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…
We introduce the $L_!^S$-calculus, a linear lambda-calculus extended with scalar multiplication and term addition, that acts as a proof language for intuitionistic linear logic (ILL). These algebraic operations enable the direct expression…