20:
492:
739:
197:, ≤) the following holds: κ is supercompact and remains supercompact in any forcing extension via a κ-directed closed forcing. This statement, known as the
734:
729:
523:
644:
43:
55:
676:
224:
709:
435:
252:
is some elementary embedding. This algebra is the free left-distributive algebra on one generator. For this he introduced
152:
601:
556:
164:
156:
314:
724:
328:
264:
186:
179:
160:
82:
749:
744:
268:
202:
90:
433:
R. Laver (1978). "Making the supercompactness of κ indestructible under κ-directed closed forcing".
301:
Ralph McKenzie has been a doctoral student of James Donald Monk, who has been a doctoral student of
86:
399:
620:
452:
380:
345:
278:
78:
94:
167:), adding a real, was iterated with countable support iteration. This method was later used by
674:
R. Laver (2007). "Certain very large cardinals are not created in small forcing extensions".
640:"Braid group actions on left distributive structures, and well orderings in the braid groups"
685:
653:
610:
575:
565:
532:
501:
444:
413:
404:
372:
337:
182:. With the help of this, he proved the following result. If κ is supercompact, there is a κ-
54:. The largest part of his career he spent as Professor and later Emeritus Professor at the
183:
145:
227:
holds for the product of infinitely many trees. This solved a longstanding open question.
209:
175:
168:
47:
506:
483:
718:
658:
639:
624:
570:
551:
456:
302:
552:"The left-distributive law and the freeness of an algebra of elementary embeddings"
212:
proved that it is consistent that the continuum hypothesis holds and there are no ℵ
30:(October 20, 1942 – September 19, 2012) was an American mathematician, working in
253:
217:
62:
689:
536:
580:
31:
705:
615:
596:
19:
448:
418:
384:
349:
159:
is countable. This important independence result was the first when a
376:
341:
144:,≤). This also holds if the ordered sets are countable unions of
597:"On the algebra of elementary embeddings of a rank into itself"
201:, is used, for example, in the proof of the consistency of the
521:
R. Laver (1984). "Products of infinitely many perfect trees".
73:
Among Laver's notable achievements some are the following.
363:
R. Laver (1973). "An order type decomposition theorem".
326:
R. Laver (1971). "On Fraïssé's order type conjecture".
223:
Laver proved that the perfect subtree version of the
470:
Collegium
Logicum: Annals of the Kurt-Gödel-Society
493:Transactions of the American Mathematical Society
120:,≤), are countable ordered sets, then for some
65:, on September 19, 2012 after a long illness.
230:Laver started investigating the algebra that
8:
171:to introduce proper and semiproper forcing.
524:Journal of the London Mathematical Society
400:"On the consistency of Borel's conjecture"
657:
614:
579:
569:
505:
472:, Volume 9, Springer Verlag, 2006, p. 31.
417:
193:, ≤) such that after forcing with (
18:
294:
740:University of Colorado Boulder faculty
315:Obituary, European Set Theory Society
7:
735:21st-century American mathematicians
730:20th-century American mathematicians
52:Order Types and Well-Quasi-Orderings
645:Journal of Pure and Applied Algebra
46:in 1969, under the supervision of
44:University of California, Berkeley
14:
507:10.1090/S0002-9947-1981-0603771-7
155:, i.e., the statement that every
151:He proved the consistency of the
85:, (an extension of the notion of
56:University of Colorado at Boulder
677:Annals of Pure and Applied Logic
135:,≤) isomorphically embeds into (
42:Laver received his PhD at the
1:
710:Mathematics Genealogy Project
436:Israel Journal of Mathematics
174:He proved the existence of a
659:10.1016/0022-4049(95)00147-6
571:10.1016/0001-8708(92)90016-E
482:R. Laver; S. Shelah (1981).
766:
690:10.1016/j.apal.2007.07.002
537:10.1112/jlms/s2-29.3.385
199:indestructibility result
602:Advances in Mathematics
557:Advances in Mathematics
259:He also showed that if
225:Halpern–Läuchli theorem
157:strong measure zero set
616:10.1006/aima.1995.1014
180:supercompact cardinals
69:Research contributions
61:Richard Laver died in
24:
16:American mathematician
365:Annals of Mathematics
329:Annals of Mathematics
22:
290:Notes and references
203:proper forcing axiom
77:Using the theory of
28:Richard Joseph Laver
488:Souslin hypothesis"
87:well-quasi-ordering
79:better-quasi-orders
50:, with a thesis on
581:10338.dmlcz/127389
449:10.1007/BF02761175
419:10.1007/bf02392416
25:
638:R. Laver (1996).
595:R. Laver (1995).
550:R. Laver (1992).
398:R. Laver (1976).
757:
694:
693:
671:
665:
663:
661:
635:
629:
628:
618:
592:
586:
585:
583:
573:
547:
541:
540:
518:
512:
511:
509:
479:
473:
467:
461:
460:
430:
424:
423:
421:
405:Acta Mathematica
395:
389:
388:
360:
354:
353:
323:
317:
312:
306:
299:
234:generates where
153:Borel conjecture
93:conjecture (now
81:, introduced by
765:
764:
760:
759:
758:
756:
755:
754:
715:
714:
702:
697:
673:
672:
668:
637:
636:
632:
594:
593:
589:
549:
548:
544:
520:
519:
515:
487:
481:
480:
476:
468:
464:
432:
431:
427:
397:
396:
392:
377:10.2307/1970907
362:
361:
357:
342:10.2307/1970754
325:
324:
320:
313:
309:
300:
296:
292:
251:
244:
215:
143:
134:
119:
110:
103:
95:Laver's theorem
71:
40:
17:
12:
11:
5:
763:
761:
753:
752:
747:
742:
737:
732:
727:
717:
716:
713:
712:
701:
700:External links
698:
696:
695:
666:
630:
609:(2): 334–346.
587:
564:(2): 209–231.
542:
531:(3): 385–396.
513:
485:
474:
462:
443:(4): 385–388.
425:
390:
355:
318:
307:
293:
291:
288:
287:
286:
257:
249:
242:
228:
221:
213:
206:
176:Laver function
172:
149:
139:
132:
115:
108:
101:
70:
67:
48:Ralph McKenzie
39:
36:
15:
13:
10:
9:
6:
4:
3:
2:
762:
751:
748:
746:
743:
741:
738:
736:
733:
731:
728:
726:
725:Set theorists
723:
722:
720:
711:
707:
706:Richard Laver
704:
703:
699:
691:
687:
683:
679:
678:
670:
667:
660:
655:
651:
647:
646:
641:
634:
631:
626:
622:
617:
612:
608:
604:
603:
598:
591:
588:
582:
577:
572:
567:
563:
559:
558:
553:
546:
543:
538:
534:
530:
526:
525:
517:
514:
508:
503:
499:
495:
494:
489:
478:
475:
471:
466:
463:
458:
454:
450:
446:
442:
438:
437:
429:
426:
420:
415:
411:
407:
406:
401:
394:
391:
386:
382:
378:
374:
371:(1): 96–119.
370:
366:
359:
356:
351:
347:
343:
339:
336:(1): 89–111.
335:
331:
330:
322:
319:
316:
311:
308:
304:
303:Alfred Tarski
298:
295:
289:
284:
280:
276:
272:
271:
267:extension of
266:
262:
258:
255:
248:
241:
237:
233:
229:
226:
222:
219:
211:
207:
205:and variants.
204:
200:
196:
192:
188:
185:
181:
177:
173:
170:
166:
165:Laver forcing
162:
158:
154:
150:
148:ordered sets.
147:
142:
138:
131:
127:
123:
118:
114:
107:
100:
96:
92:
89:), he proved
88:
84:
83:Nash-Williams
80:
76:
75:
74:
68:
66:
64:
59:
57:
53:
49:
45:
37:
35:
33:
29:
23:Richard Laver
21:
684:(1–3): 1–6.
681:
675:
669:
649:
643:
633:
606:
600:
590:
561:
555:
545:
528:
522:
516:
497:
491:
477:
469:
465:
440:
434:
428:
409:
403:
393:
368:
364:
358:
333:
327:
321:
310:
297:
282:
274:
269:
260:
254:Laver tables
246:
239:
235:
231:
218:Suslin trees
198:
194:
190:
140:
136:
129:
125:
121:
116:
112:
105:
98:
72:
60:
51:
41:
27:
26:
750:2012 deaths
745:1942 births
500:: 411–417.
412:: 151–169.
263:is a (set-)
63:Boulder, CO
719:Categories
208:Laver and
32:set theory
652:: 81–98.
625:119485709
457:115387536
146:scattered
111:,≤),...,(
91:Fraïssé's
38:Biography
189:notion (
708:at the
385:1970907
350:1970754
273:, then
265:forcing
187:forcing
161:forcing
97:): if (
623:
484:"The ℵ
455:
383:
348:
210:Shelah
169:Shelah
621:S2CID
453:S2CID
381:JSTOR
346:JSTOR
279:class
277:is a
163:(see
104:,≤),(
184:c.c.
178:for
124:<
686:doi
682:149
654:doi
650:108
611:doi
607:110
576:hdl
566:doi
533:doi
502:doi
498:264
445:doi
414:doi
410:137
373:doi
338:doi
281:in
721::
680:.
648:.
642:.
619:.
605:.
599:.
574:.
562:91
560:.
554:.
529:29
527:.
496:.
490:.
451:.
441:29
439:.
408:.
402:.
379:.
369:98
367:.
344:.
334:93
332:.
58:.
34:.
692:.
688::
664:.
662:.
656::
627:.
613::
584:.
578::
568::
539:.
535::
510:.
504::
486:2
459:.
447::
422:.
416::
387:.
375::
352:.
340::
305:.
285:.
283:V
275:V
270:V
261:V
256:.
250:λ
247:V
245:→
243:λ
240:V
238::
236:j
232:j
220:.
216:-
214:2
195:P
191:P
141:j
137:A
133:i
130:A
128:(
126:j
122:i
117:i
113:A
109:1
106:A
102:0
99:A
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
