A Formula-Preferential Base for Paraconsistent and Plausible Reasoning Systems

in models. We show that these natural preferential In the research on paraconsistency, preferential systems systems that were originally designed for paraconwere used for constructing logics which are paraconsistent sistent reasoning fulfill a key condition (stopperedbut stronger than substructural paraconsistent logics. The ness or smoothness) from the theoretical research preferences in these systems were defined in different ways. of nonmonotonic reasoning. Consequently, the Some were based on checking which abnormal formulas nonmonotonic consequence relations that they in-
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 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: 12,047
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

Monthly downloads

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

Added to index


Total downloads

1 ( #458,880 of 1,101,725 )

Recent downloads (6 months)


How can I increase my downloads?

My notes
Sign in to use this feature

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