{"title":"Of gaps, gluts, and God's ability to change the past","authors":"J. J. Joaquin","doi":"10.1080/11663081.2023.2182468","DOIUrl":"https://doi.org/10.1080/11663081.2023.2182468","url":null,"abstract":"Can God change the past? The standard Aquinas line answers this question negatively: God cannot change the past since such an act implies a contradiction; thus is not within the purview of God's omnipotence. While the Aquinas line is well-known, there are other, non-standard solutions to this question. In this paper, I look into such answers. In particular, I explore those answers that employ the resources of gappy and glutty logics. I show how these solutions are motivated and how each offers an alternative conception of what it is for God to be omnipotent. Finally, I consider and reply to potential issues that may be raised against these non-standard answers.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"29 1","pages":"305 - 316"},"PeriodicalIF":0.0,"publicationDate":"2022-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87084256","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":"Provability multilattice logic","authors":"Y. Petrukhin","doi":"10.1080/11663081.2023.2178780","DOIUrl":"https://doi.org/10.1080/11663081.2023.2178780","url":null,"abstract":"ABSTRACT In this paper, we introduce provability multilattice logic and multilattice arithmetic which extends first-order multilattice logic with equality by multilattice versions of Peano axioms. We show that has the provability interpretation with respect to and prove the arithmetic completeness theorem for it. We formulate in the form of a nested sequent calculus and show that cut is admissible in it. We introduce the notion of a provability multilattice and develop algebraic semantics for on its basis, by the method of Lindenbaum-Tarski algebras we prove the algebraic completeness theorem. We present Kripke semantics for and establish the Kripke completeness theorem via syntactical and semantic embeddings from into and vice versa. Last but not least, the decidability of is shown.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"46 1","pages":"239 - 272"},"PeriodicalIF":0.0,"publicationDate":"2022-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85981264","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":"Reasoning about manipulation in multi-agent systems","authors":"Christopher Leturc, Grégory Bonnet","doi":"10.1080/11663081.2022.2124067","DOIUrl":"https://doi.org/10.1080/11663081.2022.2124067","url":null,"abstract":"ABSTRACT Selfish, dishonest or malicious agents may find an interest in manipulating others. While many works deal with designing robust systems or manipulative strategies, few works are interested in defining in a broad sense what is a manipulation and how we can reason with such a notion. In this article, based on a social science literature, we give a general definition of manipulation for multi-agent systems. A manipulation is a deliberate effect of an agent – called manipulator – to instrumentalize another agent – called victim – while making sure to conceal that effect. We present then a logical framework, called KBE, to express and reason about manipulations. Since manipulation relies on deliberate effects, KBE introduces a deliberate BIAT operator which abstracts deliberate consequences of actions. We prove that this logic is sound and complete. Furthermore,we express related notions such as coercion, persuasion, or deception.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"27 1","pages":"89 - 155"},"PeriodicalIF":0.0,"publicationDate":"2022-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82793408","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":"A variety of algebras closely related to subordination algebras","authors":"S. Celani, R. Jansana","doi":"10.1080/11663081.2022.2109122","DOIUrl":"https://doi.org/10.1080/11663081.2022.2109122","url":null,"abstract":"We introduce a variety of algebras in the language of Boolean algebras with an extra implication, namely the variety of pseudo-subordination algebras, which is closely related to subordination algebras. We believe it provides a minimal general algebraic framework where to place and systematise the research on classes of algebras related to several kinds of subordination algebras. We also consider the subvariety of pseudo-contact algebras, related to contact algebras, and the subvariety of the strict implication algebras introduced in Bezhanishvili et al. [(2019). A strict implication calculus for compact Hausdorff spaces. Annals of Pure and Applied Logic, 170, 102714]. The variety of pseudo-subordination algebras is term equivalent to the variety of Boolean algebras with a binary modal operator. We exploit this fact in our study. In particular, to obtain a topological duality from which we derive the known topological dualities for subordination algebras and contact algebras.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"372 1","pages":"200 - 238"},"PeriodicalIF":0.0,"publicationDate":"2022-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80491202","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":"Two notions of MV-algebraic semisimplicity relative to fixed MV-chains","authors":"C. Lélé, J. B. Nganou, Jean M. Wagoum","doi":"10.1080/11663081.2022.2123674","DOIUrl":"https://doi.org/10.1080/11663081.2022.2123674","url":null,"abstract":"We initiate a study of two general concepts of semisimplicity for MV-algebras by replacing the standard MV-algebra with an arbitrary MV-chain . These generalised notions are called -semisimple MV-algebras and -semisimple MV-algebras. We obtain several of their characterisations and explore in more-depth the case of perfect MV-chains.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"47 1","pages":"187 - 199"},"PeriodicalIF":0.0,"publicationDate":"2022-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85738030","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":"Vagueness as an epiphenomenon, and non-transitivity","authors":"Vangelis Triantafyllou","doi":"10.1080/11663081.2022.2136560","DOIUrl":"https://doi.org/10.1080/11663081.2022.2136560","url":null,"abstract":"ABSTRACT This paper deals with the linguistic phenomenon of vagueness. Based on certain observations regarding the intuitions and linguistic practices of the philosophically informed speaker, we make a series of assumptions concerning the nature and characteristics of the phenomenon. Vagueness is treated as an emerging phenomenon, caused, in essence, by the messy way in which linguistic communities reach classificatory equilibria. Any talk of ‘meaning’, ‘truth’, and such is treated as an indirect way of attempting to describe such equilibria, and it is in regard to these that ascriptions of truth are here relativised. Given such assumptions, we then proceed to formulate and study a semantic theory for languages that contain vague predicates. Finally, we describe two proof systems, one based on trees, and a natural deduction system in the style of Fitch, and outline the appropriate proofs of soundness and completeness.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"22 1","pages":"156 - 186"},"PeriodicalIF":0.0,"publicationDate":"2022-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85252235","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":"Avicenna: a challenge dataset for natural language generation toward commonsense syllogistic reasoning","authors":"Zeinab Aghahadi, A. Talebpour","doi":"10.1080/11663081.2022.2041352","DOIUrl":"https://doi.org/10.1080/11663081.2022.2041352","url":null,"abstract":"Syllogism is a type of everyday reasoning. For instance, given that ‘Avicenna wrote the famous book the Canon of Medicine’ and ‘The Canon of Medicine has influenced modern medicine,’ it can be concluded that ‘Avicenna has influenced modern medicine.’ This study revolves around syllogistic natural language generation (NLG). The Avicenna corpus (https://github.com/ZeinabAghahadi/Syllogistic-Commonsense-Reasoning) was developed as a benchmark for syllogistic NLG. In this respect, once the syllogistic relation between two premises is recognised [Aghahadi, Z., & Talebpour, A. (2022). Language-based syllogistic reasoning using deep neural networks. Cognitive Semantics, 8(2)], the Avicenna-trained models learn to generate the conclusion sentence. The experiments were performed using state-of-the-art pre-trained text generative models and the accuracy was improved up to 32% when transfer learning was adopted. The model’s confusion in detecting the middle-term was one of the main categories of errors that showed up in the error analysis. This issue indicates that the model learns how to extract new facts based on the premises, but it faces a challenge in commonsense reasoning.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"1 1","pages":"55 - 71"},"PeriodicalIF":0.0,"publicationDate":"2022-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84172602","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":"A categorical approach to graded fuzzy topological system and fuzzy geometric logic with graded consequence","authors":"P. Jana, Mihir K. Chakraborty","doi":"10.1080/11663081.2022.2050134","DOIUrl":"https://doi.org/10.1080/11663081.2022.2050134","url":null,"abstract":"A detailed study of graded frame, graded fuzzy topological system and fuzzy topological space with graded inclusion is already done in our earlier paper. The notions of graded fuzzy topological system and fuzzy topological space with graded inclusion were obtained via fuzzy geometric logic with graded consequence. As an offshoot, the notion of graded frame has been developed. This paper deals with a categorical study of graded frame, graded fuzzy topological system and fuzzy topological space with graded inclusion and their interrelation.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"22 1","pages":"11 - 27"},"PeriodicalIF":0.0,"publicationDate":"2022-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83478164","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":"Representing voting rules in Łukasiewicz’s three-valued logic","authors":"Adrian Miroiu, M. Dumitru","doi":"10.1080/11663081.2022.2041351","DOIUrl":"https://doi.org/10.1080/11663081.2022.2041351","url":null,"abstract":"We show how voting rules like the simple and the absolute majority rules, unanimity, consensus, etc. can be represented as logical operators in Łukasiewicz’s three-valued logic. First, we prove that the binary simple majority operator can be extended to express the majority choice of groups formed of n voters. Consequently, decisions in larger groups can be represented as more complex decisions in groups formed of pairs of voters. This property is not shared, however, by the consensus and the absolute majority operators. Secondly, we prove that the simple majority operator can be defined in terms of the consensus operator, but that the converse does not hold. Finally, we construct the classes of logical operators definable in terms of the simple majority and of the consensus and point to some more general implications of these results.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"1 1","pages":"72 - 88"},"PeriodicalIF":0.0,"publicationDate":"2022-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90739305","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":"A separation theorem for discrete-time interval temporal logic","authors":"Dimitar P. Guelev, B. Moszkowski","doi":"10.1080/11663081.2022.2050135","DOIUrl":"https://doi.org/10.1080/11663081.2022.2050135","url":null,"abstract":"Gabbay's separation theorem about linear temporal logic with past has proved to be one of the most useful theoretical results in temporal logic. In this paper, we establish an analogous statement about Moszkowski's discrete-time propositional Interval Temporal Logic ( ) with two sets of expanding modalities, namely the unary neighbourhood modalities and the binary weak inverses of 's chop operator. We prove that separation holds for both with and without its loop construct chop-star.","PeriodicalId":38573,"journal":{"name":"Journal of Applied Non-Classical Logics","volume":"1949 1","pages":"28 - 54"},"PeriodicalIF":0.0,"publicationDate":"2022-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91178428","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}