Semantics and syntax: a legacy of Alan Turing

We have been made aware of a convincing email scam that is focusing on our Programme and Workshop participants. Participants may receive an email from a firm called Expo Hotel Services (ehotelservices.org) to arrange accommodation for workshops and/or programmes. This might include a request to provide them with credit card information.

Please note, INI will never ask for your card details. We take all payments via the University of Cambridge Online store https://onlinesales.admin.cam.ac.uk/.

If you have been contacted by this company please contact us as soon as possible.

Programme theme

In several mathematical areas of Theoretical Computer Science, we perceive a distinction between research focusing on symbolic manipulation of language and structures (independent of meaning) and research dealing with interpreted computational meaning of structures. In mathematical logic, the distinction is known as syntax (symbolic manipulation) versus semantics (interpreted structures). This distinction recurs in many research areas, often under different (and sometimes incompatible) names. For research in these fields, both views are important and fundamental for gaining full understanding of the formal issues involved. The programme Syntax and Semantics endeavours to bring together researchers from both sides of the syntax-semantics divide. We shall focus on four mathematical areas bordering computer science in which the syntax/semantics distinction is particularly relevant: logic, complexity, cryptography, and randomness.

Alan Turing Year logo

The year 2012 sees the 100th anniversary of the birthday of Alan Turing, who made fundamental contributions to our research areas and worked within both the semantic/computational and syntactic/symbolic paradigms, and managed to combine them in various applications using an integrated methodology that should serve as an example for our programme. We understand our programme as embedded in the large-scale celebration of the Alan Turing Year.

Click here to download the programme's final scientific report

Preprints

