scientific article; zbMATH DE number 3878393
From MaRDI portal
Publication:3343471
[For the entire collection see Zbl 0545.00023.] Hier geht es um ein in Carnegie Mellon entwickeltes automatisiertes Theorembeweissystem TPS. Als formale Sprache nutzt TPS die Typentheorie mit \(\lambda\)-Notation. Es gibt eine automatische und eine interaktive Form des Systems. Als Beispiel wird der automatische Beweis des Satzes von Cantor angegeben. Der automatische TPS ist vollständig für die Logik 1. Stufe.
Recommendations
Cited in
(24)- A compact representation of proofs
- A unification algorithm for second-order monadic terms
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Unification theory
- Unification under a mixed prefix
- What holds in a context?
- Set theory for verification. I: From foundations to functions
- The foundation of a generic theorem prover
- Higher-order unification revisited: Complete sets of transformations
- TPS: A theorem-proving system for classical type theory
- Extensional higher-order paramodulation in Leo-III
- scientific article; zbMATH DE number 3170714 (Why is no real title available?)
- One method of constructing a formal system
- scientific article; zbMATH DE number 67454 (Why is no real title available?)
- Higher-order unification with dependent function types
- Automating Coherent Logic
- Set-of-support strategy for higher-order logic
- Higher-order unification, polymorphism, and subsorts
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Higher order E-unification
- Types, Tableaus and Gödel’s God in Isabelle/HOL
- Simple second-order languages for which unification is undecidable
- Improving automation for higher-order proof steps
- On connections and higher-order logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343471)