Studia Logica 43 (4):405 - 413 (1984)

Abstract
In this paper being a sequel to our [1] the logic with semi-negation is chosen as an example to elucidate some basic notions of the semantics for sentential calculi. E.g., there are shown some links between the Post number and the degree of complexity of a sentential logic, and it is proved that the degree of complexity of the sentential logic with semi-negation is 20. This is the first known example of a logic with such a degree of complexity. The results of the final part of the paper cast a new light on the scope of the Kripke-style semantics in comparison to the matrix semantics.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370510
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


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

An Algebraic Approach to Non-Classical Logics.Helena Rasiowa - 1974 - Amsterdam, Netherlands: Warszawa, Pwn - Polish Scientific Publishers.
A Remark On Maximal Matrix Consequences.Marek Tokarz - 1977 - Bulletin of the Section of Logic 6 (4):190-191.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
26 ( #423,817 of 2,456,096 )

Recent downloads (6 months)
1 ( #449,533 of 2,456,096 )

How can I increase my downloads?

Downloads

My notes