Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-20T05:06:12.519Z Has data issue: false hasContentIssue false
  • English
  • Français

THE UBIQUITY OF CONSERVATIVE TRANSLATIONS

Published online by Cambridge University Press:  05 September 2012

EMIL JEŘÁBEK
EMIL JEŘÁBEK*
Affiliation:
Academy of Sciences of the Czech Republic
*
*INSTITUTE OF MATHEMATICS AS CR, ŽITNÁ 25, 115 67 PRAHA 1, CZECH REPUBLIC, E-mail: [email protected], URL: http://math.cas.cz/~jerabek
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the notion of conservative translation between logics introduced by (Feitosa & D’Ottaviano2001). We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set of formulas can be conservatively translated into CPC. The translation is computable if the consequence relation is decidable. More generally, we show that one can take instead of CPC a broad class of logics (extensions of a certain fragment of full Lambek calculus FL) including most nonclassical logics studied in the literature, hence in a sense, (almost) any two reasonable deductive systems can be conservatively translated into each other. We also provide some counterexamples, in particular the paraconsistent logic LP is not universal.

Type
Research Articles
Information
The Review of Symbolic Logic , Volume 5 , Issue 4 , December 2012 , pp. 666 - 678
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

Carnielli, W. A., Coniglio, M. E., & D’Ottaviano, I. M. L. (2009). New dimensions on translations between logics. Logica Universalis, 3(1), 1–18.Google Scholar
Czelakowski, J. (2001). Protoalgebraic Logic, Vol. 10 of Trends in Logic. Dordecht: Kluwer.Google Scholar
da Silva, J. J., D’Ottaviano, I. M. L., & Sette, A. M. (1999). Translations between logics. In Caicedo, X., and Montenegro, C., editors. Models, Algebras, and Proofs, Vol. 203 of Lecture Notes in Pure and Applied Mathematics. New York: Marcel Dekker, pp. 435–448.Google Scholar
D’Ottaviano, I. M. L., & Feitosa, H. A. (1999). Many-valued logics and translations. Journal of Applied Non-classical Logics, 9(1), 121–140.Google Scholar
D’Ottaviano, I. M. L., & Feitosa, H. A. (2000). Paraconsistent logics and translations. Synthese, 125(1–2), 77–95.Google Scholar
D’Ottaviano, I. M. L., & Feitosa, H. A. (2006). Translating from Lukasiewicz’s logics into classical logic: Is it possible? Poznan Studies in the Philosophy of the Sciences and the Humanities, 91(1), 157–168.Google Scholar
D’Ottaviano, I. M. L., & Feitosa, H. A. (2007). Deductive systems and translations. In Béziau, J.-Y., and Costa-Leite, A., editors. Perspectives on Universal Logic. Monza: Polimetrica, pp. 125–157.Google Scholar
Feitosa, H. A., & D’Ottaviano, I. M. L. (2001). Conservative translations. Annals of Pure and Applied Logic, 108, 205–227.Google Scholar
Galatos, N., Jipsen, P., Kowalski, T., & Ono, H. (2007). Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Vol. 151 of Studies in Logic and the Foundations of Mathematics. Amsterdam: Elsevier.Google Scholar
Lau, D. (2006). Function Algebras on Finite Sets: A Basic Course on Many-Valued Logic and Clone Theory. New York: Springer.Google Scholar
Mossakowski, T., Diaconescu, R., & Tarlecki, A. (2009). What is a logic translation? Logica Universalis, 3(1), 95–124.Google Scholar
Post, E. L. (1941). The Two-Valued Iterative Systems of Mathematical Logic. Number 5 in Annals of Mathematics Studies. Princeton, NJ: Princeton University Press.Google Scholar
Shoesmith, D. J., & Smiley, T. J. (1978). Multiple-Conclusion Logic. Cambridge University Press.Google Scholar