Equivalences and translations between consequence relations abound in logic. The notion of equivalence can be defined syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [4] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3]. Other authors have extended this result to the cases of k-deductive systems and of consequence relations on associative, commutative, multiple conclusion sequents. Our main result subsumes all existing results in the literature and reveals their common character. The proofs are of order-theoretic and categorical nature.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription.
Read more about accessing full-text
References
A. Avron, The method of hypersequents in proof theory of propositional nonclassical logics, Logic: From foundations to applications (W. Hodges et al., editor), Oxford University Press, 1996, pp. 1--32.
G. Birkhoff, Lattice theory, third ed., American Mathematical Society Colloquium Publications, vol. XXV, American Mathematical Society, 1967.
W.J. Blok and B. Jónsson, Equivalence of consequence operations, Studia Logica, vol. 83 (2006), no. 1--3, pp. 91--110.
W.J. Blok and D. Pigozzi, Algebraizable logics, Memoirs of the AMS, vol. 77 (1989), no. 396.
Mathematical Reviews (MathSciNet):
MR973361
K. Blount and C. Tsinakis, The structure of residuated lattices, International Journal of Algebra and Computation, vol. 13 (2003), no. 4, pp. 437--461.
T.S. Blyth, Lattices and ordered algebraic structures, Universitext, Springer-Verlag, London, 2005.
L. Bolc and P. Borowik, Many-valued logics 2: Automated reasoning and practical applications, Springer-Verlag, 2004.
N. Galatos, Minimal varieties of residuated lattices, Algebra Universalis, vol. 52 (2005), no. 2, pp. 215--239.
N. Galatos, P. Jipsen, T. Kowalski, and H. Ono, Residuated lattices: an algebraic glimpse at substructural logics, Studies in Logic and the Foundations of Mathematics, vol. 151, Elsevier, 2007.
N. Galatos and H. Ono, Algebraization, parametrized local deduction theorem and interpolation for substructural logics over $\mathbfFL$, Studia Logica, vol. 83 (2006), pp. 279--308.
--------, Cut elimination and strong separation for substructural logics: an algebraic approach, Annals of Pure and Applied Logic, accepted for publication.
P. Jipsen and C. Tsinakis, A survey of residuated lattices, Ordered algebraic structures (J. Martinez, editor), Kluwer, Dordrecht, 2002, pp. 19--56.
A. Pynko, Definitional equivalence and algebraizability of generalized logical systems, Annals of Pure and Applied Logic, vol. 98 (1999), pp. 1--68.
J. Raftery, Correspondences between Gentzen and Hilbert systems, Journal of Symbolic Logic, vol. 71 (2006), no. 3, pp. 903--957.
J. Rebagliato and V. Verdú, On the algebraization of some Gentzen systems, Fundamenta Informaticae, vol. 18 (1993), no. 2--4, pp. 319--338.
