相关论文: Constructive canonicity for lattice-based fixed po…
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…
Positive configurations of points in the affine building were introduced in \cite{Le} as the basic object needed to define higher laminations. We start by giving a self-contained, elementary definition of positive configurations of points…
Unitary dynamics with a strict causal cone (or "light cone") have been studied extensively, under the name of quantum cellular automata (QCAs). In particular, QCAs in one dimension have been completely classified by an index theory.…
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra with operators has evolved into an extensive theory of canonical extensions of lattice-based algebras. After reviewing this evolution we make two contributions.…
We establish the generalized canonical bundle formula for generalized lc-trivial fibrations with irrational coefficients over non-compact bases in the complex analytic setting, and we show that the discriminant b-divisor and moduli…
We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…
This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…
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 prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…
The approach to reasoning about structural operational semantics style specifications supported by the Abella system is discussed. This approach uses lambda tree syntax to treat object language binding and encodes binding related properties…
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…
We extend to $p$-uniformly convex spaces tools from the analysis of fixed point iterations in linear spaces. This study is restricted to an appropriate generalization of single-valued, pointwise $\alpha$-averaged mappings. Our main…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
In this paper, we completely classify the isomorphism classes of certain lattices $L_A(C)$ and $L_B(C)$ from a self-orthogonal code $C$ over the finite field $\mathbb{F}_p$, where $p$ is an odd prime. These lattices are obtained by…
Proofs by logical relations play a key role to establish rich properties such as normalization or contextual equivalence. They are also challenging to mechanize. In this paper, we describe the completeness proof of algorithmic equality for…
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin's suggestions, that it can be used to define a…