Multi-valued Calculi for Logics Based on Non-determinism

Abstract Non-deterministic matrices (Nmatrices) are multiple-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. We consider two different types of semantics which are based on Nmatrices: the dynamic one and the static one (the latter is new here). We use the Rasiowa-Sikorski (R-S) decomposition methodology to get sound and complete proof systems employing finite sets of mv-signed formulas for all propositional logics based on such structures with either of the above types of semantics. Later we demonstrate how these systems can be converted into cut-free ordinary Gentzen calculi which are also sound and complete for the corresponding non-deterministic semantics. As a by-product, we get new semantic characterizations for some well-known logics (like the logic CAR from [18, 28])
Keywords No keywords specified (fix it)
Categories
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: 5,711
External links This entry has no external links. Add one.
Through your library Only published papers are available at libraries

Similar books and articles

Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

2 ( #232,684 of 551,007 )

Recent downloads (6 months)

1 ( #63,425 of 551,007 )

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.

Other forums