English
Related papers

Related papers: Uniform Lyndon Interpolation for Basic Non-normal …

200 papers

In this paper, we establish an analogue of Craig Interpolation Property for a many-sorted variant of first-order hybrid logic. We develop a forcing technique that dynamically adds new constants to the underlying signature in a way that…

Logic in Computer Science · Computer Science 2026-05-08 Daniel Găină , Go Hashimoto

A logic satisfies the interpolation property provided that whenever a formula {\Delta} is a consequence of another formula {\Gamma}, then this is witnessed by a formula {\Theta} which only refers to the language common to {\Gamma} and…

Logic · Mathematics 2019-02-13 Matthias Baaz , Mai Gehrke , Sam van Gool

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.

Logic · Mathematics 2010-08-30 Dov Gabbay , Karl Schlechta

In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…

Logic in Computer Science · Computer Science 2015-10-20 Steffen Lewitzka

Craig's Interpolation theorem has a wide range of applications, from mathematical logic to computer science. Proof-theoretic techniques for establishing interpolation usually follow a method first introduced by Maehara for the Sequent…

Logic in Computer Science · Computer Science 2026-03-04 Meven Lennon Bertrand , Alexis Saurin

Cyclic proof theory studies proofs where cycles are allowed. This is useful for developing proof theory for logics with fixpoint operators: cycles can be used to represent the unfolding of a fixpoint. However, this cyclic character is not…

Logic · Mathematics 2025-11-05 Borja Sierra Miranda

This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…

Artificial Intelligence · Computer Science 2013-04-05 Hung-Trung Nguyen

We show that the variety of modal lattices has the superamalgamation property. As a consequence, we obtain that the weak positive modal logic has the Craig interpolation property. Our proof employs the recent duality for modal lattices…

Logic · Mathematics 2026-03-17 Rodrigo Nicolau Almeida , Nick Bezhanishvili , Simon Lemal

In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of the guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem…

Logic in Computer Science · Computer Science 2021-10-15 Reijo Jaakkola

Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a…

Logic in Computer Science · Computer Science 2019-03-19 Ekaterina Komendantskaya , Yue Li

We present a uniform characterisation of three-valued logics by means of the bisequent calculus (BSC). It is a generalised form of a sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin

We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…

Logic in Computer Science · Computer Science 2022-06-24 Bartosz Bednarczyk , Reijo Jaakkola

In this paper we show that subsumption problems in lightweight description logics (such as $\mathcal{EL}$ and $\mathcal{EL}^+$) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use…

Logic in Computer Science · Computer Science 2013-11-14 Viorica Sofronie-Stokkermans

We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…

Logic in Computer Science · Computer Science 2021-04-28 Dominic Hughes , Lutz Straßburger , Jui-Hsuan Wu

The concept of uniform interpolant for a quantifier-free formula from a given formula with a list of symbols, while well-known in the logic literature, has been unknown to the formal methods and automated reasoning community for a long…

Logic in Computer Science · Computer Science 2023-06-22 Silvio Ghilardi , Alessandro Gianola , Deepak Kapur

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds.…

We formalise and mechanise a construtive, proof theoretic proof of Craig's Interpolation Theorem in Isabelle/HOL. We give all the definitions and lemma statements both formally and informally. We also transcribe informally the formal…

Logic in Computer Science · Computer Science 2007-05-23 Tom Ridge

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

Logic · Mathematics 2020-02-20 Eugenio Orlandelli