Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T00:26:00.872Z Has data issue: false hasContentIssue false

JOINT DIAMONDS AND LAVER DIAMONDS

Published online by Cambridge University Press:  13 June 2019

MIHA E. HABIČ*
Affiliation:
FACULTY OF INFORMATION TECHNOLOGY CZECH TECHNICAL UNIVERSITY IN PRAGUE THÁKUROVA 9 160 00 PRAHA 6, CZECH REPUBLIC and DEPARTMENT OF LOGIC FACULTY OF ARTS CHARLES UNIVERSITY NÁM. JANA PALACHA 2 116 38 PRAHA 1, CZECH REPUBLIC E-mail:habicm@ff.cuni.czURL: https://mhabic.github.io
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The concept of jointness for guessing principles, specifically ${\diamondsuit _\kappa }$ and various Laver diamonds, is introduced. A family of guessing sequences is joint if the elements of any given sequence of targets may be simultaneously guessed by the members of the family. While equivalent in the case of ${\diamondsuit _\kappa }$, joint Laver diamonds are nontrivial new objects. We give equiconsistency results for most of the large cardinals under consideration and prove sharp separations between joint Laver diamonds of different lengths in the case of θ-supercompact cardinals.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019