View topic on PhilPapers for more information
Related categories

149 found
Order:
More results on PhilPapers
1 — 50 / 149
  1. added 2019-03-23
    Philosophy of Logic – Reexamining the Formalized Notion of Truth.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  
  2. 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  
  3. 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  
  4. 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  
  5. 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   1 citation  
  6. 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  
  7. 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  
  8. added 2019-01-17
    Metalogic and the Overgeneration Argument.Salvatore Florio & Luca Incurvati - 2019 - Mind:1-33.
    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  
  9. 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  
  10. 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  
  11. 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  
  12. 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  
  13. 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  
  14. 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  
  15. 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  
  16. 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  
  17. 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  
  18. added 2018-08-16
    An Epistemic Interpretation of Paraconsistent Weak Kleene Logic.Damian Szmuc - forthcoming - Logic and Logical Philosophy.
    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  
  19. 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  
  20. 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  
  21. added 2018-08-09
    Logic for Exact Entailment.Kit Fine & Mark Jago - 2018 - Review of Symbolic Logic.
    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  
  22. 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  
  23. added 2018-07-25
    A Note on Carnap’s Result and the Connectives.Tristan Haze - forthcoming - Axiomathes 28:1-4.
    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  
  24. 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  
  25. 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  
  26. 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  
  27. 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   3 citations  
  28. 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   2 citations  
  29. 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  
  30. 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   2 citations  
  31. 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   1 citation  
  32. 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  
  33. added 2018-04-13
    Conjunction and Disjunction in Infectious Logics.Hitoshi Omori & Damian Szmuc - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction: 6th International Workshop. 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   Download  
     
    Export citation  
     
    Bookmark  
  34. added 2018-04-07
    A Model-Theoretic Analysis of Fidel-Structures for mbC.Marcelo E. Coniglio - forthcoming - In Can Baskent and Thomas Ferguson (ed.), Graham Priest on Dialetheism and Paraconsistency. Springer.
    In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  35. added 2018-03-09
    Defining Textual Entailment.Daniel Z. Korman, Eric Mack, Jacob Jett & Allen H. Renear - forthcoming - Journal of the Association for Information Science and Technology.
    Textual entailment is a relationship that obtains between fragments of text when one fragment in some sense implies the other fragment. The automation of textual entailment recognition supports a wide variety of text-based tasks, including information retrieval, information extraction, question answering, text summarization, and machine translation. Much ingenuity has been devoted to developing algorithms for identifying textual entailments, but relatively little to saying what textual entailment actually is. This article is a review of the logical and philosophical issues involved in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  36. added 2018-03-06
    Gómez-Torrente on Modality and Tarskian Logical Consequence.Manuel García-Carpintero - 2010 - Theoria : An International Journal for Theory, History and Fundations of Science 18 (2):159-170.
    Gómez-Torrente’s papers have made important contributions to vindicate Tarski’s model-theoretic account of the logical properties in the face of Etchemendy’s criticisms. However, at some points his vindication depends on interpreting the Tarskian account as purportedly modally deflationary, i.e., as not intended to capture the intuitive modal element in the logical properties, that logical consequence is (epistemic or alethic) necessary truth-preservation. Here it is argued that the views expressed in Tarski’s seminal work do not support this modally deflationary interpretation, even if (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. added 2018-02-19
    Defining a Decidability Decider.Pete Olcott - manuscript
    By extending the notion of a Well Formed Formula to include syntactically formalized rules for rejecting semantically incorrect expressions we recognize and reject expressions that have the semantic error of Pathological self-reference(Olcott 2004). The foundation of this system requires the notion of a BaseFact that anchors the semantic notions of True and False. When-so-ever a formal proof from BaseFacts of language L to a closed WFF X or ~X of language L does not exist X is decided to be semantically (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  38. added 2018-02-17
    Reasoning From Paradigms and Negative Evidence.Fabrizio Macagno & Douglas N. Walton - 2011 - Pragmatics and Cognitionpragmatics and Cognition 19 (1):92-116.
    Reasoning from negative evidence takes place where an expected outcome is tested for, and when it is not found, a conclusion is drawn based on the significance of the failure to find it. By using Gricean maxims and implicatures, we show how a set of alternatives, which we call a paradigm, provides the deep inferential structure on which reasoning from lack of evidence is based. We show that the strength of reasoning from negative evidence depends on how the arguer defines (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  39. added 2018-02-13
    The Cut‐Free Approach and the Admissibility‐Curry.Ulf Hlobil - 2018 - Thought: A Journal of Philosophy 7 (1):40-48.
    The perhaps most important criticism of the nontransitive approach to semantic paradoxes is that it cannot truthfully express exactly which metarules preserve validity. I argue that this criticism overlooks that the admissibility of metarules cannot be expressed in any logic that allows us to formulate validity-Curry sentences and that is formulated in a classical metalanguage. Hence, the criticism applies to all approaches that do their metatheory in classical logic. If we do the metatheory of nontransitive logics in a nontransitive logic, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. added 2018-02-03
    A Puzzle About Inferential Strength and Probability.Alexander Hughes - manuscript
    Inductive logic would be the logic of arguments that are not valid, but nevertheless justify belief in something like the way in which valid arguments would. Maybe we could describe it as the logic of “almost valid” arguments. There is a sort of transitivity to valid arguments. Valid arguments can be chained together to form arguments and such arguments are themselves valid. One wants to distinguish the “almost valid” arguments by noting that chains of “almost valid” arguments are weaker than (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. added 2018-01-16
    Choosing Your Nonmonotonic Logic: A Shopper’s Guide.Ulf Hlobil - 2018 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2017. London: College Publications. pp. 109-123.
    The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  42. added 2018-01-13
    Logical Model of Personality and Cognition with Possible Applications.Miro Brada - 2016 - In Woosuk Park (ed.), KAIST/KSBS International Workshop. Daejeon: KAIST. pp. 89-100.
    Although the cognition is significant in strategic reasoning, its role has been weakly analyzed, because only the average intelligence is usually considered. For example, prisoner's dilemma in game theory, would have different outcomes for persons with different intelligence. I show how various levels of intelligence influence the quality of reasoning, decision, or the probability of psychosis. I explain my original methodology developed for my MA thesis in clinical psychology in 1998, and grant research in 1999, demonstrating the bias of the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  43. added 2017-12-06
    A Quantitative-Informational Approach to Logical Consequence.Marcos Antonio Alves & Ítala M. Loffredo D'Otaviano - 2015 - In Jean-Yves Beziau (ed.), The Road to Universal Logic (Studies in Universal Logic). Switzerland: Springer International Publishing. pp. 105-24.
    In this work, we propose a definition of logical consequence based on the relation between the quantity of information present in a particular set of formulae and a particular formula. As a starting point, we use Shannon‟s quantitative notion of information, founded on the concepts of logarithmic function and probability value. We first consider some of the basic elements of an axiomatic probability theory, and then construct a probabilistic semantics for languages of classical propositional logic. We define the quantity of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  44. added 2017-12-01
    The Eightfold Way: Why Analyticity, Apriority and Necessity Are Independent.Douglas Ian Campbell - 2017 - Philosophers' Imprint 17:1-17.
    This paper concerns the three great modal dichotomies: (i) the necessary/contingent dichotomy; (ii) the a priori/empirical dichotomy; and (iii) the analytic/synthetic dichotomy. These can be combined to produce a tri-dichotomy of eight modal categories. The question as to which of the eight categories house statements and which do not is a pivotal battleground in the history of analytic philosophy, with key protagonists including Descartes, Hume, Kant, Kripke, Putnam and Kaplan. All parties to the debate have accepted that some categories are (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  45. added 2017-11-02
    Conditional Heresies.Fabrizio Cariani & Simon Goldstein - forthcoming - Philosophy and Phenomenological Research.
    The principles of Conditional Excluded Middle (CEM) and Simplification of Disjunctive Antecedents (SDA) have received substantial attention in isolation. Both principles are plausible generalizations about natural language conditionals. There is however little or no discussion of their inter- action. This paper aims to remedy this gap and explore the significance of having both principles constrain the logic of the conditional. Our negative finding is that, together with elementary logical assumptions, CEM and SDA yield a variety of implausible consequences. Despite these (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  46. added 2017-10-14
    What Do Paraconsistent, Undecidable, Random, Computable and Incomplete Mean? A Review of Godel's Way: Exploits Into an Undecidable World by Gregory Chaitin, Francisco A Doria , Newton C.A. Da Costa 160p (2012).Michael Starks - 2017 - Philosophy, Human Nature and the Collapse of Civilization -- Articles and Reviews 2006-2017 3rd Ed 686p(2017).
    In ‘Godel’s Way’ three eminent scientists discuss issues such as undecidability, incompleteness, randomness, computability and paraconsistency. I approach these issues from the Wittgensteinian viewpoint that there are two basic issues which have completely different solutions. There are the scientific or empirical issues, which are facts about the world that need to be investigated observationally and philosophical issues as to how language can be used intelligibly (which include certain questions in mathematics and logic), which need to be decided by looking at (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  47. added 2017-09-08
    A Decision Procedure for Herbrand Formulas Without Skolemization.Timm Lampert - manuscript
    This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  48. added 2017-07-20
    Revisiting Dummett's Proof-Theoretic Justification Procedures.Hermógenes Oliveira - 2017 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2016. London: College Publications. pp. 141-155.
    Dummett’s justification procedures are revisited. They are used as background for the discussion of some conceptual and technical issues in proof-theoretic semantics, especially the role played by assumptions in proof-theoretic definitions of validity.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  49. added 2017-07-10
    Rivalry, Normativity, and the Collapse of Logical Pluralism.Erik Stei - 2017 - Inquiry: An Interdisciplinary Journal of Philosophy:1-22.
    Logical pluralism is the view that there is more than one correct logic. This very general characterization gives rise to a whole family of positions. I argue that not all of them are stable. The main argument in the paper is inspired by considerations known as the “collapse problem”, and it aims at the most popular form of logical pluralism advocated by JC Beall and Greg Restall. I argue that there is a more general argument available that challenges all variants (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  50. added 2017-07-01
    When Structural Principles Hold Merely Locally.Ulf Hlobil - 2017 - In Pavel Arazim & Tomáš Lávička (eds.), The Logica Yearbook 2016. London: College Publications. pp. 53-67.
    In substructural logics, structural principles may hold in some fragments of a consequence relation without holding globally. I look at this phenomenon in my preferred substructural logic, in which Weakening and Cut fail but which is supra-intuitionistic. I introduce object language operators that keep track of the admissibility of Weakening and of intuitionistic implications. I end with some ideas about local transitivity.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 149