论文信息 - Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis

Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis

Abstract Reinhardt's strong mechanistic thesis, a formalization of “I know I am a Turing machine”, is shown to be consistent with Epistemic Arithmetic.

Timothy J. Carlson | T. Carlson

[1] W. Reinhardt. Absolute Versions of Incompleteness Theorems , 1985 .

[2] Stewart Shapiro,et al. Epistemic and Intuitionistic Arithmetic , 1985 .

[3] William N. Reinhardt. Necessity predicates and operators , 1980, J. Philos. Log..

[4] Stephen Cole Kleene. Disjunction and Existence Under Implication in Elementary Intuitionistic Formalisms , 1962, J. Symb. Log..

[5] Robert C. Flagg,et al. Church's Thesis is Consistent with Epistemic Arithmetic , 1985 .

[6] William N. Reinhardt,et al. Epistemic theories and the interpretation of Gödel's incompleteness theorems , 1986, J. Philos. Log..

[7] H. Friedman,et al. The disjunction property implies the numerical existence property. , 1975, Proceedings of the National Academy of Sciences of the United States of America.