Title	Year	Programme
Premise selection for mathematics by corpus analysis and Kernel methods Authors: Jesse Alama, T Heskes, D Kuhlwein, E Tsivtsivadze, J Urban Download PDF	2011	SAS
Checking proofs Authors: Jesse Alama, R Kahle Download PDF	2011	SAS
Universal computably enumerable equivalence relations Authors: U Andrews, Steffen Lempp, Russell Miller, KENG Meng Ng, L San Mauro, ET Al Download PDF	2011	SAS
How much randomness is needed for statistics? Authors: B Kjos-hassen, Antoine Taveneaux, Neil Thapen Download PDF	2011	SAS
The tile assembly model is intrinsically universal Authors: D Doty, Jack Lutz, MJ Patitz, RT Schweller, SM Summers, ET Al Download PDF	2011	SAS
Escape to Mizar from ATPs Authors: Jesse Alama Download PDF	2011	SAS
Intuitionistic logic of proofs with dependant proof terms Authors: Giuseppe Primiero Download PDF	2011	SAS
Dimension spectra of random subfractals of self-similar fractals Authors: X Gu, Jack Lutz, Elvira Mayordomo, P Moser Download PDF	2011	SAS
Requirements analysis for a product family of DNA Nanodevices Authors: Jack Lutz, Jack Lutz, JI Lathrop, TH Klinge, D Mathur, ET Al Download PDF	2011	SAS
Some open (?) problems concerning dependent type theories Authors: Peter Aczel Download PDF	2011	SAS
Generalized geometric theories and set-generated classes Authors: Peter Aczel, H Ishihara, T Nemoto, Y Sangu Download PDF	2011	SAS
Rudimentary and arithmetical constructive set theory Authors: Peter Aczel Download PDF	2011	SAS
Computability and analysis: the legacy of Alan Turing Authors: Jeremy Avigad, Vasco Brattka Download PDF	2011	SAS
Connected choice and the Brouwer Fixed Point Theorem Authors: Vasco Brattka, S Le Roux, Arno Pauly Download PDF	2011	SAS
Randomness, computation and mathematics Authors: Rod Downey Download PDF	2011	SAS
A parameterized complexity tutorial Authors: Rod Downey, A Dediu, C Martin-vide Download PDF	2011	SAS
Asymptotic density and computably enumerable sets Authors: Rod Downey, CG Jockusch Jr., PE Schupp Download PDF	2011	SAS
The birth and early years of parameterized complexity Authors: Rod Downey Download PDF	2011	SAS
A basic parameterized complexity primer Authors: Rod Downey, H Bodlaender, F Fomin, D Marx Download PDF	2011	SAS
Exact pairs for the ideal of the $\it K$-trivial sequences in the turing degrees Authors: George Barmpalias, Rod Downey Download PDF	2011	SAS
Computable categoricity versus relative computable categoricity Authors: Rod Downey, A Kach, Steffen Lempp, Daniel Turetsky Download PDF	2011	SAS
On minimal wtt-degrees and computably enumerable Turing degrees Authors: Rod Downey, KM Ng, R Solomon Download PDF	2011	SAS
A hierarchy of ramified theories below PRA Authors: EJ Spoors, Stan Wainer Download PDF	2011	SAS
Lowness for bounded randomness Authors: Rod Downey, KM Ng Download PDF	2011	SAS
Objectivity and reproducibility of proppian narrative annotations Authors: R Bod, Bernhard Fisseni, A Kurji, Benedikt Löwe Download PDF	2011	SAS
Which dimensions of narratives are relevent for human judgments of story equivalence? Authors: Bernhard Fisseni, Benedikt Löwe Download PDF	2011	SAS
$\it G \delta\sigma$-games Authors: Philip Welch Download PDF	2011	SAS
Global reflection principles Authors: Philip Welch Download PDF	2011	SAS
Base invariance of feasible dimension Authors: John Hitchcock, Elvira Mayordomo Download PDF	2011	SAS
Kochen-Specker theorem revisited and strong incomputability of quantum randomness Authors: AA Abbott, Cristian S. Calude, J Conder, K Svozil Download PDF	2011	SAS
Structural connections between a forcing class and its modal logic Authors: Joel David Hamkins, G Leibman, Benedikt Löwe Download PDF	2011	SAS
Every countable model of set theory embeds into its own constructible universe Authors: Joel David Hamkins Download PDF	2011	SAS
Moving up and down in the generic multiverse Authors: Joel David Hamkins, Benedikt Löwe Download PDF	2011	SAS
Effective dimension in some general metric spaces Authors: Elvira Mayordomo Download PDF	2011	SAS
A size index for multitape Turing Machines Authors: Rainer Glaschick Download PDF	2011	SAS
A note on initial segments of the enumeration degrees Authors: Theodore Slaman, Andrea Sorbi Download PDF	2011	SAS
Wadge hardness in Scott spaces and its effectivization Authors: Verónica Becher, S Grigorieff Download PDF	2011	SAS
Normal numbers and finite automata Authors: Verónica Becher, Pablo Ariel Heiber Download PDF	2011	SAS
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization Authors: Verónica Becher, S Grigorieff Download PDF	2011	SAS
Normality and differentiability Authors: Verónica Becher, Pablo Ariel Heiber Download PDF	2011	SAS
Turing's normal numbers: towards randomness Authors: Verónica Becher Download PDF	2011	SAS
The Turing degrees below generics and randoms Authors: Richard Shore Download PDF	2011	SAS
Analogues of Chaitin's omega in the computably enumerable sets Authors: George Barmpalias, Rupert Hölzl, Andy Lewis, Wolfgang Merkle Download PDF	2011	SAS
Kolmogorov complexity and computably enumerable sets Authors: George Barmpalias, Zhenhao Li Download PDF	2011	SAS
Resolute sequences in initial segment complexity Authors: George Barmpalias, Rod Downey Download PDF	2011	SAS
Algorithmic randomness and measures of complexity Authors: George Barmpalias Download PDF	2011	SAS
Improved witnessing and local improvement principles for second-order bounded arithmetic Authors: Arnold Beckmann, Sam Buss Download PDF	2011	SAS
Safe recursive set functions Authors: Arnold Beckmann, Sam Buss, Sy-David Friedman Download PDF	2011	SAS
New conjectures about zeroes of Riemann's zeta function Authors: Yuri Matiyasevich Download PDF	2011	SAS
The classification problem for compact computable metric spaces Authors: Alexander Melnikov, Andre Nies Download PDF	2011	SAS
The complexity of proving that a graph is Ramsey Authors: Massimo Lauria, Pavel Pudlak, V Rodl, Neil Thapen Download PDF	2011	SAS
Ajtai's completeness theorem for nonstandard finite structures Authors: Michal Garlik Download PDF	2011	SAS
Generalized algebra-valued models of set theory Authors: Benedikt Löwe, Sourav Tarafder Download PDF	2011	SAS
Inhabitants of interesting subsets of the Bousfield lattice Authors: Andrew Brooke-Taylor, Benedikt Löwe, Birgit Richter Download PDF	2011	SAS
Dependencies in formal mathematics: applications and extraction for Coq and Mizar Authors: Jesse Alama, L Mamame, J Urban Download PDF	2011	SAS
New developments in parsing Mizar Authors: Jesse Alama, C Bylinski Download PDF	2011	SAS
Tipi: A TPTP-based theory development environment emphasizing proof dependencies Authors: Jesse Alama Download PDF	2011	SAS

