Main Information Page Contents:

SHORT COURSES:

• Michael Rathjen (Leeds): 'The Realm of Ordinal Analysis'

• Richard A. Shore (Cornell): 'Effective Model Theory: The Number of Models and Their Complexity'

• John Steel (UC Berkeley): 'Determinacy, Inner Models, and Definable Scales'

• Alex J. Wilkie (Oxford): `The Model Theory of Analytic and Smooth Functions'

Up to contents: Back to LC97 homepage:

• Paul Benacerraf (Princeton): 'What Mathematical Truth Could Not Be - II'
  [THE BRITISH LOGIC COLLOQUIUM LECTURE]

• Ulrich Berger (Munich): 'Continuous Functionals of Dependent and Transfinite Type'

• Lou van den Dries (Urbana): 'On o-Minimal Expansions of the Field of Real Numbers'

• Sergey S. Goncharov (Novosibirsk): 'Computable Enumerations and Recursive Models'

• Ronald Jensen (Berlin): 'Remarks on Core Model Theory'

• Neil D. Jones (Copenhagen): `Computability and Complexity from a Programming Perspective'

• Byunghan Kim (Fields Institute): `Simple Theories'

• Julia Knight (Notre Dame): 'Recursive Infinitary Formulas'

• Itay Neeman (Harvard): 'Large Cardinals and the Determinacy of Long Games'

• Ludomir Newelski (Wroclaw): `On Topological Stability Conjecture'

• David E. Over (Sunderland): `Logic and Decision Making'
  [Part 2 of a two-hour colloquium on 'The Psychology of Proof']

• Pavel Pudlak (Prague): `On the Complexity of Propositional Calculus'

• Gerald E. Sacks (Harvard): `Recursion Theoretic Memories 1954 - 1979'
  [THE ROBIN GANDY LECTURE]

• Robert I. Soare (Chicago): `Martin's Invariance Conjecture and Low Sets' (joint with L. Harrington)

• Slawomir J. Solecki (UCLA): 'Borel Equivalence Relations and Topology'

• Keith Stenning (Edinburgh University): (title to follow) 'Learning Logic As A Cognitive Process'
  [Part 1 of a two-hour colloquium on 'The Psychology of Proof']

