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.
Similar content being viewed by others
References
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.
M. Porębska, A. Wroński,A. characterization of fragments of the intuitionistic propositional logic,Reports on Mathematical Logic 4 (1975), pp. 39–42.
R. E. Tax,On the intuitionistic equivalential calculus,Notre Dame Journal of Formal Logic 14 (1973), pp. 448–456.
Author information
Authors and Affiliations
Additional information
To the memory of Professor Roman Suszko
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01837555