Opendata, web and dolomites


Inner models and infinite computations

Total Cost €


EC-Contrib. €






Project "IMIC" data sheet

The following table provides information about the project.


Organization address
postcode: BS8 1QU

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country United Kingdom [UK]
 Total cost 183˙454 €
 EC max contribution 183˙454 € (100%)
 Programme 1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
 Code Call H2020-MSCA-IF-2017
 Funding Scheme MSCA-IF-EF-ST
 Starting year 2018
 Duration (year-month-day) from 2018-07-01   to  2020-06-30


Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERSITY OF BRISTOL UK (BRISTOL) coordinator 183˙454.00


 Project objective

This proposal is in mathematical logic. It aims to study interactions between set theory and computability. More specifically, we want to apply techniques from inner model theory to computability and randomness.

The development of modern set theory began with Paul Cohen's solution of Hilbert's first problem in 1964. Since then, set theory has been used to solve important problems in various areas of mathematics. Descriptive set theory studies definable sets of reals, for instance Borel and analytic sets, and computability studies computable functions and its higher analogues.

We propose to develop applications of inner model theory in computability. Inner model theory is a major field of set theory which was pursued for instance by Ronald Jensen (recipient of the AMS Steel prize 2003 and Hausdorff medal 2015) and Hugh Woodin (recipient of the Hausdorff medal 2013). A major aim of this field is to determine the logical strength of theories. Recently, several new approaches for constructions of inner models have been studied, for example via strong logics by Menachem Magidor and Jouko Väänänen. We propose to follow this line of research and to study models constructed via ideas from infinite computation related to work of Joel David Hamkins and Philip Welch.

We further propose to apply inner model theory and descriptive set theory to study random sequences. Algorithmic randomness is a central field in computability with connections to theoretical computer science, that has been studied intensively, for instance by Ted Slaman and Andre Nies. We aim to solve problems in the higher generalizations of algorithmic randomness.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "IMIC" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email ( and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "IMIC" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.2.)

MathematicsAnalogies (2019)

Mathematics Analogies

Read More  

NaWaTL (2020)

Narrative, Writing, and the Teotihuacan Language: Exploring Language History Through Phylogenetics, Epigraphy and Iconography

Read More  

MingleIFT (2020)

Multi-color and single-molecule fluorescence imaging of intraflagellar transport in the phasmid chemosensory cilia of C. Elegans

Read More