Related papers: Inner Models from Extended Logics: Part 2
A club consisting of former regulars is added to an inaccessible cardinal, without changing cofinalities outside it. The initial assumption is optimal. A variation of the Radin forcing without a top measurable cardinal is introduced for…
The number of information systems (IS) studies dealing with explainable artificial intelligence (XAI) is currently exploding as the field demands more transparency about the internal decision logic of machine learning (ML) models. However,…
Suppose there is a Reinhardt cardinal. Then (1) $M_n(X)$ exists and is fully iterable (above $X$) for every transitive set $X$ and every $n<\omega$ (here $M_n(X)$ denotes the canonical minimal proper class inner model containing $X$ and…
The concepts of closed unbounded (club) and stationary sets are generalised to $\gamma$-club and $\gamma$-stationary sets, which are closely related to stationary reflection. We use these notions to define generalisations of Jensen's…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…
This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…
This article discusses the modular representation theory of finite groups of Lie type from the viewpoint of Broue's abelian defect group conjecture. We discuss both the defining characteristic case, the inspiration for Alperin's weight…
Starting from an inaccessible cardinal, we construct a model of $ZF+DC$ where there exists a mad family and all sets of reals are $\mathbb Q$-measurable for $\omega^{\omega}$-bounding sufficiently absolute forcing notions $\mathbb Q$.
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We like to develop model theory for $T$, a complete theory in $\mathbb{L}_{\theta,\theta}(\tau)$ when $\theta$ is a compact cardinal. By [Sh:300a] we have bare bones stability and it seemed we can go no further. Dealing with ultrapowers…
We investigate Steel's conjecture in 'The Core Model Iterability Problem', that if $W$ and $R$ are $\Omega+1$-iterable, $1$-small weasels, then $W\leq^{*}R$ iff there is a club $C\subset\Omega$ such that for all $\alpha\in C$, if $\alpha$…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…
We show that the Axiom of Dependent Choices, $\operatorname{DC}$, holds in countably iterable, passive premice $\mathcal{M}$ construced over their reals which satisfy the Axiom of Determinacy, $\operatorname{AD}$, in a…
We study some asymptotic variants of the club principle. Along the way, we construct some forcings and use them to separate several of these principles
We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…
We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…