-Compatible Transitive Extensions of System CT Logique et Analyse

Abstract
Da Costa's paraconsistent systems of the series Cm (for finite m) (see [C1], [C2], and esp. [C3], pp. 237ff.) share important features with transitive logic, TL (which has been gone into in [P1] and [P2]), namely, they all coincide in that: (c1) they possess a strong negation, `¬', a conditional, `⊃', a conjunction, `∧', and a disjunction, `∨', with respect to which they are conservative extensions of CL or Classical Logic; (c2) they possess a non strong negation, `N' (notations are different for systems C) which does not possess all properties of classical negation, but for which the following schemata are theorematic (I use the letters `p', `q', etc as schematic letters; my notational conventions are basically Church's: associativity leftwards; a dot stands for..
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 Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,826
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-03-06

Total downloads

0

Recent downloads (6 months)

0

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.