关于某些构造性谓词演算
On certain constructive predicate calculus
摘要:
构造性算术或马尔可夫算术MA是从直觉算术HA通过添加以下两个原则获得的:马尔可夫原则M,它区分了构造主义和直觉主义,以及所谓的扩展丘奇命题ECT,它区分了构造性语义学和经典语义学。第一个原则是由一个谓词公式表示,但ECT是作为一个计划制定的算术语言。作者以前的一些结果使得用一个纯谓词公式代替ECT方案成为可能。这给出了一个谓词演算MQC,它可以作为构造性算术的逻辑基础。即以MQC和佩亚诺公理为基础的算术理论证明了MA中可推导的所有公式。注意,MQC不是直觉主义和经典逻辑之间的中间演算:它证明了一些在经典谓词演算中不可推导的公式。参考书目:12项。
英文摘要:
Constructive arithmetic, or the Markov arithmetic MA, is obtained from intuitionistic arithmetic HA by adding the following two principles: the Markov principle M which distinguishes constructivism from intuitionism, and the so-called extended Church thesis ECT, which distinguishes constructive semantics from classical semantics. The first principle is expressed by a predicate formula, but ECT is formulated as a scheme in the arithmetical language. Some earlier results of the authors make possible to replace the scheme ECT by a pure predicate formula. This gives a predicate calculus MQC which can serve as a logical basis for constructive arithmetic. Namely, arithmetical theory based on MQC and Peano axioms proves all formulas deducible in MA. Note that MQC is not an intermediate calculus between intuitionistic and classical logics: it proves some formulas that are not deducible in the classical predicate calculus. Bibliography: 12 items.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。