Workshops

SASW05

Seminars

Wednesday 11th January 2012
17:00 to 17:30	Yuri Matiyasevich Saint Petersburg State University Diophantine Machines	Room 2
17:30 to 18:00	Ian Mackie Laboratoire d'Informatique de l'Ecole Polytechnique Conservation of Data	Room 2
18:00 to 18:30	Andreas Weiermann Universiteit Gent Extended Goodstein sequences	Room 2
18:30 to 19:30	SAS reception to be held in the Gatehouse	Room 2

Thursday 12th January 2012
16:00 to 16:30	Anthony Morphett Australian Catholic University Promptness, Randomness and Degrees	Room 2
16:30 to 17:00	Carlos León Universidad Complutense de Madrid From Narratology to Formal Narrative Structures: What is Relevant in a Story?	Room 2
17:00 to 17:30	Angsheng Li Chinese Academy of Sciences Homophily Law of Networks: Principles, Methods, and Experiments	Room 2

Tuesday 17th January 2012
16:00 to 16:30	Peter Schuster University of Leeds A Proof Pattern in Algebra	Room 1
16:30 to 17:00	Jouko Vaananen University of Helsinki The Logic of Dependence and Independence	Room 1
17:00 to 17:30	Michael Rathjen University of Leeds Slow Consistency	Room 1

Thursday 19th January 2012
16:00 to 16:30	Albert Atserias Universitat Politècnica de Catalunya Sherali-Adams Relaxations and Graph Indistinguishability	Room 1
16:30 to 17:00	Grant Passmore Aesthetic Integration Ltd Decision Methods over Real and Algebraically Closed Fields	Room 1

Tuesday 24th January 2012
16:00 to 16:30	Russell Miller City University of New York Computability Questions about Fields	Room 1
16:30 to 17:00	Douglas Bridges University of Canterbury Constructive Thoughts on Operator Algebras	Room 1
17:00 to 17:30	Jesse Alama Universidade Nova de Lisboa (UNL) Automated and Human Proofs in General Mathematics: An Initial Comparison	Room 1

Thursday 26th January 2012
16:00 to 16:30	Graham Steel CNRS - Ecole Normale Superieure Paris The "Million Message Attack" in 15 Thousand Message	Room 1
16:30 to 17:00	Sam Sanders Universiteit Gent Reuniting the antipodes: bringing together Nonstandard Analysis and Constructive Analysis	Room 1

Tuesday 7th February 2012
16:00 to 16:30	Peter Aczel University of Manchester Homotopy Type Theory and the Structure Identity Principle	Room 1
16:30 to 17:00	A logicians approach to Network Coding	Room 1
17:00 to 17:30	Andrew Brooke-Taylor University of Leeds The Bousfield lattice from a set-theoretic perspective	Room 1

Thursday 9th February 2012
16:00 to 16:30	Giuseppe Primiero Universiteit Gent Practical Reasoning with Proofs and Types	Room 1
16:30 to 17:00	Neil Thapen Charles University, Prague Proof complexity and search problems	Room 1

Tuesday 14th February 2012
16:00 to 16:30	Ian Herbert University of California, Berkeley Lowness for Information	Room 1
16:30 to 17:00	Antonio Montalban University of Chicago Computable Structures of High Scott Rank	Room 1
17:00 to 17:30	Theodore Slaman University of California, Berkeley Number theoretic consequences of Ramsey theoretic principles	Room 1

Thursday 16th February 2012
16:00 to 16:30	Merlin Carl Rheinische Friedrich-Wilhelms-Universität Bonn Real closed fields and models of Peano Arithmetic	Room 1
16:30 to 17:00	Steffen Lempp University of Wisconsin-Madison The AE-theory of the partial ordering of the Sigma^0_2-enumeration degrees	Room 1
17:00 to 17:30	Peter Koepke Rheinische Friedrich-Wilhelms-Universität Bonn Formal mathematics and natural language	Room 1

Friday 17th February 2012
17:30 to 18:30	John M. Prager IBM Thomas J. Watson Research Center New York IBM Watson from Jeopardy! to Healthcare. Could a quiz-show winning computer advise your doctor?	Meeting Room

Saturday 18th February 2012
16:25 to 17:25	Raúl Rojas Freie Universität Berlin Zuse and Turing	Meeting Room
17:40 to 18:40	Leslie Moran Birkbeck, University of London The laws fascination with homosexual acts: Insights from the Wolfenden review archive	Meeting Room

Sunday 19th February 2012
10:00 to 11:00	John M. Prager IBM Thomas J. Watson Research Center New York What does Watson understand? How recent AI activities relate to Turing's vision	Meeting Room
11:15 to 12:15	Henk Barendregt Radboud Universiteit Nijmegen From Mind to Turing to Mind	Meeting Room
13:45 to 14:45	Angela Stevens Westfalische Wilhelms-Universitat Munster Pattern Formation and Turing Pattern in Developing Cell Systems	Meeting Room
14:45 to 15:45	Jens Groth University College London Turing and Modern Cryptography	Meeting Room
16:00 to 17:00	Julian Richards University of Buckingham The contribution of Alan Turing to British intelligence	Meeting Room

Tuesday 21st February 2012
16:00 to 16:30	Cameron Freer None / Other Computability and probabilistic symmetries	Room 1
16:30 to 17:00	Big open problems: a discussion session	Room 1

Thursday 23rd February 2012
16:00 to 16:30	Martin Davis New York University Universality and Computation	Room 1
16:30 to 17:00	Helmut Schwichtenberg Ludwig-Maximilians-Universität München Proofs and Computations	Room 1
17:00 to 17:30	Arno Pauly University of Cambridge The structure of Weihrauch degrees	Room 1

Tuesday 28th February 2012
16:00 to 16:30	Stan Wainer University of Leeds Predictably terminating computations	Room 1
16:30 to 17:00	Philip Welch University of Bristol Towards transfinite dynamical systems	Room 1

Thursday 1st March 2012
13:30 to 15:00	Jesse Alama Universidade Nova de Lisboa (UNL) Meeting of the Interest Group on Formal Mathematics: Fine-grained mathematical dependencies in the Mizar proof assistant	Room 2
16:00 to 16:30	Bjarki Holm University of Cambridge Model-comparison games with algebraic rules	Room 1
16:30 to 17:00	Rod Downey Victoria University of Wellington Things I have been thinking about recently, and things I would like to do	Room 1
17:00 to 17:30	Anton Setzer Swansea University Beyond inductive definitions -- induction-recursion, induction-induction, coalgebras	Room 1

Tuesday 6th March 2012
16:00 to 16:30	Nigel Smart University of Bristol Fully Homomorphic Encryption	Room 1
16:30 to 17:00	Gregorio de Miguel Casado Universidad de Zaragoza Bridging Formal Methods in Computer Science for Scientific Computing and Cognitive Science Modelling Tasks	Room 1
17:00 to 17:30	Moshe Yaakov Vardi Rice University Synthesis from Components	Room 1

Thursday 8th March 2012
13:30 to 15:00	Peter Aczel University of Manchester Literate Proving: Informal Discussion Group	Discussion Room
16:00 to 16:30	Klaus Ambos-Spies Ruprecht-Karls-Universität Heidelberg On the strongly bounded Turing degrees of the computably enumerable sets	Room 1
16:30 to 17:00	Ján Pich Charles University, Prague Hard tautologies	Room 1

Tuesday 13th March 2012
09:30 to 16:00	SAS informal discussion	Room 2
16:00 to 16:30	Jack Lutz Iowa State University Two visions from Turing: Universality and the power of constraining resources	Room 1
16:30 to 17:00	Christian Becker-Asano Albert-Ludwigs-Universität Freiburg Computational modeling of emotions	Room 1
17:00 to 17:30	Iskander Kalimullin Kazan State University Limitwise monotonicity spectra and uniformity	Room 1

Thursday 15th March 2012
13:30 to 15:00	Helmut Schwichtenberg Ludwig-Maximilians-Universität München Computational content of coinductive proofs (Interest Group in Formal Mathematics)	Room 1

