Related papers: Split Interpolation: Refining Craig's Theorem via …
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…
According to Lidstone interpolation theory, an entire function of exponential type $<\pi$ is determined by it derivatives of even order at $0$ and $1$. This theory can be generalized to several variables. Here we survey the theory for a…
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…
The entailment between separation logic formulae with inductive predicates, also known as symbolic heaps, has been shown to be decidable for a large class of inductive definitions. Recently, a 2-EXPTIME algorithm was proposed and an…
We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
Craig interpolation is a widespread method in verification, with important applications such as Predicate Abstraction, CounterExample Guided Abstraction Refinement and Lazy Abstraction With Interpolants. Most state-of-the-art model checking…
The classical theorems of Mittag-Leffler and Weierstrass show that when $\{\lambda_n\}$ is a sequence of distinct points in the open unit disk $\D$, with no accumulation points in $\D$, and $\{w_n\}$ is any sequence of complex numbers,…
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…
The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating implicit…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…
We show that interpolation results in the $S$-nodes theory may be considered as Khrushchev-type formulas. If separation of the well-known Verblunsky (Schur) coefficients occurs in Khrushchev formulas, the separation of the so the called new…
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…
In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…
It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…
We present two deductively equivalent calculi for non-deterministic many-valued logics. One is defined by axioms and the other - by rules of inference. The two calculi are obtained from the truth tables of the logic under consideration in a…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
Uniform interpolation is a strong form of interpolation providing an interpretation of propositional quantifiers within a propositional logic. Pitts' seminal work establishes this property for intuitionistic propositional logic relying on a…