Abstract
Two open questions in ternary Boolean algebras (Not. Amer. Math. Soc., 16, No. 4, 654 (June 1969; Bull Amer, Math. Soc., 53, No. 6, 567-572 (June 1947); Proc. Eighth Int. Sypm. on Multiple-Valued Logic, pp. 251-256) were answered with the aid of an existing automated theorem-proving program without recourse to any additional programing. The new automated theorem-proving techniques developed in answering the open questions are presented in this paper; essentially the existing theorem prover is used in a nonstandard way to seek and verify small finite models and counterexamples for a first-order axiom system. Exhibiting a model of an axiom system proves it consistent; this facility complements traditional theorem-proving methods which can only prove inconsistency. 1 figure.
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.