Tuesday 20th March 2012
16:00 to 16:30	Proof complexity generators	Room 1
16:30 to 17:00	Marat Arslanov Kazan State University Definable relations in the Turing degree structures	Room 1

Thursday 22nd March 2012
13:30 to 15:00	The relative consistency of the axiom of choice mechanized using Isabelle/ZF	Discussion Room
16:00 to 16:30	Joel David Hamkins City University of New York Infinite chess: the mate-in-n problem is decidable and the omega-one of chess	Room 1
16:30 to 17:00	Robert Soare University of Chicago The Art of Classical Computability: Why Turing and Not Church?	Room 1

Wednesday 28th March 2012
14:00 to 16:00	Marcos Cramer Rheinische Friedrich-Wilhelms-Universität Bonn Interest Group in Formal Mathematics: Natural Language Proof Checking - The Naproche System	Discussion Room

Tuesday 3rd April 2012
16:00 to 16:30	Phokion Kolaitis University of California, Santa Cruz; IBM Research The Complexity of Query Answering in Inconsistent Databases	Room 2
16:30 to 17:00	Samson Abramsky University of Oxford Propositional calculus and the nature of reality	Room 2
17:00 to 17:30	Dirk Pattinson Imperial College London Reasoning in non-wellfounded logics	Room 2

Thursday 5th April 2012
16:00 to 16:30	Pavel Pudlak Academy of Sciences of the Czech Republic Disjoint NP-pairs, automatizability and games	Room 2

Monday 16th April 2012
14:00 to 16:00	Rainer Glaschick Heinz Nixdorf MuseumsForum Materialization of Universal Turing Machines	Room 2

Tuesday 17th April 2012
16:00 to 16:30	Niall Murphy Universidad Politécnica de Madrid Uniformity, circuits and non-deterministic Turing machines	Room 2
16:30 to 17:00	Damien Woods CALTECH (California Institute of Technology); INRIA Paris - Rocquencourt The computational complexity of small universal Turing machines	Room 2
17:00 to 17:30	Turlough Neary ETH Zürich The program-size complexity of universal Turing machines	Room 2

Tuesday 1st May 2012
16:00 to 16:30	Antonina Kolokolova Memorial University of Newfoundland Proof complexity of expander graph techniques	Room 1
16:30 to 17:00	Kenny Paterson Birkbeck, University of London Cryptographic theory for practice's sake	Room 1

Thursday 3rd May 2012
16:00 to 16:30	Valentine Kabanets Simon Fraser University Yin and Yang of Computer Science: Algorithms versus Lower Bounds	Room 1
16:30 to 17:00	Raja Natarajan Tata Institute of Fundamental Research Circularity, Paradoxes and Proofs	Room 1
17:00 to 17:30	Alexander Melnikov Nanyang Technological University Hyperarithmetical categoricity and abelian groups	Room 1

Tuesday 8th May 2012
16:00 to 16:30	Michal Garlik Charles University, Prague Ajtai's Completeness Theorem for Nonstandard Finite Structures	Room 1
16:30 to 17:00	Rod Downey Victoria University of Wellington Open Problem Session	Room 1

Wednesday 9th May 2012
14:00 to 15:00	Valiants Shift problem: A reduction to a problem about graph guessing games	Room 1

Thursday 10th May 2012
16:00 to 16:30	Anton Setzer Swansea University Consistency, physics, and coinduction	Room 1
16:30 to 17:00	Peter Aczel University of Manchester Syntax and Semantics - another look, especially for dependent type theories	Room 1
17:00 to 17:30	Elvira Mayordomo Universidad de Zaragoza Effective Fractal Dimension in Computational Complexity and Algorithmic Information Theory	Room 1

Tuesday 15th May 2012
15:00 to 17:00	Discussion Room booked for Robert Soare for a meeting with junior colleagues	Discussion Room
16:00 to 16:30	Robert Seth Lubarsky Florida Atlantic University Elementary Real Analysis	Room 1
16:30 to 17:00	Arnold Beckmann Swansea University Consistency statements in Bounded Arithmetic	Room 1

Thursday 17th May 2012
16:00 to 16:30	Steve Cook University of Toronto A Complexity Class Based on Comparator Circuits	Room 1
16:30 to 17:00	Sourav Tarafder Universiteit van Amsterdam Algebra-valued models of set theory	Room 1
17:00 to 17:30	Sebastian Müller Charles University, Prague Polylogarithmic Cuts of Models of Weak Arithmetic	Room 1

