Categorical Abstract Algebraic Logic: Bloom's Theorem for Rule-Based π-Institutions

Logic Journal of the IGPL 16 (3):233-248 (2008)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Categorical Abstract Algebraic Logic: Models of π-Institutions.George Voutsadakis - 2005 - Notre Dame Journal of Formal Logic 46 (4):439-460.
Categorical Abstract Algebraic Logic: More on Protoalgebraicity.George Voutsadakis - 2006 - Notre Dame Journal of Formal Logic 47 (4):487-514.
Multi‐term π‐institutions and their equivalence.José Gil-Férez - 2006 - Mathematical Logic Quarterly 52 (5):505-526.

Analytics

Added to PP
2015-02-04

Downloads
6 (#1,269,502)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?