Skip to main content
SpringerLink
Log in

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

  • Published:
Studia Logica Aims and scope Submit manuscript

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 2ℵ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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Hawranek and J. Zygmunt, On the degree of complexity of sentential logics. A couple of examples. Studia Logica, vol. 40 (1981), pp. 141–153.

    Google Scholar 

  2. V. A. Jankov, Constructing a sequence of strongly independent superintuitionistic calculi. Doklady Akademii Nauk SSSR, vol. 181 (1968), pp. 33–34.

    Google Scholar 

  3. J. Łoś and R. Suszko, Remarks on sentential logics, Indagationes Mathematicae, vol. 20 (1958), pp. 177–183.

    Google Scholar 

  4. D. Prawitz and P.-E. Malmnäs, A survey of some connections between classical, intuitionistic and minimal logic, in: Contributions to mathematical logic, edited by H.A. Schmidt et al. North-Holland, Amsterdam 1968, pp. 215–229.

    Google Scholar 

  5. H. Rasiowa, An algebraic approach to non-classical logics, North-Holland, Amsterdam 1974.

    Google Scholar 

  6. M. Tokarz, A remark on maximal consequences, Bulletin of the Section of Logic, vol. 6 (1977), pp. 190–192.

    Google Scholar 

  7. P. Wojtylak, Matrix representation for structural strengthenings of a propositional logic, Studia Logica, vol. 38 (1979), pp. 263–266.

    Google Scholar 

  8. R. Wójcicki, Some remarks on the consequence operation in sentential logics, Fundamenta Mathematicae, vol. 68 (170), pp. 269–279.

  9. R. Wójcicki, Referential matrix semantics for propositional calculi, in: Logic, Methodology and Philosophy of Science VI, edited by L. J. Cohen et al., PWN and North-Holland, Warszawa-Amsterdam 1982, pp. 325–334. (See also two abstracts of this paper in Bulletin of the Section of Logic, vol 8 (1979), pp. 170–176, and vol. 9 (1980), pp. 93–95.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Logic and Methodology of Sciences, Wrocław University, Poland

    Jacek Hawranek & Jan Zygmunt

Authors
  1. Jacek Hawranek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Zygmunt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

In memory of Roman Suszko

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hawranek, J., Zygmunt, J. On the degree of complexity of sentential logics.II. An example of the logic with semi-negation. Stud Logica 43, 405–413 (1984). https://doi.org/10.1007/BF00370510

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370510

Keywords

Search

Navigation