SearcharxivSearch

arXiv · 1807.11896

Characterizations of the weakly compact ideal on $P_\kappa\lambda$

Abstract

Hellsten \cite{MR2026390} gave a characterization of $\Pi^1_n$-indescribable subsets of a $\Pi^1_n$-indescribable cardinal in terms of a natural filter base: when $\kappa$ is a $\Pi^1_n$-indescribable cardinal, a set $S\subseteq\kappa$ is $\Pi^1_n$-indescribable if and only if $S\cap C\neq\emptyset$ for every $n$-club $C\subseteq \kappa$. We generalize Hellsten's characterization to $\Pi^1_n$-indescribable subsets of $P_\kappa\lambda$, which were first defined by Baumgartner. After showing that under reasonable assumptions the $\Pi^1_0$-indescribability ideal on $P_\kappa\lambda$ equals the minimal \emph{strongly} normal ideal $\text{NSS}_{\kappa,\lambda}$ on $P_\kappa\lambda$, and is not equal to $\text{NS}_{\kappa,\lambda}$ as may be expected, we formulate a notion of $n$-club subset of $P_\kappa\lambda$ and prove that a set $S\subseteq P_\kappa\lambda$ is $\Pi^1_n$-indescribable if and only if $S\cap C\neq\emptyset$ for every $n$-club $C\subseteq P_\kappa\lambda$. We also prove that elementary embeddings considered by Schanker \cite{MR2989393} witnessing \emph{near supercompactness} lead to the definition of a normal ideal on $P_\kappa\lambda$, and indeed, this ideal is equal to Baumgartner's ideal of non--$\Pi^1_1$-indescribable subsets of $P_\kappa\lambda$. Additionally, as applications of these results we answer a question of Cox-L\"ucke \cite{MR3620068} about $\mathcal{F}$-layered posets, provide a characterization of $\Pi^m_n$-indescribable subsets of $P_\kappa\lambda$ in terms of generic elementary embeddings, prove several results involving a two-cardinal weakly compact diamond principle and observe that a result of Pereira \cite{MR3640048} yeilds the consistency of the existence of a $(\kappa,\kappa^+)$-semimorasses $\mu\subseteq P_\kappa\kappa^+$ which is $\Pi^1_n$-indescribable for all $n<\omega$.

Explore related subjects

Keep this discovery

BibTeXRIS

Brent Cody. 2018-07-31. Characterizations of the weakly compact ideal on $P_\kappa\lambda$. https://arxiv.org/abs/1807.11896

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO