Switch to: References

Add citations

You must login to add citations.
  1. The large cardinals between supercompact and almost-huge.Norman Lewis Perlmutter - 2015 - Archive for Mathematical Logic 54 (3-4):257-289.
    I analyze the hierarchy of large cardinals between a supercompact cardinal and an almost-huge cardinal. Many of these cardinals are defined by modifying the definition of a high-jump cardinal. A high-jump cardinal is defined as the critical point of an elementary embedding j:V→M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${j: V \to M}$$\end{document} such that M is closed under sequences of length sup{j|f:κ→κ}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sup\{{j\,|\,f: \kappa \to \kappa}\}}$$\end{document}. Some of the other (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
    The C (n)-cardinals were introduced recently by Bagaria and are strong forms of the usual large cardinals. For a wide range of large cardinal notions, Bagaria has shown that the consistency of the corresponding C (n)-versions follows from the existence of rank-into-rank elementary embeddings. In this article, we further study the C (n)-hierarchies of tall, strong, superstrong, supercompact, and extendible cardinals, giving some improved consistency bounds while, at the same time, addressing questions which had been left open. In addition, we (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
    The Lévy-Solovay Theorem [8] limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that many of the forcing iterations most commonly found in the large cardinal literature create no new weakly compact cardinals, measurable cardinals, strong cardinals, Woodin cardinals, strongly compact cardinals, supercompact cardinals, almost huge cardinals, huge cardinals, and so on.
    Download  
     
    Export citation  
     
    Bookmark   43 citations