On the degree of complexity of sentential logics.II. An example of the logic with semi-negation

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


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.



    Upload a copy of this work     Papers currently archived: 79,702

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

27 (#446,832)

6 months
1 (#479,744)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jan Zygmunt
University of Wroclaw

References found in this work

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