Abstract
The paper is concerned with propositional calculi having arbitrary modus inference operations that are analogous to the modus ponens operation. For these calculi the question on the existence and cardinality of sets of generators is examined. A criterion for propositional calculi with arbitrary modus inference operations to be finitely generated is put forward. For some calculi, the existence of a finite complete system of tautologies is shown to imply the existence of a basis of arbitrarily large finite cardinality. We show the existence of propositional calculi with countable basis, without any basis, and calculi having a complete subsystem without any basis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
