234:
247:
240:
42:
323:
284:
318:
313:
187:
167:
of the Turing degrees. They also exhibited limits on the possible automorphisms of the Turing degrees by showing that any automorphism will be
338:
277:
328:
133:
105:
270:
221:
308:
160:
303:
333:
156:
163:. They showed that the Bi-interpretability Conjecture is equivalent to there being no nontrivial
78:
254:
137:
112:
233:
197:
246:
193:
117:
168:
148:
144:
297:
152:
68:
17:
164:
95:
217:
41:
239:
211:
132:(born April 17, 1954) is a professor of mathematics at the
258:
147:
formulated the Bi-interpretability
Conjecture for the
111:
101:
91:
74:
64:
48:
32:
253:This article about an American mathematician is a
278:
8:
324:University of California, Berkeley faculty
285:
271:
40:
29:
188:International Congress of Mathematicians
7:
319:21st-century American mathematicians
314:20th-century American mathematicians
229:
227:
257:. You can help Knowledge (XXG) by
134:University of California, Berkeley
106:University of California, Berkeley
27:American mathematician (born 1954)
25:
245:
238:
232:
1:
222:Mathematics Genealogy Project
184:(1991). "Degree structures".
151:, which conjectures that the
339:American mathematician stubs
355:
226:
190:, Vol. I, II (Kyoto, 1990)
329:Harvard University alumni
155:of the Turing degrees is
123:
84:
39:
169:arithmetically definable
161:second-order arithmetic
130:Theodore Allen Slaman
34:Theodore Allen Slaman
18:Theodore Allen Slaman
192:. pp. 303–316.
157:logically equivalent
186:Proceedings of the
182:Slaman, Theodore A.
309:American logicians
79:Harvard University
266:
265:
127:
126:
86:Scientific career
16:(Redirected from
346:
287:
280:
273:
249:
244:
243:
242:
236:
228:
201:
138:recursion theory
113:Doctoral advisor
59:
57:
44:
30:
21:
354:
353:
349:
348:
347:
345:
344:
343:
294:
293:
292:
291:
237:
231:
218:Theodore Slaman
208:
180:
177:
118:Gerald E. Sacks
75:Alma mater
55:
53:
35:
28:
23:
22:
15:
12:
11:
5:
352:
350:
342:
341:
336:
331:
326:
321:
316:
311:
306:
296:
295:
290:
289:
282:
275:
267:
264:
263:
250:
225:
224:
215:
207:
206:External links
204:
203:
202:
176:
173:
149:Turing degrees
145:W. Hugh Woodin
125:
124:
121:
120:
115:
109:
108:
103:
99:
98:
93:
89:
88:
82:
81:
76:
72:
71:
66:
62:
61:
52:April 17, 1954
50:
46:
45:
37:
36:
33:
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
351:
340:
337:
335:
332:
330:
327:
325:
322:
320:
317:
315:
312:
310:
307:
305:
304:Living people
302:
301:
299:
288:
283:
281:
276:
274:
269:
268:
262:
260:
256:
251:
248:
241:
235:
230:
223:
219:
216:
213:
210:
209:
205:
199:
195:
191:
189:
183:
179:
178:
174:
172:
170:
166:
162:
158:
154:
153:partial order
150:
146:
141:
139:
136:who works in
135:
131:
122:
119:
116:
114:
110:
107:
104:
100:
97:
94:
90:
87:
83:
80:
77:
73:
70:
67:
63:
60:(age 70)
51:
47:
43:
38:
31:
19:
259:expanding it
252:
185:
181:
165:automorphism
142:
129:
128:
102:Institutions
85:
334:1954 births
143:Slaman and
96:Mathematics
65:Citizenship
298:Categories
175:References
56:1954-04-17
212:home page
69:American
220:at the
198:1159219
54: (
196:
92:Fields
255:stub
49:Born
159:to
300::
194:MR
171:.
140:.
286:e
279:t
272:v
261:.
214:.
200:.
58:)
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
