Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs

@inproceedings{Miller1984ExpansionTP,
  title={Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs},
  author={Dale Miller},
  booktitle={CADE},
  year={1984}
}
We present a new form of Herbrand's theorem which is centered around structures called expansion trees. Such trees contains substitution formulas and selected (critical) variables at various non-terminal nodes. These trees encode a shallow formula and a deep formula the latter containing the formulas which label the terminal nodes of the expansion tree. If a certain relation among the selected variables of an expansion tree is acyclic and if the deep formula of the tree is tautologous, then we… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Andrews , " Resolution in Type Theory

  • B. Peter
  • 1971

A proof of cutelimination theorem in simple typetheory

  • Patrick Suppes
  • Journal of the Mathematical Society of Japan
  • 1957

Mechanizing wOrder Type Theory Through Unification

  • T. Pietrzykowski

Similar Papers

Loading similar papers…