{"title":"Modal translation of substructural logics","authors":"C. Hartonas","doi":"10.1080/11663081.2019.1703469","DOIUrl":"https://doi.org/10.1080/11663081.2019.1703469","url":null,"abstract":"ABSTRACT In an article dating back in 1992, Kosta Došen initiated a project of modal translations in substructural logics, aiming at generalising the well-known Gödel–McKinsey–Tarski translation of intuitionistic logic into S4. Došen's translation worked well for (variants of) BCI and stronger systems (BCW, BCK), but not for systems below BCI. Dropping structural rules results in logic systems without distribution. In this article, we show, via translation, that every substructural (indeed, every non-distributive) logic is a fragment of a corresponding sorted, residuated (multi) modal logic. At the conceptual and philosophical level, the translation provides a classical interpretation of the meaning of the logical operators of various non-distributive propositional calculi. Technically, it allows for an effortless transfer of results, such as compactness and the Löwenheim-Skolem property and it opens up new directions for deducing properties of substructural logic systems by establishing appropriate transfer theorems.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"6 1","pages":"16 - 49"},"PeriodicalIF":0.0,"publicationDate":"2018-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72871898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MVW-rigs and product MV-algebras","authors":"Alejandro Estrada, Y. Poveda","doi":"10.1080/11663081.2018.1534795","DOIUrl":"https://doi.org/10.1080/11663081.2018.1534795","url":null,"abstract":"ABSTRACT We introduce the variety of Many-Valued-Weak rigs (MVW-rigs). We provide an axiomatisation and establish, in this context, basic properties about ideals, homomorphisms, quotients and radicals. This new class contains the class of product MV-algebras presented by Di Nola and Dvurečenskij in 2001 and by Montagna in 2005. The main result is the compactness of the prime spectrum of this new class, endowed with the co-Zariski topology as defined by Dubuc and Poveda in 2010.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"1 1","pages":"78 - 96"},"PeriodicalIF":0.0,"publicationDate":"2018-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77501842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Vidal's trivalent explanations for defective conditional in mathematics","authors":"Y. Petrukhin, V. Shangin","doi":"10.1080/11663081.2018.1534488","DOIUrl":"https://doi.org/10.1080/11663081.2018.1534488","url":null,"abstract":"ABSTRACT The paper deals with a problem posed by Mathieu Vidal to provide a formal representation for defective conditional in mathematics Vidal, M. [(2014). The defective conditional in mathematics. Journal of Applied Non-Classical Logics, 24(1–2), 169–179]. The key feature of defective conditional is that its truth-value is indeterminate if its antecedent is false. In particular, we are interested in two explanations given by Vidal with the use of trivalent logics. By analysing a simple argument from plane geometry, where defective conditional is in use, he gives two trivalent formal explanations for it. For both explanations, Vidal rigorously shows that (most well-known) trivalent logics cannot adequately represent defective conditional. Preserving Vidal's criteria of defective conditional ad max, we indicate some arguable points in his explanations and present an alternative explanation containing the original conjunction and disjunction in order to show that there are trivalent logics that might be an adequate formal explanation for defective conditional.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"127 1","pages":"64 - 77"},"PeriodicalIF":0.0,"publicationDate":"2018-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75842855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lattice logic as a fragment of (2-sorted) residuated modal logic","authors":"C. Hartonas","doi":"10.1080/11663081.2018.1547515","DOIUrl":"https://doi.org/10.1080/11663081.2018.1547515","url":null,"abstract":"ABSTRACT Correspondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components, , and , then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that a reduction of the first to the latter may be possible, encoding Positive Lattice Logic (PLL) as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"72 1","pages":"152 - 170"},"PeriodicalIF":0.0,"publicationDate":"2018-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75236611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Doxastic logic: a new approach","authors":"Daniel Rönnedal","doi":"10.1080/11663081.2018.1525206","DOIUrl":"https://doi.org/10.1080/11663081.2018.1525206","url":null,"abstract":"ABSTRACT In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans (and human-like agents). Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"242 1","pages":"313 - 347"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85173904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss","authors":"D. Kozhemiachenko","doi":"10.1080/11663081.2018.1525208","DOIUrl":"https://doi.org/10.1080/11663081.2018.1525208","url":null,"abstract":"ABSTRACT In this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in proofs and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"31 1","pages":"389 - 413"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85871304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fuzzy intensional semantics","authors":"L. Behounek, Ondrej Majer","doi":"10.1080/11663081.2018.1525207","DOIUrl":"https://doi.org/10.1080/11663081.2018.1525207","url":null,"abstract":"The study of weighted structures is one of the important trends in recent computer science. The aim of the article is to provide a weighted, many-valued version of classical intensional semantics formalised in the framework of higher-order fuzzy logics. We illustrate the apparatus on several variants of fuzzy S5-style modalities. The formalism is applicable to a broad array of weighted intensional notions, including alethic, epistemic, or probabilistic modalities, generalised quantifiers, counterfactual conditionals, dynamic and non-monotonic logics, and some more.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"6 1","pages":"348 - 388"},"PeriodicalIF":0.0,"publicationDate":"2018-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90396684","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Arguing about constitutive and regulative norms","authors":"G. Pigozzi, Leendert van der Torre","doi":"10.1080/11663081.2018.1487242","DOIUrl":"https://doi.org/10.1080/11663081.2018.1487242","url":null,"abstract":"Abstract Formal arguments are often represented by (support, conclusion) pairs, but in this paper we consider normative arguments represented by sequences of (brute, institutional, deontic) triples, where constitutive norms derive institutional facts from brute facts, and regulative norms derive deontic facts like obligations and permissions from institutional facts. The institutional facts may be seen as the reasons explaining or warranting the deontic obligations and permissions, and therefore they can be attacked by other normative arguments too. We represent different aspects of normative reasoning by different kinds of consistency checks among these triples, and we use formal argumentation theory to resolve conflicts among such normative arguments. In particular, we introduce various requirements for arguing about norms concerning violations, contrary-to-duty obligations, dilemmas, conflict resolution and different kinds of norms, and we introduce a formal argumentation theory satisfying the requirements. In order to illustrate our framework, we introduce a running example based on university regulations for prospective and actual students.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"1 1","pages":"189 - 217"},"PeriodicalIF":0.0,"publicationDate":"2018-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74311939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Logic and argumentation","authors":"T. Ågotnes, B. Liao, Yì Nicholas Wáng","doi":"10.1080/11663081.2018.1487243","DOIUrl":"https://doi.org/10.1080/11663081.2018.1487243","url":null,"abstract":"","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"43 1","pages":"163 - 164"},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75363678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Abduction in argumentation frameworks","authors":"Chiaki Sakama","doi":"10.1080/11663081.2018.1487241","DOIUrl":"https://doi.org/10.1080/11663081.2018.1487241","url":null,"abstract":"Abstract This paper studies abduction in abstract argumentation frameworks. Given an argument, an agent verifies whether the argument is justified or not in its argumentation framework. If the argument is not justified in the argumentation framework, the agent seeks conditions to explain the justification state by hypothesising arguments in the universal argumentation framework. We formulate such abductive reasoning in argumentation semantics and provide its computation in logic programming. We also apply abduction to enforcement and simple dialogue games in argumentation frameworks.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"39 1","pages":"218 - 239"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79407007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
