Removing Laver functions from supercompactness arguments | Zendy

Apter Arthur W. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Removing Laver functions from supercompactness arguments

Author(s) -

Apter Arthur W.

Publication year - 2005

Publication title -

mathematical logic quarterly

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.473

H-Index - 28

eISSN - 1521-3870

pISSN - 0942-5616

DOI - 10.1002/malq.200410015

Subject(s) - mathematics , forcing (mathematics) , axiom , consistency (knowledge bases) , axiom independence , lottery , axiom of choice , pure mathematics , mathematical economics , discrete mathematics , mathematical analysis , computer science , set theory , statistics , geometry , set (abstract data type) , programming language

We show how the use of a Laver function in the proof of the consistency, relative to the existence of a supercompact cardinal, of both the Proper Forcing Axiom and the Semiproper Forcing Axiom can be eliminated via the use of lottery sums of the appropriate partial orderings. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research