The ubiquity of conservative translations

Details The ubiquity of conservative translations The ubiquity of conservative translations

2011-08-31

arxiv.org/abs/1108.6263v1

Mathematics

Logic

14 pages

Scientific paper

We study the notion of conservative translation between logics introduced by Feitosa and D'Ottaviano. 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.

Affiliated with

Also associated with

No associations

Rating

The ubiquity of conservative translations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The ubiquity of conservative translations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The ubiquity of conservative translations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-626137