Abstract
A formalization of the tautology problem in terms of matrices is given. From that a generalized matrix reduction method is derived. Its application to a couple of selected examples indicates a relatively efficient behaviour in testing the validity of a given formula in propositional logic—not only for machines but also for humans. A further result from that formalization is a reduction of the tautology problem to a part of Presburger arithmetic which involves formulas of the ∀∃∃⋯∃-type where all quantifiers have finite range.
Sign-in/Register to access full text options 
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.
