A consistent theory of attributes in a logic without contraction

Studia Logica 52 (1):113 - 142 (1993)
Abstract
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)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,738
External links
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
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
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

8 ( #168,351 of 1,098,785 )

Recent downloads (6 months)

4 ( #79,088 of 1,098,785 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.