THE UBIQUITY OF CONSERVATIVE TRANSLATIONS
Author:
- 5 September 2012
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 5 (4) , 666-678
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.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- What is a Logic Translation?Logica Universalis, 2009
- New Dimensions on Translations Between LogicsLogica Universalis, 2009
- Conservative translationsAnnals of Pure and Applied Logic, 2001
- Protoalgebraic Logics2001
- Paraconsistent Logics and TranslationsSynthese, 2000
- Many-Valued Logics and TranslationsJournal of Applied Non-Classical Logics, 1999
- Multiple-Conclusion Logic1978