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