Skip to main content
Log in

Finite structural axiomatization of every finite-valued propositional calculus

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In [2] A. Wroński proved that there is a strongly finite consequence C which is not finitely based i.e. for every consequence C + determined by a finite set of standard rules C ≠ C +. In this paper it will be proved that for every strongly finite consequence C there is a consequence C + determined by a finite set of structural rules such that C(Ø)=C +(Ø) and \(\bar C\)=\(\bar C\) (where \(\bar C\), \(\bar C\) are consequences obtained by adding to the rules of C, C + respectively the rule of substitution). Moreover it will be shown that under certain assumptions C=C +.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Wójcicki, Strongly finite sentential calculi, in: Selected Papers on Lukasiewicz Sentential Calculi, Wrocław, 1977.

  2. A. Wroński, On finitely based consequence operations, Studia Logica 35 (1976), pp. 453–458.

    Google Scholar 

  3. A. Wroński, On the depth of a consequence operation, Bulletin of the Section of Logic, Vol. 6, No. 3 (1977), pp. 96–101.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dywan, Z. Finite structural axiomatization of every finite-valued propositional calculus. Stud Logica 39, 1–4 (1980). https://doi.org/10.1007/BF00373093

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation