Generation and verification of finite models and counterexamples using an automated theorem prover answering two open questions
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.
- Research Organization:
- Argonne National Lab., IL (USA)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6416263
- Report Number(s):
- CONF-790230--1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Automatic proofs and counterexamples for some ortholattice identities.
A counterexample to theorems of Cox and Fine