摘要
Hilbert’s complete perfect (HCP) logic is introduced. The Gdel’s incompleteness theorem discloses the limit of logic.Huang’s universal consistent theorem and relative consistent theorem extends the limit of logic.The proofs of these theorems are in 2-valued logic but the completeness can be extended in the three-valued HCP logic. The author proposes HCP logic for the foundation of uncertainty computing as well.
Hilbert＇ s complete perfect （HCP） logic is introduced. The Goedel＇ s incompleteness theorem discloses the limit of logic.Huang＇ s universal consistent theorem and relative consistent theorem extends the limit of logic. The proofs of these theorems are in 2-valued logic but the completeness can be extended in the three-valued HCP logic. The author proposes HCP logic for the foundation of uncertainty computing as well.
出处
《南昌工程学院学报》
CAS
2006年第2期36-42,共7页
Journal of Nanchang Institute of Technology
