Review of Symbolic Logic 5 (4):666-678 (2012)

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 No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s1755020312000226
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,740
Through your library

References found in this work BETA

Conservative Translations.Hércules A. Feitosa & Itala M. Loffredo D'Ottaviano - 2001 - Annals of Pure and Applied Logic 108 (1-3):205-227.
Many-Valued Logics and Translations.Ítala M. Loffredo D'Ottaviano & Hércules de Araujo Feitosa - 1999 - Journal of Applied Non-Classical Logics 9 (1):121-140.

View all 9 references / Add more references

Citations of this work BETA

Nice Embedding in Classical Logic.Peter Verdée & Diderik Batens - 2016 - Studia Logica 104 (1):47-78.

Add more citations

Similar books and articles


Added to PP index

Total views
31 ( #326,234 of 2,386,868 )

Recent downloads (6 months)
1 ( #550,981 of 2,386,868 )

How can I increase my downloads?


My notes