Proving Ramsey's theory by the cover set induction: A case and comparision study.

DOI10.1007/BF01530799zbMath1034.68545OpenAlexW2038861555MaRDI QIDQ1353938

Gary Xin Hua, Han-Tao Zhang

Publication date: 12 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530799

zbMATH Keywords

algebraic specification

Mathematics Subject Classification ID

Uses Software

• Nuprl
• NQTHM
• RRL

Cites Work

• On sufficient-completeness and related properties of term rewriting systems
• Proof by consistency
• Termination of rewriting
• Automatic proofs by induction in theories without constructors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proving Ramsey's theory by the cover set induction: A case and comparision study.