Logic Journal of IGPL Advance Access originally published online on February 26, 2008
Logic Journal of IGPL 2008 16(3):233-248; doi:10.1093/jigpal/jzn002
| ||||||||||||||||||||||||||||||||||||||||||||||||
Categorical Abstract Algebraic Logic: Bloom's Theorem for Rule-Based
-Institutions
School of Mathematics and Computer Science, Lake Superior State University, Sault Sainte Marie, MI 49783, USA.
E-mail: gvoutsad{at}lssu.edu
| 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.
Key Words: Closure Operators Deductive Systems Logical Matrices Universal Horn Logic Without Equality Bloom's Theorem
-Institutions Rules of Inference Filtered Products Ultraproducts 2000 AMS Subject Classification: Primary: 03G99 18C15 Secondary: 68N30
Received for publication .
![]()
CiteULike
Connotea
Del.icio.us What's this?