Tuesday 22nd May 2012
16:00 to 16:30	Monika Seisenberger Swansea University On the Computational Content of the Minimal-Bad-Sequence Argument	Room 1
16:30 to 17:00	Ulrich Berger Swansea University Coinduction in Computable Analysis	Room 1
17:00 to 17:30	Tanja Lange Technische Universiteit Eindhoven Complexity of exponential integer parts on real closed exponential fields	Room 1

Tuesday 29th May 2012
16:00 to 16:30	Jeremy Avigad Carnegie Mellon University Uniform distribution and algorithmic randomness	Room 1
16:30 to 17:00	Automorphisms of models of set theory	Room 1

Thursday 31st May 2012
16:00 to 16:30	Ram Ramanujam Institute of Mathematical Sciences, Chennai Bounds on proof size in security verification	Room 1
16:30 to 17:00	Alexandra Soskova Sofia University St. Kliment Ohridski Definability via Kalimullin Pairs	Room 1
17:00 to 17:30	Martin Escardo University of Birmingham Searchable sets and ordinals in system T	Room 1

Thursday 7th June 2012
16:00 to 16:30	Andy Lewis University of Leeds The complexity of computable categoricity	Room 1
16:30 to 17:00	Alexandra Soskova Sofia University St. Kliment Ohridski Conservative extensions and the jump of a structure	Room 1

Semantics and syntax: a legacy of Alan Turing

Organisers

Arnold Beckmann Swansea University
Barry Cooper University of Leeds
Benedikt Löwe Universiteit van Amsterdam; Universität Hamburg
Elvira Mayordomo Universidad de Zaragoza
Nigel Smart University of Bristol

Speakers

Samson Abramsky University of Oxford
Peter Aczel University of Manchester
Jesse Alama Universidade Nova de Lisboa (UNL)
Klaus Ambos-Spies Ruprecht-Karls-Universität Heidelberg
Marat Arslanov Kazan State University
Albert Atserias Universitat Politècnica de Catalunya
Jeremy Avigad Carnegie Mellon University
Henk Barendregt Radboud Universiteit Nijmegen
Christian Becker-Asano Albert-Ludwigs-Universität Freiburg
Arnold Beckmann Swansea University
Ulrich Berger Swansea University
Douglas Bridges University of Canterbury
Andrew Brooke-Taylor University of Leeds
Merlin Carl Rheinische Friedrich-Wilhelms-Universität Bonn
Stephen Cook University of Toronto
Marcos Cramer Rheinische Friedrich-Wilhelms-Universität Bonn
Martin Davis New York University
Gregorio de Miguel Casado Universidad de Zaragoza
Rod Downey Victoria University of Wellington
Martin Escardo University of Birmingham
Cameron Freer None / Other
Michal Garlik Charles University, Prague
Rainer Glaschick Heinz Nixdorf MuseumsForum
Jens Groth University College London
Joel David Hamkins City University of New York
Ian Herbert University of California, Berkeley
Bjarki Holm University of Cambridge
Valentine Kabanets Simon Fraser University
Iskander Kalimullin Kazan State University
Peter Koepke Rheinische Friedrich-Wilhelms-Universität Bonn
Phokion Kolaitis University of California, Santa Cruz; IBM Research
Antonina Kolokolova Memorial University of Newfoundland
Tanja Lange Technische Universiteit Eindhoven
Steffen Lempp University of Wisconsin-Madison
Andy Lewis University of Leeds
Carlos León Universidad Complutense de Madrid
Angsheng Li Chinese Academy of Sciences
Robert Seth Lubarsky Florida Atlantic University
Jack Lutz Iowa State University
Ian Mackie Laboratoire d'Informatique de l'Ecole Polytechnique
Yuri Matiyasevich Saint Petersburg State University
Elvira Mayordomo Universidad de Zaragoza
Alexander Melnikov Nanyang Technological University
Russell Miller City University of New York
Antonio Montalban University of Chicago
Leslie Moran Birkbeck, University of London
Anthony Morphett Australian Catholic University
Niall Murphy Universidad Politécnica de Madrid
Sebastian Müller Charles University, Prague
Raja Natarajan Tata Institute of Fundamental Research
Turlough Neary ETH Zürich
Grant Passmore Aesthetic Integration Ltd
Kenny Paterson Birkbeck, University of London
Dirk Pattinson Imperial College London
Arno Pauly University of Cambridge
Ján Pich Charles University, Prague
John M. Prager IBM Thomas J. Watson Research Center New York
Giuseppe Primiero Universiteit Gent
Pavel Pudlak Academy of Sciences of the Czech Republic
Ram Ramanujam Institute of Mathematical Sciences, Chennai
Michael Rathjen University of Leeds
Julian Richards University of Buckingham
Raúl Rojas Freie Universität Berlin
Sam Sanders Universiteit Gent
Peter Schuster University of Leeds
Helmut Schwichtenberg Ludwig-Maximilians-Universität München
Monika Seisenberger Swansea University
Anton Setzer Swansea University
Theodore Slaman University of California, Berkeley
Nigel Smart University of Bristol
Robert Soare University of Chicago
Alexandra Soskova Sofia University St. Kliment Ohridski; Sophia University
Graham Steel CNRS - Ecole Normale Superieure Paris
Angela Stevens Westfalische Wilhelms-Universitat Munster
Sourav Tarafder Universiteit van Amsterdam
Neil Thapen Charles University, Prague
Moshe Vardi Rice University
Jouko Väänänen University of Helsinki
Stan Wainer University of Leeds
Andreas Weiermann Universiteit Gent
Philip Welch University of Bristol
Damien Woods CALTECH (California Institute of Technology); INRIA Paris - Rocquencourt

