This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

398 found
Order:
1 — 50 / 398
  1. Chess composition as an art.Miro Brada - manuscript
    The article presents the chess composition as a logical art, with concrete examples. It began with Arabic mansuba, and later evolved to new-strategy designed by Italian Alberto Mari. The redefinition of mate (e.g. mate with a free field) or a theme to quasi-pseudo theme, opens the new space for combinations, and enables to connect it with other fields like computer science. The article was exhibited in Holland Park, W8 6LU, The Ice House between 18. Oct - 3. Nov. 2013.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2. Valuations.Jean-Louis Lenard - manuscript
    Is logic empirical? Is logic to be found in the world? Or is logic rather a convention, a product of conventions, part of the many rules that regulate the language game? Answers fall in either camp. We like the linguistic answer. In this paper, we want to analyze how a linguistic community would tackle the problem of developing a logic and show how the linguistic conventions adopted by the community determine the properties of the local logic. Then show how to (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. Truth and Subjunctive Theories of Knwledge: No Luck?Johannes Stern - manuscript
    The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by mere luck as to be found in Gettier-style counterexamples to the analysis of knowledge as justified true belief. Because of the subjunctive nature of these conditions the resulting semantics turns out to be non-monotone, even if it is based on non-classical evaluation schemes such as strong Kleene (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  4. Some Strong Conditionals for Sentential Logics.Jason Zarri - manuscript
    In this article I define a strong conditional for classical sentential logic, and then extend it to three non-classical sentential logics. It is stronger than the material conditional and is not subject to the standard paradoxes of material implication, nor is it subject to some of the standard paradoxes of C. I. Lewis’s strict implication. My conditional has some counterintuitive consequences of its own, but I think its pros outweigh its cons. In any case, one can always augment one’s language (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5. Syntactic characterizations of first-order structures in mathematical fuzzy logic.Guillermo Badia, Pilar Dellunde, Vicent Costa & Carles Noguera - forthcoming - Soft Computing.
    This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Many-Valued Logics and Bivalent Modalities.Edson Bezerra & Giorgio Venturi - forthcoming - Logic and Logical Philosophy:1-26.
    In this paper, we investigate the family LS0.5 of many-valued modal logics LS0.5's. We prove that the modalities of necessity and possibility of the logics LS0.5's capture well-defined bivalent concepts of logical validity and logical consistency. We also show that these modalities can be used as recovery operators.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Twist-Valued Models for Three-Valued Paraconsistent Set Theory.Walter A. Carnielli & Marcelo E. Coniglio - forthcoming - Logic and Logical Philosophy:1.
    We propose in this paper a family of algebraic models of ZFC based on the three-valued paraconsistent logic LPT0, a linguistic variant of da Costa and D’Ottaviano’s logic J3. The semantics is given by twist structures defined over complete Boolean agebras. The Boolean-valued models of ZFC are adapted to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. This allows for inconsistent sets w satisfying ‘not (w = w)’, where ‘not’ stands for the paraconsistent negation. Finally, our (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Paraconsistentization and many-valued logics.Edelcio G. de Souza, Alexandre Costa-Leite & Diogo H. B. Dias - forthcoming - Logic Journal of the IGPL.
    This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate mainly the case of three-valued systems exhibiting how non-explosive three-valued logics can be obtained from them.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9. Two-sided Sequent Calculi for FDE-like Four-valued Logics.Barteld Kooi & Allard Tamminga - forthcoming - Journal of Philosophical Logic:1-24.
    We present a method that generates two-sided sequent calculi for four-valued logics like "first degree entailment" (FDE). (We say that a logic is FDE-like if it has finitely many operators of finite arity, including negation, and if all of its operators are truth-functional over the four truth-values 'none', 'false', 'true', and 'both', where 'true' and 'both' are designated.) First, we show that for every n-ary operator * every truth table entry f*(x1,...,xn) = y can be characterized in terms of a (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  10. Disjoint Logics.Federico Pailos - forthcoming - Logic and Logical Philosophy:1.
    We will present all the mixed and impure disjoint three-valued logics based on the Strong Kleene schema. Some, but not all of them, are (inferentially) empty logics. We will also provide a recipe to build philosophical interpretations for each of these logics, and show why the kind of permeability that characterized them is not such a bad feature.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11. Pure Variable Inclusion Logics.Francesco Paoli, Michele Pra Baldi & Damian Szmuc - forthcoming - Logic and Logical Philosophy:1-22.
    The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12. Beyond Mixed Logics.Joaquín Toranzo Calderón & Federico Pailos - forthcoming - Logic and Logical Philosophy:1-28.
    In order to define some interesting consequence relations, certain generalizations have been proposed in a many-valued semantic setting that have been useful for defining what have been called pure, mixed and ordertheoretic consequence relations. But these generalizations are insufficient to capture some other interesting relations, like other intersective mixed relations or relations with a conjunctive interpretation for multiple conclusions. We propose a broader framework to define these cases, and many others, and to set a common background that allows for a (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. The Quantified Argument Calculus with Two- and Three-valued Truth-valuational Semantics.Hongkai Yin & Hanoch Ben-Yami - forthcoming - Studia Logica:1-40.
    We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical predicate T to Quarc, true of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14. Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC.Richard Zach - forthcoming - Logic and Logical Philosophy:1-19.
    Angell's logic of analytic containment AC has been shown to be characterized by a 9-valued matrix NC by Ferguson, and by a 16-valued matrix by Fine. We show that the former is the image of a surjective homomorphism from the latter, i.e., an epimorphic image. The epimorphism was found with the help of MUltlog, which also provides a tableau calculus for NC extended by quantifiers that generalize conjunction and disjunction.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16. Two Decision Procedures for da Costa’s $$C_n$$ C n Logics Based on Restricted Nmatrix Semantics.Marcelo E. Coniglio & Guilherme V. Toledo - 2022 - Studia Logica 110 (3):601-642.
    Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between mbCcl and Cila. In order to overcome this limitation, we propose here restricted non-deterministic matrices (in short, RNmatrices), which are non-deterministic algebras together with a subset of the set of valuations. This allows us to characterize not only mbCcl and Cila (which is equivalent, up to language, to da Costa's logic C_1) but the whole hierarchy of da Costa's calculi (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17. MTV Logics.Roy T. Cook - 2022 - Journal of Philosophical Logic 51 (6):1477-1519.
    This essay introduces a novel framework to studying many-valued logics – the movable truth value (or MTV ) approach. After setting up the framework, we will show that a vast number of many-valued logics, and in particular many-valued logics that have previously been given very different kinds of semantics, including C, K3, LP, ST, TS, RM fde, and FDE, can all be unified within the MTV -logic approach. This alone is notable, since until now RM fde in particular has resisted (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  18. G'3 as the logic of modal 3-valued Heyting algebras.Marcelo E. Coniglio, Aldo Figallo-Orellano, Alejandro Hernández-Tello & Miguel Perez-Gaspar - 2022 - IfCoLog Journal of Logics and Their Applications 9 (1):175-197.
    In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19. Deep ST.Thomas M. Ferguson & Elisángela Ramírez-Cámara - 2022 - Journal of Philosophical Logic 51 (6):1261-1293.
    Many analyses of notion of _metainferences_ in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e._, inferences involving objects belonging (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20. Structural Completeness in Many-Valued Logics with Rational Constants.Joan Gispert, Zuzana Haniková, Tommaso Moraschini & Michał Stronkowski - 2022 - Notre Dame Journal of Formal Logic 63 (3):261-299.
    The logics RŁ, RP, and RG have been obtained by expanding Łukasiewicz logic Ł, product logic P, and Gödel–Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions, obtaining results that stand in contrast to the known situation in Ł, P, and G. Namely, RŁ is hereditarily structurally complete. RP is algebraized by the variety of rational product algebras that we show to be Q-universal. We provide a base of admissible rules (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21. Minimally Nonstandard K3 and FDE.Rea Golan & Ulf Hlobil - 2022 - Australasian Journal of Logic 19 (5):182-213.
    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 (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22. Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics.Allen P. Hazen & Francis Jeffry Pelletier - 2022 - In Ivo Düntsch & Edwin Mares (eds.), Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs. Springer Verlag. pp. 557-570.
    There are good reasons to want logics, including many-valued logics, to have usable conditionals, and we have explored this in certain logics. However, it turns out that we “accidentally” chose some favourable logics. In this paper, we look at some of the unfavourable logics and describe where usable conditionals can be added and where it is not possible.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  23. Dissolving the paradoxicality paradox.William Nava - 2022 - Australasian Journal of Logic 19 (4):133-146.
    Non-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 (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24. Peirce and Łukasiewicz on modal and multi-valued logics.Jon Alan Schmidt - 2022 - Synthese 200 (4):1-18.
    Charles Peirce incorporates modality into his Existential Graphs by introducing the broken cut for possible falsity. Although it can be adapted to various modern modal logics, Zeman demonstrates that making no other changes results in a version that he calls Gamma-MR, an implementation of Jan Łukasiewicz's four-valued Ł-modal system. It disallows the assertion of necessity, reflecting a denial of determinism, and has theorems involving possibility that seem counterintuitive at first glance. However, the latter is a misconception that arises from overlooking (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  25. Towards Tractable Approximations to Many-Valued Logics: the Case of First Degree Entailment.Alejandro Solares-Rojas & Marcello D’Agostino - 2022 - In Igor Sedlár (ed.), The Logica Yearbook, 2021. London, UK: pp. 57-76.
    FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26. Non-classical Comparative Logic I: Standard Categorical Logic–from SLe to IFLe.Amer Amikhteh & Seyed Ahmad Mirsanei - 2021 - Logical Studies 12 (1):1-24.
    n this paper, a non-classical axiomatic system was introduced to classify all moods of Aristotelian syllogisms, in addition to the axiom "Every a is an a" and the bilateral rules of obversion of E and O propositions. This system consists of only 2 definitions, 2 axioms, 1 rule of a premise, and moods of Barbara and Datisi. By adding first-degree propositional negation to this system, we prove that the square of opposition holds without using many of the other rules of (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  27. Two-variable logic has weak, but not strong, Beth definability.Hajnal Andréka & István Németi - 2021 - Journal of Symbolic Logic 86 (2):785-800.
    We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28. Lindström theorems in graded model theory.Guillermo Badia & Carles Noguera - 2021 - Annals of Pure and Applied Logic 172 (3):102916.
    Stemming from the works of Petr Hájek on mathematical fuzzy logic, graded model theory has been developed by several authors in the last two decades as an extension of classical model theory that studies the semantics of many-valued predicate logics. In this paper we take the first steps towards an abstract formulation of this model theory. We give a general notion of abstract logic based on many-valued models and prove six Lindström-style characterizations of maximality of first-order logics in terms of (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  29. Degree-Preserving Gödel Logics with an Involution: Intermediate Logics and Paraconsistency.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - 2021 - In Ofer Arieli & Anna Zamansky (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Springer Verlag. pp. 107-139.
    In this paper we study intermediate logics between the logic G≤∼, the degree preserving companion of Gödel fuzzy logic with involution G∼ and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts G≤n∼. Although G≤∼ and G≤ are explosive w.r.t. Gödel negation ¬, they are paraconsistent w.r.t. the involutive negation ∼. We introduce the notion of saturated paraconsistency, a weaker notion than ideal paraconsistency, and we fully characterize the ideal and the saturated paraconsistent logics between (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  30. A Family of Strict/Tolerant Logics.Melvin Fitting - 2021 - Journal of Philosophical Logic 50 (2):363-394.
    Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  31. Calculi for Many-Valued Logics.Michael Kaminski & Nissim Francez - 2021 - Logica Universalis 15 (2):193-226.
    We present a number of equivalent calculi for many-valued logics and prove soundness and strong completeness theorems. The calculi are obtained from the truth tables of the logic under consideration in a straightforward manner and there is a natural duality among these calculi. We also prove the cut elimination theorems for the sequent-like systems.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  32. Many-valued logic and sequence arguments in value theory.Simon Knutsson - 2021 - Synthese 199 (3-4):10793-10825.
    Some find it plausible that a sufficiently long duration of torture is worse than any duration of mild headaches. Similarly, it has been claimed that a million humans living great lives is better than any number of worm-like creatures feeling a few seconds of pleasure each. Some have related bad things to good things along the same lines. For example, one may hold that a future in which a sufficient number of beings experience a lifetime of torture is bad, regardless (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Gödel on Many-Valued Logic.Tim Lethen - 2021 - Review of Symbolic Logic:1-17.
    This paper collects and presents unpublished notes of Kurt Gödel concerning the field of many-valued logic. In order to get a picture as complete as possible, both formal and philosophical notes, transcribed from the Gabelsberger shorthand system, are included.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34. On the Methods of Constructing Hilbert-type Axiom Systems for Finite-valued Propositional Logics of Łukasiewicz.Mateusz M. Radzki - 2021 - History and Philosophy of Logic 43 (1):70-79.
    The article explores the following question: which among the most often examined in the literature method of constructing Hilbert-type axiom systems for finite-valued propositional logics of Łukasi...
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35. Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi.Ariel Jonathan Roffé & Federico Pailos - 2021 - Australasian Journal of Logic 3.
    In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. From Intuitionism to Many-Valued Logics Through Kripke Models.Saeed Salehi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and Their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 339-348.
    Intuitionistic Propositional LogicIntuitionistic propositional logic is proved to be an infinitely many valued logicMany valued logics by Gödel Publications 1929–1936, Oxford University Press, pp 222–225, 1932), and it is proved by Jaśkowski Jaśkowski, S. to be a countably many valued logicMany valued logics. In this paper, we provide alternative proofs for these theorems by using models of Kripke :1–14, 1959). Gödel’s proof gave rise to an intermediate propositional logic, that is known nowadays as Gödel or the Gödel-Dummett LogicGödel-Dummet Logic, and (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  37. A Simple Logical Matrix and Sequent Calculus for Parry’s Logic of Analytic Implication.Damian E. Szmuc - 2021 - Studia Logica 109 (4):791-828.
    We provide a logical matrix semantics and a Gentzen-style sequent calculus for the first-degree entailments valid in W. T. Parry’s logic of Analytic Implication. We achieve the former by introducing a logical matrix closely related to that inducing paracomplete weak Kleene logic, and the latter by presenting a calculus where the initial sequents and the left and right rules for negation are subject to linguistic constraints.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework).Damian E. Szmuc - 2021 - Bulletin of the Section of Logic 50 (4):421-453.
    We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  39. Meaningless Divisions.Damian Szmuc & Thomas Macaulay Ferguson - 2021 - Notre Dame Journal of Formal Logic 62 (3):399-424.
    In this article we revisit a number of disputes regarding significance logics---i.e., inferential frameworks capable of handling meaningless, although grammatical, sentences---that took place in a series of articles most of which appeared in the Australasian Journal of Philosophy between 1966 and 1978. These debates concern (i) the way in which logical consequence ought to be approached in the context of a significance logic, and (ii) the way in which the logical vocabulary has to be modified (either by restricting some notions, (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40. Many-valued logics. A mathematical and computational introduction.Luis M. Augusto - 2020 - London: College Publications.
    2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41. A Hierarchy of Classical and Paraconsistent Logics.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2020 - Journal of Philosophical Logic 49 (1):93-120.
    In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  42. (I can’t get no) antisatisfaction.Pablo Cobreros, Elio La Rosa & Luca Tranchini - 2020 - Synthese 198 (9):8251-8265.
    Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named ST and TS, along with two structural cousins, LP and K3. It is well known that LP and K3 are duals in the sense that an inference is valid in one logic just in case the contrapositive is valid in the other logic. As a consequence of this duality, theories based on either logic are (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  43. A General Framework for $$ {FDE}$$ FDE -Based Modal Logics.Sergey Drobyshevich - 2020 - Studia Logica 108 (6):1281-1306.
    We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also develop some correspondence theory and show how Hilbert-style axiom systems can be obtained in appropriate cases. Finally, we outline how different systems from the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Paracomplete logics which are dual to the paraconsistent logics L3A and L3B.Alejandro Hernández-Tello, Verónica Borja-Macı́as & Marcelo E. Coniglio - 2020 - LANMR 2019: Proceedings of the 12th Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning.
    In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are: |- φ, ¬φ, and ¬(ψ ∨ ¬ψ) |- . We call genuine paracomplete logics those rejecting the mentioned properties. (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. Star models and the semantics of infectiousness.Matthew W. G. McClure - 2020 - Undergraduate Philosophy Journal of Australasia 2 (2):35–57.
    The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack indeterminate to (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. Tree-Like Proof Systems for Finitely-Many Valued Non-deterministic Consequence Relations.Pawel Pawlowski - 2020 - Logica Universalis 14 (4):407-420.
    The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47. Four-Valued Logics of Truth, Nonfalsity, Exact Truth, and Material Equivalence.Adam Přenosil - 2020 - Notre Dame Journal of Formal Logic 61 (4):601-621.
    The four-valued semantics of Belnap–Dunn logic, consisting of the truth values True, False, Neither, and Both, gives rise to several nonclassical logics depending on which feature of propositions we wish to preserve: truth, nonfalsity, or exact truth. Interpreting equality of truth values in this semantics as material equivalence of propositions, we can moreover see the equational consequence relation of this four-element algebra as a logic of material equivalence. In this paper, we axiomatize all combinations of these four-valued logics, for example, (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48. Contrastando reconstrucciones con herramientas computacionales: una aplicación a la cladística.Ariel Jonathan Roffé - 2020 - Dissertation, Universidad de Buenos Aires (Uba)
  49. (Meta)inferential levels of entailment beyond the Tarskian paradigm.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - 2019 - Synthese 198 (S22):5265-5289.
    In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  50. Negation on the Australian Plan.Francesco Berto & Greg Restall - 2019 - Journal of Philosophical Logic 48 (6):1119-1144.
    We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities between such points. (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
1 — 50 / 398