Uniform Interpolation
By: Sam van Gool
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic propositional logic. We outline how this theorem may be proved semantically via the definability of bisimulation quantifiers, and how it generalizes to an open mapping theorem between Esakia spaces. We also discuss connections between uniform interpolation and research in categorical logic, algebra, and model theory.
Similar Papers
A proof-theoretic approach to uniform interpolation property of multi-agent modal logic
Logic in Computer Science
Proves logic rules for thinking machines.
Interpolation in Classical Propositional Logic
Logic in Computer Science
Helps computers understand logic puzzles better.
Interpolation in Non-Classical Logics
Logic
Makes computers understand tricky logic rules.