论文信息 - Quantification in Nqthm: A Recognizer and Some Constructive Implementations

Quantification in Nqthm: A Recognizer and Some Constructive Implementations

Abstract : We present an implementation of a recognizer for quantified notions in the Boyer-Moore Theorem Prover, Nqthm. That is, we provide a method for checking that a given function does indeed represent a quantified notion. We also present methods for generating constructively-presented functions that represent quantified notions, including definitions using only bounded quantifiers.

Matt Kaufmann | Matt Kaufmann

[1] Robert S. Boyer,et al. A computational logic handbook , 1979, Perspectives in computing.

[2] Matt Kaufmann. An Interactive Enhancement to the Boyer-Moore Theorem Prover , 1988, CADE.

[3] Robert S. Boyer,et al. A Theorem Prover for a Computational Logic , 1990, CADE.

[4] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.

[5] Vladimir Lifschitz,et al. Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy , 1991 .

[6] Robert S. Boyer,et al. Functional Instantiation in First-Order Logic , 1991, Artificial and Mathematical Theory of Computation.