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

In this paper, being a sequel to Part I [ibid. 40, 141-153 (1981; Zbl 0484.03011)], 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 \(2^{\aleph_ 0}\). 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.