Switch to: Citations

Add references

You must login to add references.
  1. Beginning Logic.Sarah Stebbins - 1965 - London, England: Hackett Publishing.
    "One of the most careful and intensive among the introductory texts that can be used with a wide range of students. It builds remarkably sophisticated technical skills, a good sense of the nature of a formal system, and a solid and extensive background for more advanced work in logic.... The emphasis throughout is on natural deduction derivations, and the text's deductive systems are its greatest strength. Lemmon's unusual procedure of presenting derivations before truth tables is very effective." --Sarah Stebbins, The (...)
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Curry’s Paradox.Robert K. Meyer, Richard Routley & J. Michael Dunn - 1979 - Analysis 39 (3):124 - 128.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
    This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.
    Download  
     
    Export citation  
     
    Bookmark   348 citations  
  • Naïve comprehension and contracting implications.Susan Rogerson & Sam Butchart - 2002 - Studia Logica 71 (1):119-132.
    In his paper [6], Greg Restall conjectured that a logic supports a naïve comprehension scheme if and only if it is robustly contraction free, that is, if and only if no contracting connective is definable in terms of the primitive connectives of the logic. In this paper, we present infinitely many counterexamples to Restall''s conjecture, in the form of purely implicational logics which are robustly contraction free, but which trivialize naïve comprehension.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Routes to triviality.Susan Rogerson & Greg Restall - 2004 - Journal of Philosophical Logic 33 (4):421-436.
    It is known that a number of inference principles can be used to trivialise the axioms of naïve comprehension - the axioms underlying the naïve theory of sets. In this paper we systematise and extend these known results, to provide a number of general classes of axioms responsible for trivialising naïve comprehension.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • How to be R eally Contraction-Free.Greg Restall - 1993 - Studia Logica 52 (3):381 - 391.
    A logic is said to be contraction free if the rule from A→(A→B) to A→B is not truth preserving. It is well known that a logic has to be contraction free for it to support a non-trivial naïve theory of sets or of truth. What is not so well known is that if there is another contracting implication expressible in the language, the logic still cannot support such a naïve theory. A logic is said to be robustly contraction free if (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Curry's paradox and 3-valued logic.A. N. Prior - 1955 - Australasian Journal of Philosophy 33 (3):177 – 182.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Contra-classical logics.Lloyd Humberstone - 2000 - Australasian Journal of Philosophy 78 (4):438 – 474.
    Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...)
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • A method for avoiding the Curry paradox.Frederic B. Fitch - 1970 - In Carl G. Hempel, Donald Davidson & Nicholas Rescher (eds.), Essays in honor of Carl G. Hempel. Dordrecht,: D. Reidel. pp. 255--265.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Logical paradoxes for many-valued systems.Moh Shaw-Kwei - 1954 - Journal of Symbolic Logic 19 (1):37-40.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Curry's paradox.Robert K. Meyer & Alonso Church - 1979 - Analysis 39 (3):124-128.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Curry's paradox in contractionless constructive logic.Akama Seiki - 1996 - Journal of Philosophical Logic 25 (2):135 - 150.
    We propose contractionless constructive logic which is obtained from Nelson's constructive logic by deleting contractions. We discuss the consistency of a naive set theory based on the proposed logic in relation to Curry's paradox. The philosophical significance of contractionless constructive logic is also argued in comparison with Fitch's and Prawitz's systems.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Four Paradoxes.J. F. A. K. Van Benthem - 1978 - Journal of Philosophical Logic 7 (1):49-72.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Proof and Paradox.Neil Tennant - 1982 - Dialectica 36 (2‐3):265-296.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • On Paradox without Self-Reference.Neil Tennant - 1995 - Analysis 55 (3):199 - 207.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Symbolic logic.Frederic Brenton Fitch - 1952 - New York,: Ronald Press Co..
    Download  
     
    Export citation  
     
    Bookmark   84 citations  
  • Four paradoxes.J. F. A. K. Benthem - 1978 - Journal of Philosophical Logic 7 (1):49 - 72.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Peirced clean through.Robert K. Meyer - 1990 - Bulletin of the Section of Logic 19 (3):100-101.
    Download  
     
    Export citation  
     
    Bookmark   3 citations