Algebraiczna semantyka dla nihilistycznych rachunków zdań

Filozofia Nauki 4 (1993)

Abstract
From a formal point of view, the nihilistic propositional calculi, called in this text „npc”, are such propositional calculi that include three unary propositional conectives: T, F, ~, and one binary propositional connective ≡. They read respectively: true, false, untrue that, if and only if. Their theorems are, mong other things, such expressions as: Tp ≡ p, Fp ≡ ~p, with p being a propositional variable. The four npc are presented in this work, i.e. on two-valued, two three-valued, and one four-valued. Moreover, two of them are also paraconsistent calculi. Npc are constructed by means of the axiomatic method. Following the presentation of npc axioms, the four so called n-algebras are introduced. The npc axioms are proved to be adequate to appropriate n-algebras, i.e. sets of theorems and tautologies of each npc are identical
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Translate to english
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 58,518
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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Theorem Counting.M. G. Beavers - 1994 - Topoi 13 (1):61-65.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
A Note Concerning the Many-Valued Propositional Calculi.Bolesław Sobociński - 1961 - Notre Dame Journal of Formal Logic 2 (2):127-128.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.

Analytics

Added to PP index
2013-03-14

Total views
0

Recent downloads (6 months)
0

How can I increase my downloads?

Downloads

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

My notes