|
|||||
|
|
Coding lemmata in L |
|
| Authors: | George?Kafkoulis mailto:kafkouli@fiu.edu" title=" kafkouli@fiu.edu" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author |
| Affiliation: | (1) Department of Mathematics, Florida International University, DM 410B, Miami, FL, 33199, USA |
| Abstract: | Under the assumption that there exists an elementary embedding(henceforth abbreviated as and in particular under we prove a Coding Lemma for and find certain versions of it which are equivalent to strong regularity of cardinals below . We also prove that a stronger version of the Coding Lemma holds for a stationary set of ordinals below .Mathematics Subject Classification (2000):  03E55 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |