Systems with the converse Ackermann property

Theoria 1 (1):253-258 (1985)
Abstract
A system S has the “converse Ackermann property” (C.A.P.) if (A -> B) -> C is unprovable in S whenever C is a propositional variable. In this paper we define the fragments with the C.A.P. of some well-know propositional systems in the spectrum between the minimal and classical logic. In the first part we succesively study the implicative and positive fragments and the full calculi. In the second, we prove by a matrix method that each one of the systems has the C.A.P. Thus, we think the problem proposed in Anderson & Belnap (1975) § 8.12 has been solved
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: 11,361
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

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Analytics

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index

2009-01-28

Total downloads

1 ( #445,163 of 1,102,697 )

Recent downloads (6 months)

1 ( #296,698 of 1,102,697 )

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.