![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Paul Larson Paul Larson: A Uniqueness Theorem for Iterations. J. Symb. Log. 67 (4): 1344-1350 (2002) Paul Larson: Martin's Maximum and the P max axiom(*). Ann. Pure Appl. Logic 106 (1-3): 135-149 (2000) Paul Larson: Separating Stationary Reflection Principles. J. Symb. Log. 65 (1): 247-258 (2000) Paul Larson: An S max Variation for One Souslin Tree. J. Symb. Log. 64 (1): 81-98 (1999) ![]() ©2006 Association for Computing Machinery |