David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Symbolic Logic 72 (3):901-918 (2007)
In , two different effective versions of Borel embedding are defined. The first, called computable embedding, is based on uniform enumeration reducibility, while the second, called Turing computable embedding, is based on uniform Turing reducibility. While  focused mainly on computable embeddings, the present paper considers Turing computable embeddings. Although the two notions are not equivalent, we can show that they behave alike on the mathematically interesting classes chosen for investigation in . We give a “Pull-back Theorem”, saying that if Φ is a Turing computable embedding of K into K’, then for any computable infinitary sentence φ in the language of K’, we can find a computable infinitary sentence φ* in the language of K such that for all
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
J. Chisholm, J. F. Knight & S. Miller (2007). Computable Embeddings and Strongly Minimal Theories. Journal of Symbolic Logic 72 (3):1031 - 1040.
Oron Shagrir (1997). Two Dogmas of Computationalism. Minds and Machines 7 (3):321-44.
Guido Gherardi (2011). Alan Turing and the Foundations of Computable Analysis. Bulletin of Symbolic Logic 17 (3):394-430.
Benjamin Wells (2002). Is There a Nonrecursive Decidable Equational Theory? Minds and Machines 12 (2):301-324.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
R. Urbaniak (2011). How Not To Use the Church-Turing Thesis Against Platonism. Philosophia Mathematica 19 (1):74-89.
Michael Rescorla (2007). Church's Thesis and the Conceptual Analysis of Computability. Notre Dame Journal of Formal Logic 48 (2):253-280.
Giangiacomo Gerla (1989). Turing L -Machines and Recursive Computability for L -Maps. Studia Logica 48 (2):179 - 192.
Eli Dresner (2008). Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW] Minds and Machines 18 (3):349-355.
Gualtiero Piccinini (2011). The Physical Church–Turing Thesis: Modest or Bold? British Journal for the Philosophy of Science 62 (4):733 - 769.
Wesley Calvert, Julia F. Knight & Jessica Millar (2006). Computable Trees of Scott Rank [Image] , and Computable Approximation. Journal of Symbolic Logic 71 (1):283 - 298.
Itamar Pitowsky (2003). Physical Hypercomputation and the Church–Turing Thesis. Minds and Machines 13 (1):87-101.
Stuart Shanker (1995). Turing and the Origins of AI. Philosophia Mathematica 3 (1):52-85.
Added to index2010-08-24
Total downloads2 ( #385,995 of 1,413,361 )
Recent downloads (6 months)1 ( #154,160 of 1,413,361 )
How can I increase my downloads?