请输入您要查询的字词:

 

单词 Gödel’s Completeness Theorem
释义
Gödel’s Completeness Theorem

Mathematics
  • The theorem which states that in mathematical logic, if a formula is logically valid, then there is a finite formal proof of the formula based on the axioms of the system—something that a computer could be programmed to do. This is important in its own right but is perhaps even more important as the precursor to Gödel’s Incompleteness Theorems.


随便看

 

科学参考收录了60776条科技类词条,基本涵盖了常见科技类参考文献及英语词汇的翻译,是科学学习和研究的有利工具。

 

Copyright © 2000-2023 Sciref.net All Rights Reserved
京ICP备2021023879号 更新时间:2024/12/26 4:05:21