Related papers: The external version of a subclassical logic

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

Shape analysis concerns the problem of determining "shape invariants" for programs that perform destructive updating on dynamically allocated storage. In recent work, we have shown how shape analysis can be performed, using an abstract…

Let $(R,m)\to (S,n)$ be a flat local extension of local rings. Lech conjectured in 1960 that there should be a general inequality $e(R)\leq e(S)$ on the Hilbert-Samuel multiplicities. This conjecture is known when the base ring $R$ has…

Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…

The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are…

In this paper, we show that theory of processes can be reduced to the theory of spatial logic. Firstly, we propose a spatial logic SL for higher order pi-calculus, and give an inference system of SL. The soundness and incompleteness of SL…

Lambda Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic…

We initiate the investigation of the projective varieties $\mathbb E(r,\mathfrak g)$ of elementary subalgebras of dimension $r$ of a ($p$-restricted) Lie algebra $\mathfrak g$ for various $r \geq 1$. These varieties $\mathbb E(r,\mathfrak…

Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore 1985 for modeling an ideally rational agent's behavior and reasoning…

Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension of DLs in which abstraction levels are first-class citizens…

Let $M$ be a free module of rank $m$ over a commutative unital ring $R$ and let $N$ be its free submodule. We consider the problem when a given element of the exterior product $\Lambda^pM$ is divisible, in a sense, over elements of the…

We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…

Let $W$ be an irreducible complex reflection group acting on its reflection representation $V$. We consider the doubly graded action of $W$ on the exterior algebra $\wedge (V \oplus V^*)$ as well as its quotient $DR_W := \wedge (V \oplus…

This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…

This paper provides foundations for strong (that is, possibly under abstraction) call-by-value evaluation for the lambda-calculus. Recently, Accattoli et al. proposed a form of call-by-value strong evaluation for the lambda-calculus, the…

We first prove that the Legendre transform is the only continuous and $\mathrm{SL}(n)$ contravariant valuation that behaves as a conjugation of two important translations on super-coercive, lower semi-continuous, and convex functions. Then…

We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…

In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halld\'en, are presented. These calculi…

The syntactic calculus of Lambek is a deductive system for the multiplicative fragment of intuitionistic non-commutative linear logic. As a fine-grained calculus of resources, it has many applications, mostly in formal computational…

We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type…