Show All

Semantics and syntax: a legacy of Alan Turing

Programme theme

Preprints

Premise selection for mathematics by corpus analysis and Kernel methods

Checking proofs

Universal computably enumerable equivalence relations

How much randomness is needed for statistics?

The tile assembly model is intrinsically universal

Escape to Mizar from ATPs

Intuitionistic logic of proofs with dependant proof terms

Dimension spectra of random subfractals of self-similar fractals

Requirements analysis for a product family of DNA Nanodevices

Some open (?) problems concerning dependent type theories

Generalized geometric theories and set-generated classes

Rudimentary and arithmetical constructive set theory

Computability and analysis: the legacy of Alan Turing

Connected choice and the Brouwer Fixed Point Theorem

Randomness, computation and mathematics

A parameterized complexity tutorial

Asymptotic density and computably enumerable sets

The birth and early years of parameterized complexity

A basic parameterized complexity primer

Exact pairs for the ideal of the $\it K$-trivial sequences in the turing degrees

Computable categoricity versus relative computable categoricity

On minimal wtt-degrees and computably enumerable Turing degrees

A hierarchy of ramified theories below PRA

Lowness for bounded randomness

Objectivity and reproducibility of proppian narrative annotations

Which dimensions of narratives are relevent for human judgments of story equivalence?

$\it G \delta\sigma$-games

Global reflection principles

Base invariance of feasible dimension

Kochen-Specker theorem revisited and strong incomputability of quantum randomness

Structural connections between a forcing class and its modal logic

Every countable model of set theory embeds into its own constructible universe

Moving up and down in the generic multiverse

Effective dimension in some general metric spaces

A size index for multitape Turing Machines

A note on initial segments of the enumeration degrees

Wadge hardness in Scott spaces and its effectivization

Normal numbers and finite automata

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization

Normality and differentiability

Turing's normal numbers: towards randomness

The Turing degrees below generics and randoms

Analogues of Chaitin's omega in the computably enumerable sets

Kolmogorov complexity and computably enumerable sets

Resolute sequences in initial segment complexity

Algorithmic randomness and measures of complexity

Improved witnessing and local improvement principles for second-order bounded arithmetic

Safe recursive set functions

New conjectures about zeroes of Riemann's zeta function

The classification problem for compact computable metric spaces

The complexity of proving that a graph is Ramsey

Ajtai's completeness theorem for nonstandard finite structures

Generalized algebra-valued models of set theory

Inhabitants of interesting subsets of the Bousfield lattice

Dependencies in formal mathematics: applications and extraction for Coq and Mizar

New developments in parsing Mizar

Tipi: A TPTP-based theory development environment emphasizing proof dependencies

Workshops

Seminars

Organisers

Speakers

Supported By

Register for updates