This is a preview of subscription content, log in via an institution to check access.
References
BenacerrafP., 1967, ‘God, the devil and Gödel’, The Monist 51, 9–32.
Boolos, G., 1979, The Unprovability of Consistency, Cambridge.
Carlson, T. J., 1984, ‘Epistemic arithmetic and a conjecture of Reinhardt’, Abstracts of the A.M.S., February 1984.
Fitch, 1963, ‘A logical analysis of some value concepts’, Journal of Symbolic Logic 60, 135–142.
Flagg, R. C., 1985, ‘Church's thesis is consistent with epistemic arithmetic’, Intensional Mathematics, S. Shapiro ed., North-Holland.
Føllesdal, D., 1961, Referential Opacity and Modal Logic, Ph.D. dissertation, Harvard University, 84–91.
GödelK., 1932, ‘Zur intuitionistischen Aussagenkalkül’, Akademie der Wissenschaften in Wien, Mathematisch-naturwissenschaftliche Klasse, Anzeiger 69, 65–66.
Hintikka, J., 1962, Knowledge and Belief, Cornell.
HorganT., 1981, ‘Counterfactuals and Newcomb's problem’, Journal of Philosophy, 78, 331–356.
Kalmár, L., 1959, ‘An argument against the plausibility of Church's thesis’, Constructivity in Mathematics, Proceedings of the colloquium held at Amsterdam 1957, A. Heyting ed., North-Holland.
Kreisel, G., 1970, ‘Church's thesis: a kind of reducibility axiom for constructive mathematics’, Intuitionism and Proof Theory, Proceedings of the summer conference at Buffalo 1968, North-Holland.
KreiselG., 1972, ‘Which number theoretic problems can be solved in recursive progressions on 473–1 through 0?’, Journal of Symbolic Logic 37, 311–334.
Kripke, S., 1977, ‘Identity and necessity’, Naming, Necessity, and Natural Kinds, Stephen P. Schwartz ed., Cornell.
Kripke, S., 1972, ‘Naming and necessity’, Semantics of Natural Language, D. Davidson and G. Harman eds., D. Reidel.
LöbM. H., 1955, ‘Solution of a problem of Henkin’, Journal of Symbolic Logic 20, 115–118.
LucasJ. R., 1961, ‘Minds, machines, and Gödel’, Philosophy 36, 112–127.
Montague, R., 1963, ‘Syntactical treatments of modality’, Acta Philosophica Fennica 16, pp153-167. (Reprinted in Formal Philosophy, R. Thomason ed., Yale, 1974.)
MoschovakisY. N., 1968. ‘Review of Kalmár, Peter, and Mendelson’, Journal of Symbolic Logic 33, 472.
MyhillJ., 1960, ‘Some remarks on the notion of proof’, Journal of Philosophy 57, 463–471.
Pour-ElM. B. and I.Richards, 1981, ‘The wave equation with computable initial data such that its unique solution is not computable’, Advances in Math 39, 215–239.
Pour-ElM. B. and I.Richards, 1983. ‘Noncomputability in analysis and physics: a complete determination of the class of noncomputable linear operators’, Advances in Math 48, 44–74.
Reinhardt, W. N. 1981, ‘The consistency of a variant of Church's thesis with an axiomatic theory of an epistemic notation’, Proceedings of the fifth Latin American symposium on mathematical logic held in Bogota, X. Caicedo ed. (Forthcoming in revised form in Journal of Symbolic Logic.)
ReinhardtW. N., 1985, ‘Absolute versions of incompleteness theorems’, Noûs 19, 317–346.
Rogers, H. Jr., 1967, Theory of Recursive Functions and Effective Computability, McGraw Hill.
SearleJ., 1980, ‘Minds, brains, and programs’, The Behavioral and Brain Sciences 3, 417–457.
Shapiro, S., 1985, ‘Epistemic and intuitionistic arithmetic’, Intensional Mathematics, S. Shapiro ed., North-Holland.
SmoklerH., 1979, ‘The collapse of modal distinctions in probabilistic contexts’, Theoria 45, 5.
Tharp, L., ‘All truths are absolutely provable’, unpublished manuscript.
TuringA. M., 1950, ‘Computing machinery and intelligence’, Mind 59, 433–460.
TymoezkoThomas, 1984, ‘An unsolved problem about knowledge’, The Philosophical Quarterly 34, 437–458.
Wang, H., 1974, From Mathematics to Philosophy, Humanities Press.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reinhardt, W.N. Epistemic theories and the interpretation of Gödel's incompleteness theorems. J Philos Logic 15, 427–474 (1986). https://doi.org/10.1007/BF00243392
Issue Date:
DOI: https://doi.org/10.1007/BF00243392