An Elementary Proof of the Characterization Theorem for Conjunctive Multiple-Conclusion Consequence Relations
DOI:
https://doi.org/10.18778/0138-0680.2026.03Keywords:
multiple-conclusion consequence relation, conjunctive set of conclusions, characterization theoremAbstract
We give a characterization theorem for multiple-conclusion consequence relations with the conjunctive reading of conclusions. As in the case of disjunctive multiple-conclusion consequence relations, we define consequence relations in terms of sets of two-set partitions of formulae. We see that a binary relation between sets of formulae is a conjunctive multiple-conclusion consequence relation if it is closed under the properties of inclusion, transitivity and reducibility. To prove this result we use only the definition and some basic properties of conjunctive multiple-conclusion consequence relations.
References
M. Nowak, A Syntactic Approach to Closure Operation, Bulletin of the Section of Logic, vol. 46(3/4) (2017), pp. 219–232, DOI: https://doi.org/10.18778/0138-0680.46.3.4.04.
M. Nowak, Disjunctive and Conjunctive Multiple-Conclusion Consequence Relations, Studia Logica, vol. 108 (2020), pp. 1125–1143, DOI: https://doi.org/10.1007/s11225-019-09889-8.
D. J. Shoesmith, T. J. Smiley, Multiple-Conclusion Logic, Cambridge University Press, Cambridge (1978).
Z. Šikić, A Proof of the Characterization Theorem for Consequence Relations,Mathematical Logic Quarterly, vol. 37(2–4) (1991), pp. 41–43, DOI: https://doi.org/10.1002/malq.19910370205.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
How to Cite
Funding data
-
Anadolu Üniversitesi
Grant numbers SBA-2024-2676




