This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
abstract. We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R. This gives a negative solution to one of the questions rai...
In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolati...