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

0 found
Order:
  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)  
    Translate
     
     
    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)  
    Translate
     
     
    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. (Meta)Inferential Levels of Entailment Beyond the Tarskian Paradigm.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - forthcoming - Synthese:1-25.
    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 (3 more)  
     
    Export citation  
     
    Bookmark  
  7. (I Can't Get No) Antisatisfaction.Pablo Cobreros, Elio La Rosa & Luca Tranchini - forthcoming - Synthese:1-15.
    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)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  8. Faulty Belnap Computers and Subsystems of FDE.Thomas Macaulay Ferguson - forthcoming - Journal of Logic and Computation.
    In this article, we consider variations of Nuel Belnap's "artificial reasoner". In particular, we examine cases in which the artificial reasoner is faulty, e.g. situations in which the reasoner is unable to calculate the value of a formula due to an inability to retrieve the values of its atoms. In the first half of the article, we consider two ways of modelling such circumstances and prove the deductive systems arising from these two types of models to be equivalent to Graham (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  9. The (Greatest) Fragment of Classical Logic That Respects the Variable-Sharing Principle (in the Fmla-Fmla Framework).Damian Szmuc - forthcoming - Bulletin of the Section of Logic.
    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  
     
    Export citation  
     
    Bookmark  
  10. A Simple Logical Matrix and Sequent Calculus for Parry’s Logic of Analytic Implication.Damian E. Szmuc - forthcoming - Studia Logica:1-38.
    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  
  11. Meaningless Divisions.Damian Szmuc & Thomas Macaulay Ferguson - forthcoming - Notre Dame Journal of Formal Logic.
    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  
     
    Export citation  
     
    Bookmark  
  12. 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  
     
    Export citation  
     
    Bookmark   1 citation  
  13. 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)  
    Translate
     
     
    Export citation  
     
    Bookmark   10 citations  
  14. 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  
  15. 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  
  16. Contrastando reconstrucciones con herramientas computacionales: una aplicación a la cladística.Ariel Jonathan Roffé - 2020 - Dissertation, Universidad de Buenos Aires (UBA)
  17. 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   5 citations  
  18. A Duality for Involutive Bisemilattices.Stefano Bonzio, Andrea Loi & Luisa Peruzzi - 2019 - Studia Logica 107 (2):423-444.
    We establish a duality between the category of involutive bisemilattices and the category of semilattice inverse systems of Stone spaces, using Stone duality from one side and the representation of involutive bisemilattices as Płonka sum of Boolean algebras, from the other. Furthermore, we show that the dual space of an involutive bisemilattice can be viewed as a GR space with involution, a generalization of the spaces introduced by Gierz and Romanowska equipped with an involution as additional operation.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19. Modeling the Interaction of Computer Errors by Four-Valued Contaminating Logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Berlín, Alemania: pp. 119-139.
    Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Maximality in Finite-Valued Lukasiewicz Logics Defined by Order Filters.Marcelo E. Coniglio, Francesc Esteva, Joan Gispert & Lluis Godo - 2019 - Journal of Logic and Computation 29 (1):125-156.
  21. Recapture, Transparency, Negation and a Logic for the Catuskoti.Adrian Kreutz - 2019 - Comparative Philosophy 10 (1):67-92.
    The recent literature on Nāgārjuna’s catuṣkoṭi centres around Jay Garfield’s (2009) and Graham Priest’s (2010) interpretation. It is an open discussion to what extent their interpretation is an adequate model of the logic for the catuskoti, and the Mūla-madhyamaka-kārikā. Priest and Garfield try to make sense of the contradictions within the catuskoti by appeal to a series of lattices – orderings of truth-values, supposed to model the path to enlightenment. They use Anderson & Belnaps's (1975) framework of First Degree Entailment. (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Truth and Generalized Quantification.Bruno Whittle - 2019 - Australasian Journal of Philosophy 97 (2):340-353.
    Kripke [1975] gives a formal theory of truth based on Kleene's strong evaluation scheme. It is probably the most important and influential that has yet been given—at least since Tarski. However, it has been argued that this theory has a problem with generalized quantifiers such as All—that is, All ϕs are ψ—or Most. Specifically, it has been argued that such quantifiers preclude the existence of just the sort of language that Kripke aims to deliver—one that contains its own truth predicate. (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  23. Relevant Logics Obeying Component Homogeneity.Roberto Ciuni, Damian Szmuc & Thomas Macaulay Ferguson - 2018 - Australasian Journal of Logic 15 (2):301-361.
    This paper discusses three relevant logics that obey Component Homogeneity - a principle that Goddard and Routley introduce in their project of a logic of significance. The paper establishes two main results. First, it establishes a general characterization result for two families of logic that obey Component Homogeneity - that is, we provide a set of necessary and sufficient conditions for their consequence relations. From this, we derive characterization results for S*fde, dS*fde, crossS*fde. Second, the paper establishes complete sequent calculi (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  24. Interpolation in 16-Valued Trilattice Logics.Reinhard Muskens & Stefan Wintein - 2018 - Studia Logica 106 (2):345-370.
    In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  25. Track-Down Operations on Bilattices.Damian Szmuc - 2018 - In Robert Wille & Martin Lukac (eds.), Proceedings of the 48th IEEE International Symposium on Multiple-Valued Logic. Los Alamitos, California, EE. UU.: pp. 74-79.
    This paper discusses a dualization of Fitting's notion of a "cut-down" operation on a bilattice, rendering a "track-down" operation, later used to represent the idea that a consistent opinion cannot arise from a set including an inconsistent opinion. The logic of track-down operations on bilattices is proved equivalent to the logic d_Sfde, dual to Deutsch's system S_fde. Furthermore, track-down operations are employed to provide an epistemic interpretation for paraconsistent weak Kleene logic. Finally, two logics of sequential combinations of cut-and track-down (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26. A Note on Goddard and Routley's Significance Logic.Damian Szmuc & Hitoshi Omori - 2018 - Australasian Journal of Logic 15 (2):431-448.
    The present note revisits the joint work of Leonard Goddard and Richard Routley on significance logics with the aim of shedding new light on their understanding by studying them under the lens of recent semantic developments, such as the plurivalent semantics developed by Graham Priest. These semantics allow sentences to receive one, more than one, or no truth-value at all from a given carrier set. Since nonsignificant sentences are taken to be neither true nor false, i.e. truth-value gaps, in this (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27. Logically Impossible Worlds.Koji Tanaka - 2018 - Australasian Journal of Logic 15 (2):489.
    What does it mean for the laws of logic to fail? My task in this paper is to answer this question. I use the resources that Routley/Sylvan developed with his collaborators for the semantics of relevant logics to explain a world where the laws of logic fail. I claim that the non-normal worlds that Routley/Sylvan introduced are exactly such worlds. To disambiguate different kinds of impossible worlds, I call such worlds logically impossible worlds. At a logically impossible world, the laws (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28. The Lvov-Warsaw School. Past and Present.Urszula Wybraniec-Skardowska & Ángel Garrido (eds.) - 2018 - Cham, Switzerland: Springer- Birkhauser,.
    This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  29. Logic: The Basics (2nd Edition).Jc Beall & Shay A. Logan - 2017 - Routledge.
    Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  30. New Dimensions of the Square of Opposition.Jean-Yves Beziau & Stamatios Gerogiorgakis (eds.) - 2017 - Munich: Philosophia.
    The square of opposition is a diagram related to a theory of oppositions that goes back to Aristotle. Both the diagram and the theory have been discussed throughout the history of logic. Initially, the diagram was employed to present the Aristotelian theory of quantification, but extensions and criticisms of this theory have resulted in various other diagrams. The strength of the theory is that it is at the same time fairly simple and quite rich. The theory of oppositions has recently (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Hybridized Paracomplete and Paraconsistent Logics.Colin Caret - 2017 - Australasian Journal of Logic 14 (1):281-325.
    This paper contributes to the study of paracompleteness and paraconsistency. We present two logics that address the following questions in novel ways. How can the paracomplete theorist characterize the formulas that defy excluded middle while maintaining that not all formulas are of this kind? How can the paraconsistent theorist characterize the formulas that obey explosion while still maintaining that there are some formulas not of this kind?
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  32. Topos Theoretic Quantum Realism.Benjamin Eva - 2017 - British Journal for the Philosophy of Science 68 (4):1149-1181.
    ABSTRACT Topos quantum theory is standardly portrayed as a kind of ‘neo-realist’ reformulation of quantum mechanics.1 1 In this article, I study the extent to which TQT can really be characterized as a realist formulation of the theory, and examine the question of whether the kind of realism that is provided by TQT satisfies the philosophical motivations that are usually associated with the search for a realist reformulation of quantum theory. Specifically, I show that the notion of the quantum state (...)
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  33. Classicality Lost: K3 and LP After the Fall.Matthias Jenny - 2017 - Thought: A Journal of Philosophy 6 (1):43-53.
    It is commonly held that the ascription of truth to a sentence is intersubstitutable with that very sentence. However, the simplest subclassical logics available to proponents of this view, namely K3 and LP, are hopelessly weak for many purposes. In this article, I argue that this is much more of a problem for proponents of LP than for proponents of K3. The strategies for recapturing classicality offered by proponents of LP are far less promising than those available to proponents of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  34. Iterated Reflection Over Full Disquotational Truth.Fischer Martin, Nicolai Carlo & Horsten Leon - 2017 - Journal of Logic and Computation 27 (8):2631-2651.
    Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection of Tarski-biconditionals and arrive by iterated reflection at strong compositional truth theories. In the context of classical logic, it is incoherent to adopt an initial truth theory in which A and ‘A is truen’ are inter-derivable. In this article, we show how in the context (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  35. 16TaP: A Toy Tableau Theorem Prover for 16-Valued Trilattice Logics.Reinhard Muskens - 2017 - A Programming Road to Logic, Maths, Language, and Philosophy : A Tribute to Jan van Eijck on the Occasion of His Retirement.
    A short description of a toy theorem prover for 16-valued trilattice logics. Written for the occasion of my friend's Jan van Eijck's retirement. With a link to a swish interface to the prolog prover.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36. Conjunction and Disjunction in Infectious Logics.Hitoshi Omori & Damian Szmuc - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction (LORI 2017, Sapporo, Japan). Berlin: Springer. pp. 268-283.
    In this paper we discuss the extent to which conjunction and disjunction can be rightfully regarded as such, in the context of infectious logics. Infectious logics are peculiar many-valued logics whose underlying algebra has an absorbing or infectious element, which is assigned to a compound formula whenever it is assigned to one of its components. To discuss these matters, we review the philosophical motivations for infectious logics due to Bochvar, Halldén, Fitting, Ferguson and Beall, noticing that none of them discusses (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  37. LP, K3, and FDE as Substructural Logics.Lionel Shapiro - 2017 - In Pavel Arazim & Tomáš Lavička (eds.), The Logica Yearbook 2016. London: College Publications.
    Building on recent work, I present sequent systems for the non-classical logics LP, K3, and FDE with two main virtues. First, derivations closely resemble those in standard Gentzen-style systems. Second, the systems can be obtained by reformulating a classical system using nonstandard sequent structure and simply removing certain structural rules (relatives of exchange and contraction). I clarify two senses in which these logics count as “substructural.”.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  38. Skolem Functions in Non-Classical Logics.Tore Fjetland Øgaard - 2017 - Australasian Journal of Logic 14 (1):181-225.
    This paper shows how to conservatively extend theories formulated in non-classical logics such as the Logic of Paradox, the Strong Kleene Logic and relevant logics with Skolem functions. Translations to and from the language extended by Skolem functions into the original one are presented and shown to preserve derivability. It is also shown that one may not always substitute s=f(t) and A(t, s) even though A determines the extension of a function and f is a Skolem function for A.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  39. Lógicas multivalentes. Uma introdução matemática e computacional.Luis M. Augusto - 2016 - Dissertation, Universidade Aberta
    This is a mathematical and computational intro to many-valued logics. The approach is mostly mathematical, namely algebraic (via the notion of logical matrix) and computational (via the satisfiability problem). An automated calculus -- the signed resolution calculus for many-valued logics -- is elaborated on.
    Remove from this list  
    Translate
     
     
    Export citation  
     
    Bookmark  
  40. Defining LFIs and LFUs in Extensions of Infectious Logics.Szmuc Damian Enrique - 2016 - Journal of Applied Non-Classical Logics 26 (4):286-314.
    The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  41. Presuppositions as Anaphoric Duality Enablers.Christopher Gauker - 2016 - Topoi 35 (1):133-144.
    The key to an adequate account of presupposition projection is to accommodate the fact that the presuppositions of a sentence cannot always be read off the sentence but can often be identified only on the basis of prior utterances in the conversation in which the sentence is uttered. In addition, an account of presupposition requires a three-valued semantics of assertibility and deniability in a context. Presuppositions can be explicated as sentences that belong to the conversation and the assertibility of which (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  42. On Modal Meinongianism.Thibaut Giraud - 2016 - Synthese 193 (10).
    Modal Meinongianism is a form of Meinongianism whose main supporters are Graham Priest and Francesco Berto. The main idea of modal Meinongianism is to restrict the logical deviance of Meinongian non-existent objects to impossible worlds and thus prevent it from “contaminating” the actual world: the round square is round and not round, but not in the actual world, only in an impossible world. In the actual world, supposedly, no contradiction is true. I will show that Priest’s semantics, as originally formulated (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43. Classicality Lost: K3 and LP After the Fall.Matthias Jenny - 2016 - Thought: A Journal of Philosophy 5 (4).
    It is commonly held that the ascription of truth to a sentence is intersubstitutable with that very sentence. However, the simplest subclassical logics available to proponents of this view, namely K3 and LP, are hopelessly weak for many purposes. In this paper, I argue that this is much more of a problem for proponents of LP than for proponents of K3. The strategies for recapturing classicality offered by proponents of LP are far less promising than those available to proponents of (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Une sémantique générale des croyances justifiées.Fabien Schang & Alexandre Costa Leite - 2016 - CLE-Prints 16 (3):1-24.
    Nous proposons une logique épistémique quadrivalente AR4.
    Remove from this list   Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  45. Logics of Nonsense and Parry Systems.Thomas Macaulay Ferguson - 2015 - Journal of Philosophical Logic 44 (1):65-80.
    We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B 3 and Graham Priest’s (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  46. Tense Polyadic N × M-Valued Łukasiewicz–Moisil Algebras.Aldo V. Figallo & Gustavo Pelaitay - 2015 - Bulletin of the Section of Logic 44 (3/4).
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  47. Peter Geach: A Few Personal Remarks.Arthur Gibson - 2015 - Philosophical Investigations 38 (1-2):25-33.
    Personal biographical outline of being taught by, and encounters with, Peter Geach.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48. An Alternative Approach for Quasi-Truth.Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini - 2014 - Logic Journal of the IGPL 22 (2):387-410.
    In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  49. On a Four-Valued Modal Logic with Deductive Implication.Marcelo E. Coniglio & Martín Figallo - 2014 - Bulletin of the Section of Logic 43 (1/2):1-18.
    In this paper we propose to enrich the four-valued modal logic associated to Monteiro's Tetravalent modal algebras (TMAs) with a deductive implication, that is, such that the Deduction Meta-theorem holds in the resulting logic. All this lead us to establish some new connections between TMAs, symmetric (or involutive) Boolean algebras, and modal algebras for extensions of S5, as well as their logical counterparts.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  50. A Computational Interpretation of Conceptivism.Thomas Macaulay Ferguson - 2014 - Journal of Applied Non-Classical Logics 24 (4):333-367.
    The hallmark of the deductive systems known as ‘conceptivist’ or ‘containment’ logics is that for all theorems of the form , all atomic formulae appearing in also appear in . Significantly, as a consequence, the principle of Addition fails. While often billed as a formalisation of Kantian analytic judgements, once semantics were discovered for these systems, the approach was largely discounted as merely the imposition of a syntactic filter on unrelated systems. In this paper, we examine a number of prima (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  51. Nothing in this category. Everyone can categorize entries. Please help if you have the expertise.