Studia Logica 102 (3):567-576 (2014)

Authors
Samuel Allen Alexander
Ohio State University (PhD)
Abstract
We construct a machine that knows its own code, at the price of not knowing its own factivity
Keywords Knowing machines  Reinhardt’s strong mechanistic thesis  Lucas–Penrose argument  Kleene’s recursion theorem  Quantified modal logic
Categories (categorize this paper)
ISBN(s)
DOI 10.1007/s11225-013-9491-6
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

 PhilArchive page | Other versions
Through your library

References found in this work BETA

Minds, Machines and Gödel.John R. Lucas - 1961 - Philosophy 36 (137):112-127.
Minds, Machines and Gödel.J. R. Lucas - 2003 - Etica E Politica 5 (1):1.
God, the Devil, and Gödel.Paul Benacerraf - 1967 - The Monist 51 (1):9-32.

View all 16 references / Add more references

Citations of this work BETA

Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.
Self-Referential Theories.Samuel A. Alexander - 2020 - Journal of Symbolic Logic 85 (4):1687-1716.

Add more citations

Similar books and articles

Mechanism, Truth, and Penrose's New Argument.Stewart Shapiro - 2003 - Journal of Philosophical Logic 32 (1):19-42.
Yesterday’s Algorithm.William Seager - 2003 - Croatian Journal of Philosophy 3 (9):265-273.
Remarks on Penrose’s “New Argument”.Per Lindström - 2006 - Journal of Philosophical Logic 35 (3):231-237.
A Unified Completeness Theorem for Quantified Modal Logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Kleene's Amazing Second Recursion Theorem.Yiannis N. Moschovakis - 2010 - Bulletin of Symbolic Logic 16 (2):189 - 239.
McCall's Gödelian Argument is Invalid.Panu Raatikainen - 2002 - Facta Philosophica 4 (1):167-69.

Analytics

Added to PP index
2013-05-28

Total views
509 ( #12,971 of 2,420,320 )

Recent downloads (6 months)
34 ( #24,069 of 2,420,320 )

How can I increase my downloads?

Downloads

My notes