Department of Pure Mathematics

Logic Seminar 1998

Jan 28th

M.Fairtlough
(Sheffield)
Lax Logic: nuclei and monads from a proof-theoretic perspective.

Feb 4th

B.Herwig
(Leeds)
Weakly o-minimal structures.

Feb 11th

M.Rathjen
(Leeds)
Constructive universes and large set axioms.

Feb 18th

J.Krajicek
(Oxford)
Algebraic proof systems.

Feb 25th

P.D'Aquino
(Oxford)
Non-standard finite fields in fragments of arithmetic.

March 4th

Li Angsheng
(Academia Sinica, Beijing)
A nondiamond theorem for the computably enumerable degrees.

March 11th

J.Longley
(Edinburgh)
Realizability and higher-type computability.

The lectures will be held on Wednesdays at 4 pm in room J,

Mathematics building. Tea at 3.30 pm.

May 6th

R. Lubarsky
(Cologne)
Models of intuitionistic set theories.

May 13th

A. Morozov
(Novosibirsk and Heidelberg)
On recognising Turing degrees from quotients of their permutation groups.

May 27th

S. Abramsky
(Edinburgh)
Concurrent games and full completeness.

June 10th

T. Gardener
(Oxford)
Title to be announced.

June 17th

J. V. Tucker
(Swansea)
Computability theories for topological algebras.

The lectures will be held on Wednesdays at 4 pm in room J,

Mathematics building. Tea at 3.30 pm.

October 14th

Geoffrey Ostrin
(Leeds)
Elementary Arithmetic.

October 21st

Keith Johnson
(Leeds)
Model-theoretic constructions of infinite primitive Jordan groups.

October 28th

Steve Maxwell
(Oxford)
Tameness in Expansions of the Real Field.

November 4th

Mirna Dzamonja
(Norwich)
Guessing principles and their applications.

November 11th

Arnold Beckmann
(Muenster)
Dynamic ordinals -
a measure of the proof-theoretic strength for fragments of bounded arithmetic.

November 18th

Philip Scowcroft
(Wesleyan and Oxford)
Decidability and undecidability in the theory of the constructive reals.

November 25th

Jeff Zucker
(McMaster University, Hamilton)
Abstract and concrete models of computation on metric algebras.

December 9th

Two talks
2pm

Andrea Sorbi
(Siena)
The local structure of the enumeration degrees.
4pm

Marat Arslanov
(Kazan)
Enumeration reducibility in the difference hierarchy.

The lectures will be held on Wednesdays at 4 pm in room J,

Mathematics building. Tea at 3.30 pm.

Last changed: 11 February 2001 |
This page was created by Klaus Thiel |