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