View topic on PhilPapers for more information
Related categories

164 found
Order:
More results on PhilPapers
1 — 50 / 164
  1. added 2019-10-15
    (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   Download  
     
    Export citation  
     
    Bookmark  
  2. added 2019-09-21
    A Non Monotonic Reasoning Framework for Goal-Oriented Knowledge Adaptation.Antonio Lieto, Federico Perrone, Gian Luca Pozzato & Eleonora Chiodino - 2019 - In Paglieri (ed.), Proceedings of AISC 2019. Rome: Università degli Studi di Roma Tre. pp. 12-14.
    In this paper we present a framework for the dynamic and automatic generation of novel knowledge obtained through a process of commonsense reasoning based on typicality-based concept combination. We exploit a recently introduced extension of a Description Logic of typicality able to combine prototypical descriptions of concepts in order to generate new prototypical concepts and deal with problem like the PET FISH (Osherson and Smith, 1981; Lieto & Pozzato, 2019). Intuitively, in the context of our application of this logic, the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. added 2019-08-28
    असंभव, अपूर्णता, अनिर्णय, अनिर्णय, यादृच्छिकता, गणना, विरोधाभास, और चैटिन, विटगेनस्टीन, Hofstadter, Wolpert, डोरिया, दा कोस्टा, गोडेल, सीरले, Rodych, Berto, Floyd में अनिश्चितता पर टिप्पणी मोयाल-शररॉक और यानोफ्स्की.Michael Richard Starks - 2019 - Las Vegas, NV USA: Reality Press.
    यह आमतौर पर सोचा जाता है कि असंभवता, अपूर्णता, Paraconsistency, अनिर्णितता, Randomness, Computability, विरोधाभास, अनिश्चितता और कारण की सीमा अलग वैज्ञानिक शारीरिक या गणितीय मुद्दों में कम या कुछ भी नहीं कर रहे हैं आम. मेरा सुझाव है कि वे काफी हद तक मानक दार्शनिक समस्याओं (यानी, भाषा का खेल) जो ज्यादातर 80years पहले Wittgenstein द्वारा हल किए गए थे. -/- "क्या हम 'इस तरह के एक मामले में कहने के लिए' कर रहे हैं, ज़ाहिर है, दर्शन नहीं है, लेकिन (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. added 2019-07-12
    Non-Normative Logical Pluralism and the Revenge of the Normativity Objection.Erik Stei - 2019 - Philosophical Quarterly:1-16.
    Logical pluralism is the view that there is more than one correct logic. Most logical pluralists think that logic is normative in the sense that you make a mistake if you accept the premisses of a valid argument but reject its conclusion. Some authors have argued that this combination is self-undermining: Suppose that L1 and L2 are correct logics that coincide except for the argument from Γ to φ, which is valid in L1 but invalid in L2. If you accept (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. added 2019-06-06
    Degree Supervaluational Logic.J. Robert G. Williams - 2011 - Review of Symbolic Logic 4 (1):130-149.
    Supervaluationism is often described as the most popular semantic treatment of indeterminacy. There???s little consensus, however, about how to fill out the bare-bones idea to include a characterization of logical consequence. The paper explores one methodology for choosing between the logics: pick a logic that norms belief as classical consequence is standardly thought to do. The main focus of the paper considers a variant of standard supervaluational, on which we can characterize degrees of determinacy. It applies the methodology above to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  6. added 2019-06-06
    Logical Consequence in Modal Logic II: Some Semantic Systems for S4.George Weaver - 1974 - Notre Dame Journal of Formal Logic 15:370.
    ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be equivalent; (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. added 2019-06-05
    Modal Ω-Logic: Automata, Neo-Logicism, and Set-Theoretic Realism.Hasen Khudairi - 2019 - In Matteo Vincenzo D'Alfonso & Don Berkich (eds.), On the Cognitive, Ethical, and Scientific Dimensions of Artificial Intelligence. Springer.
    This essay examines the philosophical significance of Ω-logic in Zermelo-Fraenkel set theory with choice (ZFC). The dual isomorphism between algebra and coalgebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of Ω-logical validity can then be countenanced within a coalgebraic logic, and Ω-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of Ω-logical validity correspond to those of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. added 2019-06-05
    Philosophy of Logic. Hilary Putnam.John Corcoran - 1973 - Philosophy of Science 40 (1):131-133.
    Putnam, Hilary FPhilosophy of logic. Harper Essays in Philosophy. Harper Torchbooks, No. TB 1544. Harper & Row, Publishers, New York-London, 1971. v+76 pp. The author of this book has made highly regarded contributions to mathematics, to philosophy of logic and to philosophy of science, and in this book he brings his ideas in these three areas to bear on the traditional philosophic problem of materialism versus (objective) idealism. The book assumes that contemporary science (mathematical and physical) is largely correct as (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. added 2019-06-05
    Philosophy of Logic. Willard Van Orman Quine.John Corcoran - 1972 - Philosophy of Science 39 (1):97-99.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. added 2019-05-14
    Probability of Immortality and God’s Existence. A Mathematical Perspective.Jesús Sánchez - manuscript
    What are the probabilities that this universe is repeated exactly the same with you in it again? Is God invented by human imagination or is the result of human intuition? The intuition that the same laws/mechanisms (evolution, stability winning probability) that have created something like the human being capable of self-awareness and controlling its surroundings, could create a being capable of controlling all what it exists? Will be the characteristics of the next universes random or tend to something? All these (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. added 2019-05-10
    Overgeneration in the Higher Infinite.Salvatore Florio & Luca Incurvati - manuscript
    The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation of the model-theoretic account to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. added 2019-05-02
    Tarski Undefinability Theorem Terse Refutation.P. Olcott - manuscript
    Both Tarski and Gödel “prove” that provability can diverge from Truth. When we boil their claim down to its simplest possible essence it is really claiming that valid inference from true premises might not always derive a true consequence. This is obviously impossible.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. added 2019-04-25
    Editorial: Surrogacy Around the World.Shamima Parvin Lasker - 2017 - Bangladesh Journal of Bioethics 8 (3).
    Surrogacy is an encouraging management for many childless couples and can hypothetically resolve many unbearable pain that they are confronted. Initially surrogacy treatment was frowned upon, however, surrogacy is more popularly accepted now a day. But different country has different regulations on surrogacy. However, there are some degree of divergence between official discourse and actual practice of surrogacy throughout world. There are positive changes in attitude toward surrogacy has been seen for some countries as well. This editorial brief about surrogacy (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. added 2019-04-20
    Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. added 2019-04-19
    Eliminating Undecidability and Incompleteness in Formal Systems.Pete Olcott - manuscript
    To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  16. added 2019-04-02
    Tarski Undefinability Theorem Succinctly Refuted.Pete Olcott - manuscript
    If the conclusion of the Tarski Undefinability Theorem was that some artificially constrained limited notions of a formal system necessarily have undecidable sentences, then Tarski made no mistake within his assumptions. When we expand the scope of his investigation to other notions of formal systems we reach an entirely different conclusion showing that Tarski's assumptions were wrong.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17. added 2019-04-02
    Rejection in Łukasiewicz's and Słupecki' Sense.Urszula Wybraniec-Skardowska - 2018 - Lvov-Warsaw School. Past and Present.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18. added 2019-04-02
    On the Mutual Definability of the Notions of Entailment, Rejection, and Inconsistency.Urszula Wybraniec-Skardowska - 2016 - Axioms 5 (15).
    In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author has proved (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  19. added 2019-03-22
    Expressing Truth Directly Within a Formal System with No Need for Model Theory.Pete Olcott - manuscript
    Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to deductive conclusions without any need for other representations.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  20. added 2019-03-22
    Refuting Incompleteness and Undefinability.Pete Olcott - manuscript
    Within the (Haskell Curry) notion of a formal system we complete Tarski's formal correctness: ∀x True(x) ↔ ⊢ x and use this finally formalized notion of Truth to refute his own Undefinability Theorem (based on the Liar Paradox), the Liar Paradox, and the (Panu Raatikainen) essence of the conclusion of the 1931 Incompleteness Theorem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  21. added 2019-03-19
    Minimal Type Theory (YACC BNF).Pete Olcott - manuscript
    This is the formal YACC BNF specification for Minimal Type Theory (MTT). MTT was created by augmenting the syntax of First Order Logic (FOL) to specify Higher Order Logic (HOL) expressions using FOL syntax. Syntax is provided to enable quantifiers to specify type. FOL is a subset of MTT. The ASSIGN_ALIAS operator := enables FOL expressions to be chained together to form HOL expressions.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  22. added 2019-03-09
    Logic in Opposition.Fabien Schang - 2013 - Studia Humana 2 (3):31-45.
    It is claimed hereby that, against a current view of logic as a theory of consequence, opposition is a basic logical concept that can be used to define consequence itself. This requires some substantial changes in the underlying framework, including: a non-Fregean semantics of questions and answers, instead of the usual truth-conditional semantics; an extension of opposition as a relation between any structured objects; a definition of oppositions in terms of basic negation. Objections to this claim will be reviewed.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  23. added 2019-03-01
    Two Kinds of Logical Impossibility.Alexander Sandgren & Koji Tanaka - forthcoming - Noûs.
    In this paper, we argue that a distinction ought to be drawn between two ways in which a given world might be logically impossible. First, a world w might be impossible because the laws that hold at w are different from those that hold at some other world (say the actual world). Second, a world w might be impossible because the laws of logic that hold in some world (say the actual world) are violated at w. We develop a novel (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  24. added 2019-02-04
    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   Download  
     
    Export citation  
     
    Bookmark  
  25. added 2019-01-17
    Metalogic and the Overgeneration Argument.Salvatore Florio & Luca Incurvati - 2019 - Mind 128 (511):761-793.
    A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we take a metatheoretic perspective on the matter. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  26. added 2019-01-08
    Non-Deterministic Algebraization of Logics by Swap Structures.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - forthcoming - Logic Journal of the IGPL.
    Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency (or LFIs) that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  27. added 2018-12-03
    Naïve Validity.Julien Murzi & Lorenzo Rossi - forthcoming - Synthese:1-23.
    Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  28. added 2018-11-29
    Remarks on the Epistemic Interpretation of Paraconsistent Logic.Nicolás Lo Guercio & Damian Szmuc - 2018 - Principia: An International Journal of Epistemology 22 (1):153-170.
    In a recent work, Walter Carnielli and Abilio Rodrigues present an epistemically motivated interpretation of paraconsistent logic. In their view, when there is conflicting evidence with regard to a proposition A (i.e. when there is both evidence in favor of A and evidence in favor of ¬A) both A and ¬A should be accepted without thereby accepting any proposition B whatsoever. Hence, reasoning within their system intends to mirror, and thus, should be constrained by, the way in which we reason (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  29. added 2018-11-04
    Credence for Epistemic Discourse.Paolo Santorio - manuscript
    Many recent theories of epistemic discourse exploit an informational notion of consequence, i.e. a notion that defines entailment as preservation of support by an information state. This paper investigates how informational consequence fits with probabilistic reasoning. I raise two problems. First, all informational inferences that are not also classical inferences are, intuitively, probabilistically invalid. Second, all these inferences can be exploited, in a systematic way, to generate triviality results. The informational theorist is left with two options, both of them radical: (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. added 2018-10-31
    One's Modus Ponens: Modality, Coherence and Logic.Una Stojnić - 2017 - Philosophy and Phenomenological Research 95 (1):167-214.
    Recently, there has been a shift away from traditional truth-conditional accounts of meaning towards non-truth-conditional ones, e.g., expressivism, relativism and certain forms of dynamic semantics. Fueling this trend is some puzzling behavior of modal discourse. One particularly surprising manifestation of such behavior is the alleged failure of some of the most entrenched classical rules of inference; viz., modus ponens and modus tollens. These revisionary, non-truth-conditional accounts tout these failures, and the alleged tension between the behavior of modal vocabulary and classical (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  31. added 2018-10-16
    On Stalnaker's "Indicative Conditionals".Fabrizio Cariani - forthcoming - In Louise McNally, Yael Sharvit & Zoltan Szabo (eds.), Studies in Linguistics and Philosophy, Vol 100. Springer.
    This paper is a guide to the main ideas and innovations in Robert Stalnaker's "Indicative Conditionals". The paper is for a volume of essays on twenty-one classics of formal semantics edited by Louise McNally, Yael Sharvit and Zoltàn Gendler Szabò.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  32. added 2018-10-03
    A Recovery Operator for Nontransitive Approaches.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - forthcoming - Review of Symbolic Logic:1-25.
    In some recent papers, Cobreros, Egré, Ripley and van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a non-transitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. added 2018-10-03
    Substructural Logics, Pluralism and Collapse.Eduardo Alejandro Barrio, Federico Pailos & Damian Szmuc - forthcoming - Synthese:1-17.
    When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  34. added 2018-10-03
    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   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. added 2018-08-26
    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   Download  
     
    Export citation  
     
    Bookmark  
  36. added 2018-08-16
    An Epistemic Interpretation of Paraconsistent Weak Kleene Logic.Damian E. Szmuc - forthcoming - Logic and Logical Philosophy:1.
    This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. added 2018-08-10
    Paradoxes of Demonstrability.Sten Lindström - 2009 - In Lars-Göran Johansson, Jan Österberg & Ryszard Sliwinski (eds.), Logic, Ethics and all that Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala, Sverige: pp. 177-185.
    In this paper I consider two paradoxes that arise in connection with the concept of demonstrability, or absolute provability. I assume—for the sake of the argument—that there is an intuitive notion of demonstrability, which should not be conflated with the concept of formal deducibility in a (formal) system or the relativized concept of provability from certain axioms. Demonstrability is an epistemic concept: the rough idea is that a sentence is demonstrable if it is provable from knowable basic (“self-evident”) premises by (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  38. added 2018-08-09
    Faithfulness for Naive Validity.Ulf Hlobil - forthcoming - Synthese.
    Nontransitive responses to the validity Curry paradox face a dilemma that was recently formulated by Barrio, Rosenblatt and Tajer. It seems that, in the nontransitive logic ST enriched with a validity predicate, either you cannot prove that all derivable metarules preserve validity, or you can prove that instances of Cut that are not admissible in the logic preserve validity. I respond on behalf of the nontransitive approach. The paper argues, first, that we should reject the detachment principle for naive validity. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. added 2018-08-09
    Logic for Exact Entailment.Kit Fine & Mark Jago - 2018 - Review of Symbolic Logic:1-21.
    An exact truthmaker for A is a state which, as well as guaranteeing A’s truth, is wholly relevant to it. States with parts irrelevant to whether A is true do not count as exact truthmakers for A. Giving semantics in this way produces a very unusual consequence relation, on which conjunctions do not entail their conjuncts. This feature makes the resulting logic highly unusual. In this paper, we set out formal semantics for exact truthmaking and characterise the resulting notion of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  40. added 2018-08-06
    Rejection in Łukasiewicz's and Słupecki's Sense.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: pp. 575-597.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. added 2018-07-25
    A Note on Carnap’s Result and the Connectives.Tristan Haze - 2019 - Axiomathes 29 (3):285-288.
    Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and I demonstrate (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. added 2018-06-13
    Token-Reflexivity and Repetition.Alexandru Radulescu - 2018 - Ergo: An Open Access Journal of Philosophy 5:745-763.
    The classical rule of Repetition says that if you take any sentence as a premise, and repeat it as a conclusion, you have a valid argument. It's a very basic rule of logic, and many other rules depend on the guarantee that repeating a sentence, or really, any expression, guarantees sameness of referent, or semantic value. However, Repetition fails for token-reflexive expressions. In this paper, I offer three ways that one might replace Repetition, and still keep an interesting notion of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  43. added 2018-05-30
    (Master Thesis) Of Madness and Many-Valuedness: An Investigation Into Suszko's Thesis.Sanderson Molick - 2015 - Dissertation, UFRN
    Suszko’s Thesis is a philosophical claim regarding the nature of many-valuedness. It was formulated by the Polish logician Roman Suszko during the middle 70s and states the existence of “only but two truth values”. The thesis is a reaction against the notion of many-valuedness conceived by Jan Łukasiewicz. Reputed as one of the modern founders of many-valued logics, Łukasiewicz considered a third undeter- mined value in addition to the traditional Fregean values of Truth and Falsehood. For Łukasiewicz, his third value (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  44. added 2018-05-23
    The Formal-Structural View Of Logical Consequence.Gila Sher - 2001 - Philosophical Review 110 (2):241-261.
    This paper offers a response to William’s Hanson’s criticism of Sher’s formal-structural conception of logical consequence and logical constants.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  45. added 2018-04-21
    A General Tableau Method for Propositional Interval Temporal Logics: Theory and Implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). It combines (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  46. added 2018-04-21
    The Basic Algebra of Game Equivalences.Valentin Goranko - 2003 - Studia Logica 75 (2):221-238.
    We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities. En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways game identities into modal formulae. The completeness proof is based on reduction of game terms to a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  47. added 2018-04-21
    Modal Logics for Parallelism, Orthogonality, and Affine Geometries.Philippe Balbiani & Valentin Goranko - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):365-397.
    We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  48. added 2018-04-21
    Refutation Systems in Modal Logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
    Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  49. added 2018-04-21
    Proving Unprovability in Some Normal Modal Logics.Valentin Goranko - 1991 - Bulletin of the Section of Logic 20 (1):23-29.
    This note considers deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula  either `  or a  (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considerations.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  50. added 2018-04-21
    The Craig Interpolation Theorem for Prepositional Logics with Strong Negation.Valentin Goranko - 1985 - Studia Logica 44 (3):291 - 317.
    This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   12 citations  
1 — 50 / 164