来自专业的译者、企业、网页和免费的翻译库。
arithmetic logic unit αριθμητική λογική μονάδα
arithmetic logic unit
最后更新: 2014-11-21
使用频率: 2
质量:
"on the foundations of logic and arithmetic," 129–38.
"on the foundations of logic and arithmetic," 129–38.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"subsystems of second order arithmetic", springer-verlag.
"subsystems of second order arithmetic", springer-verlag.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
(Δες analytical hierarchy για την ανάλογη κατασκευή του second-order arithmetic.
(see analytical hierarchy for the analogous construction of second-order arithmetic.
最后更新: 2016-03-03
使用频率: 1
质量:
Το παρών απαγωγικό σύστημα χρησιμοποιείται συνήθως στη μελέτη της second-order arithmetic.
this deductive system is commonly used in the study of second-order arithmetic.
最后更新: 2016-03-03
使用频率: 1
质量:
kruskal's tree theorem, which has applications in computer science, is also undecidable from peano arithmetic but provable in set theory.
kruskal's tree theorem, which has applications in computer science, is also undecidable from peano arithmetic but provable in set theory.
最后更新: 2016-03-03
使用频率: 1
质量:
this corollary of the second incompleteness theorem shows that there is no hope of proving, for example, the consistency of peano arithmetic using any finitistic means that can be formalized in a theory the consistency of which is provable in peano arithmetic.
this corollary of the second incompleteness theorem shows that there is no hope of proving, for example, the consistency of peano arithmetic using any finitistic means that can be formalized in a theory the consistency of which is provable in peano arithmetic.
for example, the theory of primitive recursive arithmetic (pra), which is widely accepted as an accurate formalization of finitistic mathematics, is provably consistent in pa.
for example, the theory of primitive recursive arithmetic (pra), which is widely accepted as an accurate formalization of finitistic mathematics, is provably consistent in pa.
kirby and paris later showed goodstein's theorem, a statement about sequences of natural numbers somewhat simpler than the paris-harrington principle, to be undecidable in peano arithmetic.
kirby and paris later showed goodstein's theorem, a statement about sequences of natural numbers somewhat simpler than the paris-harrington principle, to be undecidable in peano arithmetic.