{"title":"一组元间逻辑","authors":"F. Pailos","doi":"10.1080/11663081.2018.1534486","DOIUrl":null,"url":null,"abstract":"ABSTRACT We will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or . We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to work with inferences as pairs of sets of formulas to obtain a contractive logic.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"24 1","pages":"120 - 97"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A family of metainferential logics\",\"authors\":\"F. Pailos\",\"doi\":\"10.1080/11663081.2018.1534486\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT We will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or . We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to work with inferences as pairs of sets of formulas to obtain a contractive logic.\",\"PeriodicalId\":38573,\"journal\":{\"name\":\"Journal of Applied Non-Classical Logics\",\"volume\":\"24 1\",\"pages\":\"120 - 97\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Non-Classical Logics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/11663081.2018.1534486\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Non-Classical Logics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/11663081.2018.1534486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
ABSTRACT We will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or . We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to work with inferences as pairs of sets of formulas to obtain a contractive logic.