Related papers: Affine logic with the integration operator
In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…
We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs with effects. In the system, dynamically generated values…
We present an affine-intuitionistic system of types and effects which can be regarded as an extension of Barber-Plotkin Dual Intuitionistic Linear Logic to multi-threaded programs with effects. In the system, dynamically generated values…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
For a simple Lie algebra g we consider an analogue of the affine algebra ^gk with n singularities, defined starting from the ring of functions on the n-pointed disk. We study the center of its completed enveloping algebra and prove an…
Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. The intuition is that two graphs G and H which are equivalent…
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…
Abstraction logic is a new logic, serving as a foundation of mathematics. It combines features of both predicate logic and higher-order logic: abstraction logic can be viewed both as higher-order logic minus static types as well as…
We study the relative homology group of an affine hyperplane arrangement and its Poincar\'e dual, the cohomology at finite distance of the complement. We give an Orlik--Solomon-type description of the latter, and identify it with the vector…
In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…
An extension of the ambient metric construction of Fefferman-Graham to infinite order in even dimensions is described. The main ingredients are the introduction of "inhomogeneous ambient metrics" with asymptotic expansions involving the…
By using the HOMFLY skein theory. We prove a strong integrality theorem for the reduced colored HOMFLYPT invariants defined by a basis in the full HOMFLY skein of the annulus.
The theory of integrals is used to analyse the structure of Hopf algebroids, introduced in math.QA/0302325. We prove that the total algebra of the Hopf algebroid is a separable extension of the base algebra if and only if it is a…
We give a proof of openness of versality using coherent functors. As an application, we streamline Artin's criterion for algebraicity of a stack. We also introduce multi-step obstruction theories, employing them to produce obstruction…
We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…
This paper describes a paving by affines for regular nilpotent Hessenberg varieties in all Lie types, namely a kind of cell decomposition that can be used to compute homology despite its weak closure conditions. Precup recently proved a…