403:
416:
409:
497:
453:
492:
487:
517:
69:
502:
446:
482:
223:
196:
472:
146:
439:
285:
304:
120:
477:
136:
289:
58:
46:
215:
Recursively
Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets
512:
507:
84:
88:
73:
281:
219:
213:
192:
186:
92:
423:
38:
402:
384:
365:
346:
327:
415:
381:
362:
343:
324:
124:
104:
251:
112:
466:
320:
116:
61:
54:
42:
238:
108:
100:
65:
50:
76:
starting in 1972 and became emeritus at M.I.T. in 2006 and at
Harvard in 2012.
17:
300:
80:
34:
408:
191:, Springer Monographs in Mathematics, Springer, pp. 380–381,
498:
Massachusetts
Institute of Technology School of Science faculty
188:
Combinatorial Set Theory: With a Gentle
Introduction to Forcing
276:
Chi Tat Chong, Yue Yang, "An interview with Gerald E. Sacks",
218:, Perspectives in Mathematical Logic, Springer, p. 245,
427:
278:
Recursion Theory: Computational
Aspects of Definability
68:. Sacks had a joint appointment as a professor at the
53:
and the Sacks
Density Theorem, which asserts that the
259:
97:
422:This article about an American mathematician is a
447:
8:
37:whose most important contributions were in
454:
440:
252:"Professor Gerald Sacks Retires from MIT"
33:(1933 – October 4, 2019) was an American
177:
139:, Princeton University Press 1963, 1966
165:Mathematical Logic in the 20th Century
70:Massachusetts Institute of Technology
7:
493:21st-century American mathematicians
488:20th-century American mathematicians
398:
396:
426:. You can help Knowledge (XXG) by
25:
99:. Among his notable students are
414:
407:
401:
1:
305:Mathematics Genealogy Project
185:Halbeisen, Lorenz J. (2011),
27:American logician (1933–2019)
518:American mathematician stubs
534:
503:Harvard University faculty
395:
483:Cornell University alumni
212:Soare, Robert I. (1987),
317:Degrees of unsolvability
137:Degrees of unsolvability
95:, with his dissertation
83:in 1933. He earned his
359:Higher recursion theory
241:, retrieved 2015-06-26.
167:, World Scientific 2003
161:, World Scientific 1999
153:Higher Recursion theory
149:, World Scientific 2010
91:under the direction of
473:Mathematical logicians
340:Saturated model theory
143:Saturated Model Theory
59:recursively enumerable
378:Selected logic papers
159:Selected Logic Papers
131:Selected publications
41:. Named after him is
478:American logicians
89:Cornell University
79:Sacks was born in
74:Harvard University
31:Gerald Enoch Sacks
435:
434:
145:, Benjamin 1972;
93:J. Barkley Rosser
16:(Redirected from
525:
456:
449:
442:
418:
413:
412:
411:
405:
397:
387:
380:by Dag Normann,
374:
368:
361:by Dag Normann,
355:
349:
342:by P. Stepanek,
336:
330:
313:
307:
298:
292:
274:
268:
266:
265:: 6, Autumn 2006
256:
248:
242:
236:
230:
228:
209:
203:
201:
182:
49:notion based on
39:recursion theory
21:
533:
532:
528:
527:
526:
524:
523:
522:
463:
462:
461:
460:
406:
400:
393:
391:
390:
375:
371:
356:
352:
337:
333:
314:
310:
299:
295:
275:
271:
254:
250:
249:
245:
237:
233:
226:
211:
210:
206:
199:
184:
183:
179:
174:
155:, Springer 1990
133:
125:Theodore Slaman
105:Harvey Friedman
28:
23:
22:
18:Gerald E. Sacks
15:
12:
11:
5:
531:
529:
521:
520:
515:
510:
505:
500:
495:
490:
485:
480:
475:
465:
464:
459:
458:
451:
444:
436:
433:
432:
419:
389:
388:
369:
350:
331:
308:
293:
269:
243:
231:
224:
204:
197:
176:
175:
173:
170:
169:
168:
162:
156:
150:
140:
132:
129:
113:Leo Harrington
62:Turing degrees
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
530:
519:
516:
514:
511:
509:
506:
504:
501:
499:
496:
494:
491:
489:
486:
484:
481:
479:
476:
474:
471:
470:
468:
457:
452:
450:
445:
443:
438:
437:
431:
429:
425:
420:
417:
410:
404:
399:
394:
386:
383:
379:
373:
370:
367:
364:
360:
354:
351:
348:
345:
341:
335:
332:
329:
326:
322:
321:Kenneth Appel
318:
312:
309:
306:
302:
297:
294:
291:
287:
283:
279:
273:
270:
264:
260:
253:
247:
244:
240:
235:
232:
227:
225:9783540152996
221:
217:
216:
208:
205:
200:
198:9781447121732
194:
190:
189:
181:
178:
171:
166:
163:
160:
157:
154:
151:
148:
144:
141:
138:
135:
134:
130:
128:
126:
122:
121:Steve Simpson
118:
117:Richard Shore
114:
110:
106:
102:
98:
94:
90:
87:in 1961 from
86:
82:
77:
75:
71:
67:
63:
60:
56:
55:partial order
52:
48:
44:
43:Sacks forcing
40:
36:
32:
19:
428:expanding it
421:
392:
377:
372:
358:
353:
339:
334:
316:
311:
301:Gerald Sacks
296:
277:
272:
262:
258:
246:
234:
214:
207:
187:
180:
164:
158:
152:
142:
96:
78:
51:perfect sets
30:
29:
513:2019 deaths
508:1933 births
147:2nd edition
109:Sy Friedman
101:Lenore Blum
467:Categories
376:Review of
357:Review of
338:Review of
315:Review of
286:3110275643
172:References
288:, 2015,
239:Short CV
81:Brooklyn
35:logician
385:1783306
366:1080970
347:0398817
328:0186554
303:at the
72:and at
57:of the
47:forcing
290:p. 275
284:
222:
195:
255:(PDF)
85:Ph.D.
66:dense
424:stub
282:ISBN
220:ISBN
193:ISBN
123:and
45:, a
319:by
64:is
469::
382:MR
363:MR
344:MR
325:MR
323:,
280:,
261:,
257:,
127:.
119:,
115:,
111:,
107:,
103:,
455:e
448:t
441:v
430:.
267:.
263:1
229:.
202:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.