Switch to: References

Add citations

You must login to add citations.
  1. Strict Fregean Free Logic.Scott Lehmann - 1994 - Journal of Philosophical Logic 23 (3):307--336.
  • Natural Deduction and Hilbert's Ɛ-Operator.Allen Hazen - 1987 - Journal of Philosophical Logic 16 (4):411 - 421.
  • Tree Proofs for Syllogistic.Peter M. Simons - 1989 - Studia Logica 48 (4):539 - 554.
    This paper presents a tree method for testing the validity of inferences, including syllogisms, in a simple term logic. The method is given in the form of an algorithm and is shown to be sound and complete with respect to the obvious denotational semantics. The primitive logical constants of the system, which is indebted to the logical works of Jevons, Brentano and Lewis Carroll, are term negation, polyadic term conjunction, and functors affirming and denying existence, and use is also made (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Concept of Relevance and the Logic Diagram Tradition.Jan Dejnožka - 2010 - Logica Universalis 4 (1):67-135.
    What is logical relevance? Anderson and Belnap say that the “modern classical tradition [,] stemming from Frege and Whitehead-Russell, gave no consideration whatsoever to the classical notion of relevance.” But just what is this classical notion? I argue that the relevance tradition is implicitly most deeply concerned with the containment of truth-grounds, less deeply with the containment of classes, and least of all with variable sharing in the Anderson–Belnap manner. Thus modern classical logicians such as Peirce, Frege, Russell, Wittgenstein, and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Relevant Analytic Tableaux.Michael A. McRobbie & Nuel D. Belnap - 1979 - Studia Logica 38 (2):187 - 200.
    Tableau formulations are given for the relevance logics E (Entailment), R (Relevant implication) and RM (Mingle). Proofs of equivalence to modus-ponens-based formulations are vialeft-handed Gentzen sequenzen-kalküle. The tableau formulations depend on a detailed analysis of the structure of tableau rules, leading to certain global requirements. Relevance is caught by the requirement that each node must be used; modality is caught by the requirement that only certain rules can cross a barrier. Open problems are discussed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Are Tableaux an Improvement on Truth-Tables?Marcello D'Agostino - 1992 - Journal of Logic, Language and Information 1 (3):235-252.
    We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • Linguistics and Psychology.Scott Soames - 1984 - Linguistics and Philosophy 7 (2):155 - 179.
  • The Logic of 'Unless'.Marthe Chandler - 1982 - Philosophical Studies 41 (3):383 - 405.
  • Proper Names as Variables.Takashi Yagisawa - 1984 - Erkenntnis 21 (2):195 - 208.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Revival of Rejective Negation.Lloyd Humberstone - 2000 - Journal of Philosophical Logic 29 (4):331-381.
    Whether assent ("acceptance") and dissent ("rejection") are thought of as speech acts or as propositional attitudes, the leading idea of rejectivism is that a grasp of the distinction between them is prior to our understanding of negation as a sentence operator, this operator then being explicable as applying to A to yield something assent to which is tantamount to dissent from A. Widely thought to have been refuted by an argument of Frege's, rejectivism has undergone something of a revival in (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  • Wittgensteinian Tableaux, Identity, and Co-Denotation.Kai F. Wehmeier - 2008 - Erkenntnis 69 (3):363-376.
    Wittgensteinian predicate logic (W-logic) is characterized by the requirement that the objects mentioned within the scope of a quantifier be excluded from the range of the associated bound variable. I present a sound and complete tableaux calculus for this logic and discuss issues of translatability between Wittgensteinian and standard predicate logic in languages with and without individual constants. A metalinguistic co-denotation predicate, akin to Frege’s triple bar of the Begriffsschrift, is introduced and used to bestow the full expressive power of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • Bochenski on Property Identity and the Refutation of Universals.Dale Jacquette - 2006 - Journal of Philosophical Logic 35 (3):293-316.
    An argument against multiply instantiable universals is considered in neglected essays by Stanislaw Lesniewski and I.M. Bochenski. Bochenski further applies Lesniewski's refutation of universals by maintaining that identity principles for individuals must be different than property identity principles. Lesniewski's argument is formalized for purposes of exact criticism and shown to involve both a hidden vicious circularity in the form of impredicative definitions and explicit self-defeating consequences. Syntactical restrictions on Leibnizian indiscernibility of identicals are recommended to forestall Lesniewski's paradox.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Non-Conditional 'If's.B. H. Slater - 1996 - Ratio 9 (1):47-55.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Normative Reference Magnets.J. Robert G. Williams - 2018 - Philosophical Review 127 (1):41-71.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Agent‐Based Computational Models and Generative Social Science.Joshua M. Epstein - 1999 - Complexity 4 (5):41-60.
  • The Uncertain Reasoner: Bayes, Logic, and Rationality.Mike Oaksford & Nick Chater - 2009 - Behavioral and Brain Sciences 32 (1):105-120.
    Human cognition requires coping with a complex and uncertain world. This suggests that dealing with uncertainty may be the central challenge for human reasoning. In Bayesian Rationality we argue that probability theory, the calculus of uncertainty, is the right framework in which to understand everyday reasoning. We also argue that probability theory explains behavior, even on experimental tasks that have been designed to probe people's logical reasoning abilities. Most commentators agree on the centrality of uncertainty; some suggest that there is (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Jean van Heijenoort’s Contributions to Proof Theory and Its History.Irving H. Anellis - 2012 - Logica Universalis 6 (3-4):411-458.
    Jean van Heijenoort was best known for his editorial work in the history of mathematical logic. I survey his contributions to model-theoretic proof theory, and in particular to the falsifiability tree method. This work of van Heijenoort’s is not widely known, and much of it remains unpublished. A complete list of van Heijenoort’s unpublished writings on tableaux methods and related work in proof theory is appended.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • Precis of the Rational Imagination: How People Create Alternatives to Reality.Ruth Mj Byrne - 2007 - Behavioral and Brain Sciences 30 (5):439-452.
    The human imagination remains one of the last uncharted terrains of the mind. People often imagine how events might have turned out something had been different. The of reality, those aspects more readily changed, indicate that counterfactual thoughts are guided by the same principles as rational thoughts. In the past, rationality and imagination have been viewed as opposites. But research has shown that rational thought is more imaginative than cognitive scientists had supposed. In The Rational Imagination, I argue that imaginative (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Routley’s Formulation of Transparency.B. H. Slater - 1992 - History and Philosophy of Logic 13 (2):215-224.
    Routley?s Formula says, for instance, that if it is believed there is a man then there is something which is believed to be a man. In this paper I defend the formula; first directly, but then by looking at work by Gensler and Hintikka against it, and at the original work of Routley, Meyer and Goddard for it. The argument ultimately reduces to a central point about the extensionality of objects in Routley, Meyer and Goddard?s intensional system, i.e. in its (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Can There Be a Proof That an Unprovable Sentence of Arithmetic is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (43):289-292.
    Various authors of logic texts are cited who either suggest or explicitly state that the Gödel incompleteness result shows that some unprovable sentence of arithmetic is true. Against this, the paper argues that the matter is one of philosophical controversy, that it is not a mathematical or logical issue.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Guest Editor’s Introduction: JvH100. [REVIEW]Irving H. Anellis - 2012 - Logica Universalis 6 (3-4):249-267.
  • In Memory of Richard Jeffrey: Some Reminiscences and Some Reflections on The Logic of Decision.Alan Hájek - 2006 - Philosophy of Science 73 (5):947-958.
    This paper is partly a tribute to Richard Jeffrey, partly a reflection on some of his writings, The Logic of Decision in particular. I begin with a brief biography and some fond reminiscences of Dick. I turn to some of the key tenets of his version of Bayesianism. All of these tenets are deployed in my discussion of his response to the St. Petersburg paradox, a notorious problem for decision theory that involves a game of infinite expectation. Prompted by that (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On a New Idiom in the Study of Entailment.R. E. Jennings, Y. Chen & J. Sahasrabudhe - 2011 - Logica Universalis 5 (1):101-113.
    This paper is an experiment in Leibnizian analysis. The reader will recall that Leibniz considered all true sentences to be analytically so. The difference, on his account, between necessary and contingent truths is that sentences reporting the former are finitely analytic; those reporting the latter require infinite analysis of which God alone is capable. On such a view at least two competing conceptions of entailment emerge. According to one, a sentence entails another when the set of atomic requirements for the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Historical Development of Modern Logic.Jean van Heijenoort - 2012 - Logica Universalis 6 (3-4):327-337.
  • Logic, Models, and Paradoxical Inferences.Isabel Orenes & P. N. Johnson-Laird - 2012 - Mind and Language 27 (4):357-377.
    People reject ‘paradoxical’ inferences, such as: Luisa didn't play music; therefore, if Luisa played soccer, then she didn't play music. For some theorists, they are invalid for everyday conditionals, but valid in logic. The theory of mental models implies that they are valid, but unacceptable because the conclusion refers to a possibility inconsistent with the premise. Hence, individuals should accept them if the conclusions refer only to possibilities consistent with the premises: Luisa didn't play soccer; therefore, if Luisa played a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  • Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (3):289-292.
  • Ross' Paradox and Well-Formed Codices.Erik Stenius - 1982 - Theoria 48 (2):49-77.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations