The Bristol model:An abyss called a Cohen real

We construct a model M of ZF which lies between L and L[c] for a Cohen real c and does not have the form L(x) for any set x. This is loosely based on the unwritten work done in a Bristol workshop about Woodin's HOD Conjecture in 2011. The construction given here allows for a finer analysis of the needed assumptions on the ground models, thus taking us one step closer to understanding models of ZF, and the HOD Conjecture and its relatives. This model also provides a positive answer to a question of Grigorieff about intermediate models of ZF, and we use it to show the failure of Kinna-Wagner Principles in ZF

How to have more things by forgetting how to count them

Cohen's first model is a model of Zermelo-Fraenkel set theory in which there is a Dedekind-finite set of real numbers, and it is perhaps the most famous model where the Axiom of Choice fails. We force over this model to add a function from this Dedekind-finite set to some infinite ordinal κ. In the case that we force the function to be injective, it turns out that the resulting model is the same as adding κ Cohen reals to the ground model, and that we have just added an enumeration of the canonical Dedekind-finite set. In the case where the function is merely surjective it turns out that we do not add any reals, sets of ordinals, or collapse any Dedekind-finite sets. This motivates the question if there is any combinatorial condition on a Dedekind-finite set A which characterises when a forcing will preserve its Dedekind-finiteness or not add new sets of ordinals. We answer this question in the case of 'Adding a Cohen subset' by presenting a varied list of conditions each equivalent to the preservation of Dedekind-finiteness. For example, 2 A is extremally disconnected, or [A] <ω is Dedekind-finite

Generalized Effective Reducibility

We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not effective in the OTM-sense and considerung the effective equivalence of various versions of the axiom of choice

A Generalization of Martin's Axiom

We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the literature before.Comment: 36 page

Nested hierarchies in planar graphs

We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named `bubbles', that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities

Moving up and down in the generic multiverse

We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of". The fragment of the first relation is called the modal logic of forcing and was studied by us in earlier work. The fragment of the second relation is called the modal logic of grounds and will be studied here for the first time. In addition, we discuss which combinations of modal logics are possible for the two fragments.Comment: 10 pages. Extended abstract. Questions and commentary concerning this article can be made at http://jdh.hamkins.org/up-and-down-in-the-generic-multiverse

Abnormal activity in the precuneus during time perception in Parkinson’s disease: An fMRI study

Background Parkinson's disease (PD) patients are deficient in time estimation. This deficit improves after dopamine (DA) treatment and it has been associated with decreased internal timekeeper speed, disruption of executive function and memory retrieval dysfunction. Methodology/Findings The aim of the present study was to explore the neurophysiologic correlates of this deficit. We performed functional magnetic resonance imaging on twelve PD patients while they were performing a time reproduction task (TRT). The TRT consisted of an encoding phase (during which visual stimuli of durations from 5s to 16.6s, varied at 8 levels were presented) and a reproduction phase (during which interval durations were reproduced by a button pressing). Patients were scanned twice, once while on their DA medication (ON condition) and once after medication withdrawal (OFF condition). Differences in Blood-Oxygenation-Level-Dependent (BOLD) signal in ON and OFF conditions were evaluated. The time course of activation in the brain areas with different BOLD signal was plotted. There were no significant differences in the behavioral results, but a trend toward overestimation of intervals ≤11.9s and underestimation of intervals ≥14.1s in the OFF condition (p<0.088). During the reproduction phase, higher activation in the precuneus was found in the ON condition (p<0.05 corrected). Time course was plotted separately for long (≥14.1s) and short (≤11.9s) intervals. Results showed that there was a significant difference only in long intervals, when activity gradually decreased in the OFF, but remained stable in the ON condition. This difference in precuneus activation was not found during random button presses in a control task. Conclusions/Significance Our results show that differences in precuneus activation during retrieval of a remembered duration may underlie some aspects of time perception deficit in PD patients. We suggest that DA medication may allow compensatory activation in the precuneus, which results in a more accurate retrieval of remembered interval duration

Beginning of stability theory for Polish Spaces

We consider stability theory for Polish spaces and more generally for definable structures. We succeed to prove existence of indiscernibles under reasonable conditions