{"title":"Minimally Nonstandard K3 and FDE","authors":"Rea Golan, Ulf Hlobil","doi":"10.26686/ajl.v19i5.7540","DOIUrl":"https://doi.org/10.26686/ajl.v19i5.7540","url":null,"abstract":"Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer to classical logic. We give semantic and sequent-calculus formulations of these logics, and we highlight some reasons why these logics may be interesting in their own right.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"828 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126146629","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":"Boole's indefinite symbols re-examined","authors":"D. Makinson","doi":"10.26686/ajl.v19i5.8011","DOIUrl":"https://doi.org/10.26686/ajl.v19i5.8011","url":null,"abstract":"We show how one can give a clear formal account of Boole’s notorious “indefinite\" (or “auxiliary”) symbols by treating them as variables that range over functions from classes to classes rather than just over classes while, at the same time, following Hailperin’s proposal of binding them existentially.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114603494","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":"Truthmakers, Incompatibility, and Modality","authors":"Vita Saitta, Matteo Plebani, Giuliano Rosella","doi":"10.26686/ajl.v19i5.7420","DOIUrl":"https://doi.org/10.26686/ajl.v19i5.7420","url":null,"abstract":"This paper introduces a new framework, based on the notion of compatibility space, obtained by adding a primitive incompatibility relation to a state space in the sense of Fine. The key idea inspiring the framework is to modify Fine's truthmaker semantics by taking the notion of incompatibility as primitive, and use it to define other notions. We discuss some interesting features of the framework and explore its advantages over the standard framework of state spaces. We review some applications of the framework, including proofs of soundness and completeness theorems for a number of logics, one way to use compatibility states to mirror Kripke frames, and an exploration of a way to use the new framework to provide truthmaking clauses for modal formulas.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125571089","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 Recipe for Paradox","authors":"Rashed Ahmad","doi":"10.26686/ajl.v19i5.7887","DOIUrl":"https://doi.org/10.26686/ajl.v19i5.7887","url":null,"abstract":"In this paper, we provide a recipe that not only captures the common structure of semantic paradoxes but also captures our intuitions regarding the relations between these paradoxes. Before we unveil our recipe, we first talk about a well-known schema introduced by Graham Priest, namely, the Inclosure Schema. Without rehashing previous arguments against the Inclosure Schema, we contribute different arguments for the same concern that the Inclosure Schema bundles together the wrong paradoxes. That is, we will provide further arguments on why the Inclosure Schema is both too narrow and too broad. \u0000We then spell out our recipe. The recipe shows that all of the following paradoxes share the same structure: The Liar, Curry's paradox, Validity Curry, Provability Liar, Provability Curry, Knower's paradox, Knower's Curry, Grelling-Nelson's paradox, Russell's paradox in terms of extensions, alternative Liar and alternative Curry, and hitherto unexplored paradoxes. \u0000We conclude the paper by stating the lessons that we can learn from the recipe, and what kind of solutions the recipe suggests if we want to adhere to the Principle of Uniform Solution.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124587416","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":"Pure Refined Variable Inclusion Logics","authors":"D. Szmuc, Mariela Rubin","doi":"10.26686/ajl.v19i5.7991","DOIUrl":"https://doi.org/10.26686/ajl.v19i5.7991","url":null,"abstract":"In this article, we explore the semantic characterization of the (right) pure refined variable inclusion companion of all logics, which is a further refinement of the nowadays well-studied pure right variable inclusion logics. In particular, we will focus on giving a characterization of these fragments via a single logical matrix, when possible, and via a class of finite matrices, otherwise. In order to achieve this, we will rely on extending the semantics of the logics whose companions we will be discussing with infectious values in direct and in more subtle ways. This further establishes the connection between infectious logics and variable inclusion logics.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134131816","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":"Fictional Modality and the Intensionality of Fictional Contexts","authors":"S. Uckelman","doi":"10.26686/ajl.v19i4.7542","DOIUrl":"https://doi.org/10.26686/ajl.v19i4.7542","url":null,"abstract":"In (Kosterec 2021), Kosterec attempts to provide ``model-theoretic proofs'' of certain theses involving the normal modal operators $Diamond$ and $square$ and the truth-in-fiction (`a la Lewis) operator $F$ which he then goes on to show have counterexamples in Kripke models. He concludes from this that the embedding of modal logic under the truth-in-fiction operator is unsound. We show instead that it is the ``model-theoretic proofs'' that are themselves unsound, involving illicit substitution, a subtle error that nevertheless allows us to draw an important conclusion about intensional contexts (such as fictional contexts) and semantic equivalences.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062652","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":"Dissolving the Paradoxicality Paradox","authors":"William Nava","doi":"10.26686/ajl.v19i4.6890","DOIUrl":"https://doi.org/10.26686/ajl.v19i4.6890","url":null,"abstract":"\u0000Non-classical solutions to semantic paradox can be associated with conceptions of paradoxicality understood in terms of entailment facts. In a K3-based theory of truth, for example, it is prima facie natural to say that a sentence φ is paradoxical iff φ ∨ ¬φ entails an absurdity. In a recent paper, Julien Murzi and Lorenzo Rossi exploit this idea to introduce revenge paradoxes for a number of non-classical approaches, including K3. In this paper, I show that on no understanding of ‘is paradoxical’ (for K3) should both rules needed for their paradox be expected to hold unrestrictedly. Just which rule fails, however, depends on various factors, including whether the derivability relation of a target system of reasoning is arithmetically definable.\u0000","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133207223","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":"Paraconsistent resolution","authors":"M. Walicki, Sjur K. Dyrkolbotn","doi":"10.26686/ajl.v19i3.6471","DOIUrl":"https://doi.org/10.26686/ajl.v19i3.6471","url":null,"abstract":"Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for inconsistent theories, specializing to the classical semantics for the consistent ones. Direct (instead of refutational) reasoning with classical resolution is sound and complete for this semantics, when augmented with a specific weakening which, in particular, excludes Ex Falso. Dropping all forms of weakening yields reasoning which also avoids typical fallacies of relevance.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121860238","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":"BCI-Algebras and Related Logics","authors":"M. Bunder","doi":"10.26686/ajl.v19i2.7567","DOIUrl":"https://doi.org/10.26686/ajl.v19i2.7567","url":null,"abstract":"Kabzinski in [6] first introduced an extension of BCI-logic that is isomorphic to BCI-algebras. Kashima and Komori in [7] gave a Gentzen-style sequent calculus version of this logic as well as another sequent calculus which they proved to be equivalent. They used the second to prove decidability of the word problem for BCI-algebras. The decidability proof relies on cut elimination for the second system, this paper provides a fuller and simpler proof of this. Also supplied is a new decidability proof and proof finding algorithm for their second extension of BCI-logic and so for BCI-algebras.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134132533","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 Note on R-Mingle and the Danger of Safety","authors":"A. Tedder","doi":"10.26686/ajl.v19i1.7449","DOIUrl":"https://doi.org/10.26686/ajl.v19i1.7449","url":null,"abstract":"Dunn has recently argued that the logic R-Mingle (or RM) is a good, and good enough, choice for many purposes in relevant and paraconsistent logic. This includes an argument that the validity of Safety principle, according to which one may infer an arbitrary instance of the law of excluded middle from an arbitrary contradiction, in RM is not a problem because it doesn’t allow one to infer anything new from a contradiction. In this paper, I argue that while Dunn’s claim holds for the logic, there is a good reason to think that it’s not the case for (prime) theories closed under the logic, and that this should give relevantists, and some paraconsistentists, pause when considering whether RM is adequate for their purposes.","PeriodicalId":367849,"journal":{"name":"The Australasian Journal of Logic","volume":"24 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120907017","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号
求助内容：
应助结果提醒方式：