• Jaap van Oosten (Utrecht): `(Partial) Combinatory Algebras for Sequential Computation' (provisional title)

• Lincoln A. Wallen (Oxford): 'Herbrand's Theorem and the Structure of Analytic Search Spaces'

Up to contents: Back to LC97 homepage:

• COMPUTABILITY THEORY - Klaus Ambos-Spies (Heidelberg), Steffen Lempp (Madison).

• MODEL THEORY - Wilfrid A. Hodges (QMW, London) and Anand Pillay (Urbana).

• PROOF THEORY - Helmut Schwichtenberg (Munich), Gerhard Jaeger (Bern).

• SET THEORY - Sy D. Friedman (MIT).

Current details based on those available from the chairs are:

• Peter Cholak (Notre Dame), 'On Ramsey's Theorem for Pairs', Part 2 (joint with C.G. Jockusch - see below for Part 1 - and T.A. Slaman, UC Berkeley)

• Richard J. Coles (Victoria University, Wellington), 'The Distribution of Properly Sigma-zero-two e-Degrees' (joint with S. Bereznyuk, Novosibirsk and A. Sorbi, Siena)

• William Gasarch (Maryland), 'Ten Years of Bounded Queries in Computability Theory'

• Marcia J. Groszek (Dartmouth College), 'A Solution to Prikry's Problem' (joint with Theodore A. Slaman)

• Eberhard Herrmann (Berlin), Infinite Chains and Antichains in Recursive Posets

• Carl G. Jockusch, Jr. (University of Illinois, Urbana), 'On Ramsey's Theorem for Pairs', Part 1 (joint with P. Cholak - see above for Part 2 - and T.A. Slaman, UC Berkeley)

• Bakhadyr Khoussainov (University of Auckland, New Zealand), Computable Kripke Models and Completeness

• Geoffrey LaForte (Victoria University, Wellington), 'Enumerable Sets and Quasi-Reducibility' (joint with R. Downey, Wellington and A. Nies, Chicago)

• Manuel Lerman (Connecticut), 'Recent Results on Embedding Partial Lattices into the Computably Enumerable Degrees', (provisional title)

• Dag Normann (Oslo), 'The Superjump as a Type Constructor'

• Joseph R. Shoenfield (Duke University), 'Set Recursion'

Up to contents: Back to LC97 homepage:

• Zoe Chatzidakis (CNRS - Paris VII), 'Examples of Simple Theories'

• Deirdre Haskell (Holycross College, MA), 'One-Dimensional p-Adic Subanalytic Sets'

• Wilfrid A. Hodges (QMW, London), 'Relative Categoricity in Modules'

• Piotr Kowalski (Wroclaw), 'Model Theory of Algebraic Groups'

• Michael Y. Prest (Manchester), 'On the Ziegler Spectrum of the First Weyl Algebra'

• Predrag Tanovic (Academy of Sciences, Belgrade), 'Nonisolated Regular Types in Superstable Theories'

• Katrin Tent (Wuerzburg), 'Fields and Algebraic Groups'

• Markus Tressl (Regensburg), 'On Dedekind Cuts in Polynomially Bounded, o-Minimal Expansions of Real Closed Fields'

• Frank Wagner (Oxford), 'Groups in Simple Theories'

Up to contents: Back to LC97 homepage:

• Toshiyasu Arai (Hiroshima), 'Introducing the Hardline'

• Adam Cichon (Nancy), 'Ordinal Terms as a Tool for the Classification of Computational Complexity'

• Roy Dyckhoff (St. Andrews), 'Proof Search in Constructive Logics'

• Hugo Herbelin (INRIA, France), 'Sequent Calculus and Computation'

• Jörg Hudelmaier (Tübingen), 'Bicomplete Calculi for Intuitionistic Propositional Logic'

• Jaco van de Pol (Utrecht), 'Termination of Higher-Order Rewrite Systems'

• Anton G. Setzer (München), 'Why Large Cardinals Are Not Needed for Denoting Small Ordinals'

• Thomas Strahm (Bern), 'Aspects of Metapredicativity'

• Andreas Weiermann (Münster), 'How Is It That Infinitary Methods Can Be Applied To Finitary Mathematics?'

Up to contents: Back to LC97 homepage:

• James Cummings (Carnegie-Mellon), 'Identity Crises'

• Sy D. Friedman (MIT), 'Products of \kappa-Suslin Trees'
  (by invitation of the organisers)

• Martin Goldstern (Technical University of Vienna and Free University of Berlin), Order-Polynomially Complete Lattices Must Be Inaccessible

• Peter Koepke (Bonn), Intersection Models Violating the Singular Cardinals Hypothesis

• William Mitchell (University of Florida, Gainesville), 'Simplified Fine Structure?'

• Ernest Schimmerling (UC Irvine), 'Covering Properties of Core Models'

• Maurice C. Stanley (San Jose), 'Closed Sets and Class Forcing'

• Stevo Todorcevic (Toronto), 'Analytic Quotients'

• Philip Welch (Bristol and Kobe, Japan), 'Minimal Upper Bounds in the Theory of Delta^1_3 Degrees'

Up to contents: Back to LC97 homepage:

Acceptance (for presentation other than 'by title') of contributed papers received after this date cannot be guaranteed. Click on above subheading for most recent list of papers accepted.

Up to contents: Back to LC97 homepage:

Up to contents: Back to LC97 homepage:

Please let us know any special dietary requirements (e.g. vegetarian, kosher, gluten free) at least three weeks before the start of the conference.

Up to contents: Back to LC97 homepage:

Leeds and the West Yorkshire area is rich in easily accessible attractions of interest to spouses and other accompanying persons, and full information will be available at the conference.

The bar at Devonshire Hall will be open from around 6.30 to 11.00pm each evening, and there are a number of pleasant English pubs within walking distance.

Up to contents: Back to LC97 homepage:

Up to contents: Back to LC97 homepage:

1. a cheque in pounds sterling,
2. electronic transfer in either pounds sterling or your currency,
3. a cheque in your currency.

Cheques should be made payable to Logic Colloquium 97, and should be posted to: The Treasurer, Logic Colloquium 97, School of Mathematics, University of Leeds, Leeds LS2 9JT, UK. Electronic transfer should be to the account of Logic Colloquium 97 at Lloyds Bank, University Branch, 19 Blenheim Terrace, Leeds LS2 9HD, UK. Please quote our account no. 3733541 and the Bank sort code 30-00-05. Because of fluctuating exchange rates and bank charges, the amount credited to our account as a result of your payment may not exactly equal the registration fee. We will inform you of the difference and will ask you to pay the balance due (or we will return an overpayment) when you arrive in Leeds.

Up to contents: Back to LC97 homepage:

1. send a letter of application, and
2. ask your supervisor to send a brief recommendation letter.

Both letters should be sent to:
email: logic97@amsta.leeds.ac.uk or

Logic Colloquium '97, 
School of Mathematics,
The University of Leeds, 
Leeds LS2 9JT, UK.

e-mail is allowed, in fact encouraged.
The application letter should be brief (one page) and should include

1. your name,
2. your home institution,
3. your supervisor's name,
4. a one-paragraph description of your studies in logic, and
5. your estimate of the travel expenses you will incur.

(Only modest grants will be possible, partially covering travel costs and perhaps some of the living expenses during the meeting.)

Up to contents: Back to LC97 homepage:

Up to contents: Back to LC97 homepage:

Up to contents: Back to LC97 homepage:

• Association for Symbolic Logic,
• British Logic Colloquium,
• London Mathematical Society,
• IUHPS - Division of Logic, Methodology and Philosophy of Science

Up to contents: Back to LC97 homepage:

Logic Colloquium '97, 
School of Mathematics,
The University of Leeds, 
Leeds LS2 9JT, UK.

e-mail: logic97@amsta.leeds.ac.uk

Up to contents: Back to LC97 homepage: