INTRODUCTION:
There will be two volumes devoted to refereed invited
articles from
Logic Colloquium 1997. These will be 'Models and Computability'
(ISBN: 0521635500)
and 'Sets and Proofs' (ISBN:
0521635497), edited by S. Barry Cooper and
John K. Truss, and published by Cambridge University Press in their
London Mathematical Society Lecture Notes Series (nos. 259 and
258, respectively). The books
were sent to CUP on November 27, 1998, for publication
in March or April 1999.
Current information on each article can be found below. Enquiries
from
authors should be sent to the appropriate editor
(
=
Barry Cooper,
= John Truss).
Up to contents:
Back to
LC97
homepage: 
Ulrich Berger :
Continuous functionals of dependent and transfinite
types.
(22, final version received)
Cristian Calude, Richard
Coles, Peter Hertling and
Bakhadyr Khoussainov:
Degree-theoretic aspects
of computably enumerable reals. (17, final version received)
Zoe Chatzidakis:
Simplicity and independence for pseudo-algebraically closed fields.
(21 pages, final version received)
S. Barry Cooper:
Clockwork or Turing U/universe? - Remarks on causal
determinism and computability.
(54 pages, final version received)
William Gasarch and Frank Stephan:
A Techniques-Oriented Survey of Bounded Queries.
(40, final version received)
Wilfrid A. Hodges:
Relative categoricity
in abelian groups. (12, final version received)
Neil D. Jones:
Computability and complexity revisited. (24,
final version received)
Bakhadyr Khoussainov and
Richard A. Shore: Effective model theory: the
number of models and their complexity. (47, final version received)
Byunghan Kim:
A Survey on Canonical Bases in Simple Theories.
(14, final version received)
Julia Knight:
True approximations and models of arithmetic.
(24, final version received)
Ludomir Newelski:
On
the topological stability conjecture (14, final version
received)
Dag Normann:
A Mahlo-Universe of effective domains with totality.
(20, final version received)
David Over:
Logic and decision making.
(26, final version received)
Michael Y. Prest:
The sheaf of locally definable scalars over
a ring. (13, final version received)
Lance Rips:
Human styles of quantificational reasoning.
(13, final version received)
Gerald E. Sacks:
Recursion Theoretic Memories 1954--1978.
(10, final version received)
Katrin Tent:
Fields Definable in Simple Groups. (11, final version received)
Jaap van Oosten:
A combinatory algebra for sequential functionals of
finite type.
(17, final version received)
Alex J. Wilkie:
Model theory of analytic and smooth functions.
(13, final version received)
Back to LC97 homepage:
Toshiyasu Arai :
An introduction to finitary analyses of proof figures
(25, final version received)
Paul Benacerraf:
What Mathematical Truth Could Not Be - II,
or Through a Glass Darkly.
(25, final version received)
Roy Dyckhoff and Luis Pinto:
Proof search in constructive logics.
(13, final version received)
Sy D. Friedman:
David's Trick.
(5, final version received)
Joerg Hudelmaier :
A semantical calculus for intuitionistic propositional
logic.
(22, final version received)
Peter Koepke:
An Iteration Model violating the Singular
Cardinals Hypothesis.
(8, final version received)
Benedikt Löwe and John Steel:
An Introduction to Core Model Theory.
(55, final version received)
Itay Neeman:
Games of countable length.
(38, final version received)
Pavel Pudlak:
On the complexity of the propositional calculus.
(22, final version received)
Michael Rathjen :
The realm of ordinal analysis.
(61, final version received)
Ernest Schimmerling:
Covering properties of core models.
(19, final version received)
Anton G. Setzer:
Ordinal systems.
(38, final version received)
Slawomir Solecki:
Polish group topologies.
(26, final version received)
Maurice C. Stanley:
Forcing closed unbounded subsets of $\aleph_{\omega+1}$.
(17, final version received)
Thomas Strahm:
First steps into metapredicativity in explicit mathematics.
(20, final version received)
Andreas Weiermann:
What makes a (pointwise) subrecursive hierarchy slow
growing?
(21, final version received)
Philip Welch:
Minimality arguments for Infinite
Time Turing Degrees.
(12, final version received)
Up to contents:
Back to LC97 homepage:
Articles should be prepared, and sent to the appropriate editor, in either TeX or LaTeX. The CUP TeX guidelines are very simple:
Fonts should be 12pt or 10pt scaled up (magstep1). Textheight (excluding running heads and page numbers) should be 215truemm. Textwidth should be 138truemm.
Also:
Diagrams should either be integrated into the articles, or spaces should be left in the articles, of the appropriate size for the diagrams, if we are to do any redrawing or pasting in.
The rest is not strictly necessary, but preferable:
Running heads should be centred and italic if possible. Page numbers should be at the top of the page, flush left for even numbers and flush right for odds. CUP prefer the parskip to be set to zero and the parindent to be set to something like 16pt.
We have two specimen defn. files (TeX or LaTeX) for those who find them useful. (But they may not suit all flavours of TeX or LaTeX, and you may prefer other ways of achieving similar results.)
Please do not worry if any of this is a problem - we are happy fix it ourselves if you prefer. Also note: Our deadline, to allow the minimal amount of time for refereeing and reformatting, is April 1998. The deadlines after the articles listed above are to help the authors and the editors, and can be modified if needed (as can estimates of page length). But please do not rely on things dragging on past July '98. We intend to meet our CUP contractual deadline!
Up to contents:
Back to LC97 homepage:
