The TPS Theorem Proving System
نویسندگان
چکیده
When one is seeking an expansion proof for a theorem of higher-order logic, not all necessary substitution terms can be generated by unification of formulas already present, so certain expansion options [5] are applied, and then a search for a p-acceptable mating [2] is made, using Huet's higher-order unification algorithm [8] to generate all remaining substitution terms. The expansion options consist of quantifier duplications and projective and primitive substitutions (such as
منابع مشابه
TPS: An Interactive and Automatic Tool for Proving Theorems of Type Theory
This is a demonstration of TPS, a theorem proving system for classical type theory (Church’s typed λ-calculus). TPS can be used interactively or automatically, or in a combination of these modes. An important feature of TPS is the ability to translate between expansion proofs and natural deduction proofs. CATEGORY: Demonstration
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملIntegrating Tps with mega
We report on the integration of Tps as an external reasoning component into the mathematical assistant system mega. Thereby Tps can be used both as an automatic theorem prover for higher order logic as well as interactively employed from within the mega environment. Tps proofs can be directly incorporated into mega on a tactic level enabling their visualization and verbalization. Using an examp...
متن کاملIntegrating Tps and Omega
This paper reports on the integration of the higher-order theorem proving environment Tps [Andrews et al., 1996] into the mathematical assistant mega [Benzm uller et al., 1997]. Tps can be called from mega either as a black box or as an interactive system. In black box mode, the user has control over the parameters which control proof search inTps; in interactive mode, all features of theTps-s...
متن کاملProving Theorems of Type Theory Automatically with TPS
Reasoning plays an important role in many activities which involve intelligence, and it may be anticipated that automated reasoning will play a significant role in many applications of artificial intelligence. The importance of developing methods of automating reasoning has been recognized since the inception of research on artificial intelligence. One fruitful approach to this problem is to us...
متن کامل