Theodore Slaman - PDFSEARCH.IO - Document Search Engine

Theodore Slaman
Results: 7

#	Item
1	ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-08-16 22:19:13 Year of birth missing Turing degree Mathematics Mathematical logic Logic Proof theory Computability theory Carl Jockusch Place of birth missing
2	THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:55:43 Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory Mathematical logic Theoretical computer science
3	Turing Degrees and Definability of the Jump C Theodore A. Slaman University of California, Berkeley Add to Reading List Source URL: math.berkeley.edu Language: English - Date: 2005-07-21 06:01:25 English people Theory of computation Turing degree Alan Turing Degree of a continuous mapping Computability theory British people Mathematics
4	Progress on the c.e. sets: Improving and Proving the Slaman-Woodin conjecture Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:21 Theodore Slaman Mathematics
5	Microsoft PowerPoint - IMS Public Lecture - Slaman Add to Reading List Source URL: www.ims.nus.edu.sg Language: English - Date: 2010-01-12 23:03:20 Mathematical logic Mathematics Kurt Gödel National University of Singapore Philosophy Knowledge Academia Theodore Slaman Computability theory
6	THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA† Add to Reading List Source URL: www.fmi.uni-sofia.bg Language: English - Date: 2013-11-11 20:26:54 Philosophy of mathematics Turing degree Turing jump Enumeration Theodore Slaman Arithmetical set Computability theory Mathematics Logic
7	Defining the Turing Jump Richard A. Shore∗ Theodore A. Slaman† Add to Reading List Source URL: math.berkeley.edu Language: English - Date: 1999-11-30 17:17:44 Logic Metalogic Model theory Constructible universe Theory of computation Forcing Μ operator Primitive recursive function Mathematical logic Mathematics Computability theory