- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Knowledge, Machines, and the Consistency of Reinhardt's Strong Mechanistic Thesis
Annals of Pure and Applied Logic 105 (1--3):51--82 (2000)
Abstract
Reinhardt 's strong mechanistic thesis, a formalization of “I know I am a Turing machine”, is shown to be consistent with Epistemic Arithmetic.My notes
Similar books and articles
Wittgenstein and strong mathematical verificationism.Cyrus Panjvani - 2006 - Philosophical Quarterly 56 (224):406–425.
The consistency strength of an infinitary Ramsey property.George Kafkoulis - 1994 - Journal of Symbolic Logic 59 (4):1158-1195.
Mechanistic Evidence: Disambiguating the Russo–Williamson Thesis.Phyllis McKay Illari - 2011 - International Studies in the Philosophy of Science 25 (2):139-157.
Die starke KI-These.Stephan Zelewski - 1991 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 22 (2):337 - 348.
Die starke KI-TheseThe strong AI-thesis.Stephan Zelewski - 1991 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 22 (2):337-348.
A Note on Jaakko Hintikka's "Knowledge and Belief".Paul Weingartner - 1994 - Grazer Philosophische Studien 49 (1):135-147.
Strong paraconsistency and the basic constructive logic for an even weaker sense of consistency.Gemma Robles & José M. Méndez - 2009 - Journal of Logic, Language and Information 18 (3):357-402.
The interactive nature of computing: Refuting the strong church–turing thesis. [REVIEW]Dina Goldin & Peter Wegner - 2008 - Minds and Machines 18 (1):17-38.
Mathematical realism and gödel's incompleteness theorems.Richard Tieszen - 1994 - Philosophia Mathematica 2 (3):177-201.
Levels of Reflexivity: Unnoted Differences within the "Strong Programme" in the Sociology of Knowledge.Edward Manier - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:197-207.
Analytics
Added to PP
2011-03-20
Downloads
30 (#521,181)
6 months
13 (#184,769)
2011-03-20
Downloads
30 (#521,181)
6 months
13 (#184,769)
Historical graph of downloads
Citations of this work
Elementary patterns of resemblance.Timothy J. Carlson - 2001 - Annals of Pure and Applied Logic 108 (1-3):19-77.
Proving that the Mind Is Not a Machine?Johannes Stern - 2018 - Thought: A Journal of Philosophy 7 (2):81-90.
Patterns of resemblance of order 2.Timothy J. Carlson - 2009 - Annals of Pure and Applied Logic 158 (1-2):90-124.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
References found in this work
Syntactical Treatments of Modality, with Corollaries on Reflexion Principles and Finite Axiomatizability.Richard Montague - 1963 - Journal of Symbolic Logic 40 (4):600-601.
Epistemic theories and the interpretation of gödel's incompleteness theorems.William N. Reinhardt - 1986 - Journal of Philosophical Logic 15 (4):427--74.
Disjunction and existence under implication in elementary intuitionistic formalisms.S. C. Kleene - 1962 - Journal of Symbolic Logic 27 (1):11-18.
Necessity predicates and operators.William N. Reinhardt - 1980 - Journal of Philosophical Logic 9 (4):437 - 450.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo