This is a preview of subscription content, log in via an institution to check access.
References
Bevier, W. R., A library for hardware verification, Internal Note 57, Computational Logic, Inc., June 1988.
Bevier, W. R., and Young, W. D., The proof of correctness of a fault-tolerant circuit design. Proc. Second Internat. Working Conference on Dependable Computing for Critical Applications, February, 1991, pp. 107–114.
Boyer, R. S., and Moore, J S., A Computational Logic, Academic Press, New York, 1979.
Boyer, R. S., and Moore, J S., A Computational Logic Handbook, Academic Press, Boston, 1988.
Goldschlag, David M., Mechanizing unity, in Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, (M. Broy and C. B. Jones, eds.), Elsevier Science Publishers, Amsterdam, 1990.
Graham, R. L., Knuth, D. E., and Patashnik, O., Concrete Mathematics, Addison-Wesley, New York, 1988.
Kaufmann, Matthew, and Wilding, Matthew, A DISABLEDP hash table patch for PC-NQTHM, Internal Note 198, Computational Logic, Inc., September 1990.
Kaufmann, Matthew, An integer library for NQTHM, Internal Note 182, Computational Logic, Inc., 1990.
Kaufmann, Matthew, A user's manual for an interactive enhancement to the Boyer-Moore theorem prover, Technical Report 19, Computational Logic, Inc., May 1988.
Wilding, Matthew, A mechanically-checked correctness proof of a floating-point search program, Technical Report 56, Computational Logic, Inc., May 1990.
Wilding, Matthew, Events for the proof of rational facts needed in a distributed algorithm correctness proof, Internal Note 222, Computational Logic, Inc., March 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilding, M. Proving Matijasevich's lemma with a default arithmetic strategy. J Autom Reasoning 7, 439–446 (1991). https://doi.org/10.1007/BF00249024
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00249024