Skip to main content
Log in

On the {↔, ∼} -reduct of the intuitionistic consequence operation

Studia Logica Aims and scope Submit manuscript

Abstract

The intuitionistic consequence operation restricted to the language with ↔ (equivalence) and ∼ (negation) as the only connectives is axiomatized by means of a finite set of sequential rules of inference.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. K. Kabziński, A. Wroński,On equivalential algebras, Proceedings of 1975 International Symposium on Multiple-Valued Logics, Indiana University, Bloomington, May 13–16, 1975, pp. 419–428.

    Google Scholar 

  2. M. Porębska, A. Wroński,A. characterization of fragments of the intuitionistic propositional logic,Reports on Mathematical Logic 4 (1975), pp. 39–42.

    Google Scholar 

  3. R. E. Tax,On the intuitionistic equivalential calculus,Notre Dame Journal of Formal Logic 14 (1973), pp. 448–456.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

To the memory of Professor Roman Suszko

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kabziński, J.K., Porębska, M. & Wroński, A. On the {↔, ∼} -reduct of the intuitionistic consequence operation. Stud Logica 40, 55–66 (1981). https://doi.org/10.1007/BF01837555

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation