English
Related papers

Related papers: Interpolation and the Exchange Rule

200 papers

We characterize type isomorphisms in the multiplicative-additive fragment of linear logic (MALL), and thus in *-autonomous categories with finite products, extending a result for the multiplicative fragment by Balat and Di Cosmo. This…

Logic in Computer Science · Computer Science 2025-11-26 Rémi Di Guardia , Olivier Laurent

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

In a recent work Foulis and Pulmannov\' a \cite{Foulis2012} studied the logical connectives in lattice effect algebras. In this paper we extend their study and investigate further the logical calculus for which the lattice effect algebras…

Logic · Mathematics 2019-05-22 Soroush Rafiee Rad , Amir Hossein Sharafi , Sonja Smets

Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…

Commutative Algebra · Mathematics 2018-11-07 Uwe Nagel , Bill Trok

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen

In this paper we present two terminating tableau calculi for propositional Dummett logic obeying the subformula property. The ideas of our calculi rely on the linearly ordered Kripke semantics of Dummett logic. The first calculus works on…

Logic in Computer Science · Computer Science 2012-06-21 Guido Fiorino

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

The function $p_{xy}$ that interchanges two logical variables $x,y$ in formulas is hard to describe in the following sense. Let $F$ denote the Lindenbaum-Tarski formula-algebra of a finite-variable first order logic, endowed with $p_{xy}$…

Logic · Mathematics 2026-03-19 H. Andréka , I. Németi , Zs. Tuza

We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non-trivial apartness term satisfies the weak law of…

Logic · Mathematics 2024-10-21 Zoltan A. Kocsis

In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into…

Logic in Computer Science · Computer Science 2015-04-13 Edward Hermann Haeusler

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…

Logic · Mathematics 2014-07-23 Alex Citkin

We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated…

Statistics Theory · Mathematics 2011-08-22 Takuya Kashimura , Tomonari Sei , Akimichi Takemura , Kentaro Tanaka

We give an algebraic proof of the criterion for hereditary structural completeness of an intermediate logic, or, equivalently, of the primitiveness of a variety of Heyting algebras.

Logic · Mathematics 2025-12-08 Alex Citkin

We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and…

Logic in Computer Science · Computer Science 2014-10-21 Katsuhiko Sano , Jonni Virtema

In 2012, the second author introduced and examined a new type of algebras as a generalization of De Morgan algebras. These algebras are of type (2,0) with one binary and one nullary operation satisfying two certain specific identities. Such…

Group Theory · Mathematics 2020-08-11 S. V. Gusev , H. P. Sankappanavar , B. M. Vernikov

One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…

Logic · Mathematics 2011-10-17 Richard Garner

In this article we investigate the relations between three classes of lattices each extending the class of distributive lattices in a different way. In particular, we consider join-semidistributive, join-extremal and left-modular lattices,…

Combinatorics · Mathematics 2023-04-20 Henri Mühle

Usually when we have polyadic-like algebras, meaning that we have infinitary substitutions (that is substitutions moving infinitely many points) in the similarity type, then we get the superamalgamation property especially if this class of…

Logic · Mathematics 2013-04-05 Tarek Sayed Ahmed

We continue a very fruitful line of inquiry into the multiplicative ideal theory of an arbitrary Leavitt path algebra L. Specifically, we show that factorizations of an ideal in L into irredundant products or intersections of finitely many…

Rings and Algebras · Mathematics 2023-04-25 Zachary Mesyan , Kulumani M. Rangaswamy

Laplace interpolation is a popular approach in image inpainting using partial differential equations. The classic approach considers the Laplace equation with mixed boundary conditions. Recently a more general formulation has been proposed…

Analysis of PDEs · Mathematics 2018-01-30 Laurent Hoeltgen , Andreas Kleefeld , Isaac Harris , Michael Breuß
‹ Prev 1 8 9 10 Next ›