David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 52 (1):113 - 142 (1993)
This essay demonstrates proof-theoretically the consistency of a type-free theoryC with an unrestricted principle of comprehension and based on a predicate logic in which contraction (A (A B)) (A B), although it cannot holds in general, is provable for a wide range ofA's.C is presented as an axiomatic theoryCH (with a natural-deduction equivalentCS) as a finitary system, without formulas of infinite length. ThenCH is proved simply consistent by passing to a Gentzen-style natural-deduction systemCG that allows countably infinite conjunctions and in which all theorems ofCH are provable.CG is seen to be a consistent by a normalization argument. It also shown that in a senseC is highly non-extensional.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
Dag Prawitz (1965/2006). Natural Deduction: A Proof-Theoretical Study. Dover Publications.
Patrick Suppes (1957/1999). Introduction to Logic. Dover Publications.
Bruce White (1974). A Note on Natural Deduction in Many-Valued Logic. Notre Dame Journal of Formal Logic 15 (1):167-168.
Citations of this work BETA
No citations found.
Similar books and articles
Sven Ove Hansson (1994). Kernel Contraction. Journal of Symbolic Logic 59 (3):845-859.
Andreja Prijatelj (1996). Bounded Contraction and Gentzen-Style Formulation of Łukasiewicz Logics. Studia Logica 57 (2-3):437 - 456.
A. Avron (1998). Formulas for Which Contraction is Admissible. Logic Journal of the Igpl 6 (1):43-48.
Sara Negri & Jan von Plato (2001). Sequent Calculus in Natural Deduction Style. Journal of Symbolic Logic 66 (4):1803-1816.
Raghav Ramachandran, Abhaya C. Nayak & Mehmet A. Orgun (2012). Three Approaches to Iterated Belief Contraction. Journal of Philosophical Logic 41 (1):115-142.
Carlos E. Alchourrón & David Makinson (1985). On the Logic of Theory Change: Safe Contraction. Studia Logica 44 (4):405 - 422.
Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
Uwe Petersen (2000). Logic Without Contraction as Based on Inclusion and Unrestricted Abstraction. Studia Logica 64 (3):365-403.
Jun Li (1998). A Note on Partial Meet Package Contraction. Journal of Logic, Language and Information 7 (2):139-142.
Greg Restall (1993). How to Bereally Contraction Free. Studia Logica 52 (3):381 - 391.
Added to index2009-01-28
Total downloads8 ( #198,838 of 1,692,221 )
Recent downloads (6 months)1 ( #184,284 of 1,692,221 )
How can I increase my downloads?