Related papers: Extending the Extensional Lambda Calculus with Sur…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…
This paper establishes the normalisation of natural deduction or lambda calculus formulation of Intuitionistic Non Commutative Logic --- which involves both commutative and non commutative connectives. This calculus first introduced by de…
This short note presents a new formal language, lambda dependency-based compositional semantics (lambda DCS) for representing logical forms in semantic parsing. By eliminating variables and making existential quantification implicit, lambda…
It is often claimed that analysis with infinitesimals requires more substantial use of the Axiom of Choice than traditional elementary analysis. The claim is based on the observation that the hyperreals entail the existence of nonprincipal…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
We study the 2-parity conjecture for Jacobians of hyperelliptic curves over number fields. Under some mild assumptions on their reduction, we prove the conjecture over quadratic extensions of the base field. The proof proceeds via a…
This report formulates a conjectural combinatorial rule that positively expands Grothendieck polynomials into Lascoux polynomials. It generalizes one such formula expanding Schubert polynomials into key polynomials, and refines another one…
When finding an original proof to a known result describing expansive mappings on compact metric spaces as surjective isometries, we reveal that relaxing the condition of compactness to total boundedness preserves the isometry property and…
We extend to arbitrary measures results of Bao, Erd\"os, Schnelli, Moreillon, and Ji on the connectedness of the supports of additive convolutions of measures on \mathbb{R} and of free multiplicative convolutions of measures on…
Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…
A paraconsistent type theory (an extension of a fragment of intuitionistic type theory by adding opposite types) is here extended by adding co-function types. It is shown that, in the extended paraconsistent type system, the opposite type…
This is a short survey illustrating some of the essential aspects of the theory of canonical extensions. In addition some topological results about canonical extensions of lattices with additional operations in finitely generated varieties…
Generic notions of bisimulation for various types of systems (nondeterministic, probabilistic, weighted etc.) rely on identity-preserving (normal) lax extensions of the functor encapsulating the system type, in the paradigm of universal…
The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…
The bilateralist approach to logical consequence maintains that judgments of different qualities should be taken into account in determining what-follows-from-what. We argue that such an approach may be actualized by a two-dimensional…
Lin and Sjamaar have used symplectic Hodge theory to obtain canonical equivariant extensions for Hamiltonian actions on closed symplectic manifolds that have the strong Lefschetz property. Here we obtain canonical equivariant extensions…
We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…
We give a counterexample to Theorem 9 in [T.K. Subrahmonian Moothathu, Syndetically proximal pairs, J. Math. Anal. Appl. 379 (2011) 656--663]. We also provide sufficient conditions for the conclusion of Theorem 9 to hold.
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and…