Categorical Abstract Algebraic Logic: Bloom's Theorem for Rule-Based -Institutions
George Voutsadakis · Logic Journal of IGPL · 2008
A syntactic machinery is developed for π-institutions based on the notion of a category of natural transformations on their sentence functors. Rules of inference, similar to the ones traditionally used in the sentential logic framework to define the best known sentential logics, are, then, introduced for π-institutions. A π-institution is said to be rule-based if its closure system is induced by a collection of rules of inference. A logical matrix-like semantics is introduced for rule-based π-institutions and a version of Bloom's Lemma and Bloom's Theorem are proved for rule-based π-institutions.