Number of the records: 1  

The ubiquity of conservative translations

  1. 1.
    SYSNO ASEP0384231
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleThe ubiquity of conservative translations
    Author(s) Jeřábek, Emil (MU-W) RID, SAI, ORCID
    Source TitleReview of Symbolic Logic. - : Cambridge University Press - ISSN 1755-0203
    Roč. 5, č. 4 (2012), s. 666-678
    Number of pages12 s.
    Languageeng - English
    CountryGB - United Kingdom
    Keywordsconservative translation ; deductive system ; nonclassical logic
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    Institutional supportMU-W - RVO:67985840
    UT WOS000311684800006
    DOI10.1017/S1755020312000226
    AnnotationWe 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.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2013
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.