
Lecture Notes in Logic, 24
Logic Colloquium '03
Viggo StoltenbergHansen, Jouko Väänänen, editors

A compilation of papers presented at the 2003 European Summer Meeting of the Association for Symbolic Logic, Logic Colloquium ’03 includes tutorials and research articles from some of the world’s preeminent logicians. One article is a tutorial on finite model theory and query languages that lie between first order and second order logic. The other articles cover current research topics in all areas of mathematical logic including Proof Theory, Set Theory, Model Theory, and Computability Theory, and Philosophy.
Year: 2006
Price:$35.00 ISBN:
1568812949
412 pages. Paperback.
BUY NOW
Year: 2006
Price:$75.00 ISBN:1568812930
417 pages. Hardcover.
BUY NOW
Table
of Contents
Tutorial
Michael Benedikt
Generalizing finite model theory
Research Articles
Arthur W. Apter
Indestructibility and strong compactness
Charles M. Boykin and Steve Jackson
Some applications of regular markers
Matthew Foreman
Has the continuum hypothesis been settled?
JeanYves Girard
Geometry of interaction IV:the feedback equation
Tapani Hyttinen
On local modularity in homogeneous structures
Michael C. Laskowski
Description set theory and uncountable model theory
Larisa Maksimova
Decidable properties oflogical calculi and of varieties of algebras
Ralph Matthes
Stabilization—an alternative to doublenegations translation for classical natural deduction
Dag Normann
Definability and reducibility in higher types over the reals
Erik Palmgren
Predicativity problems in pointfree topology
Wai Yan Pong
Rank inequalities in the theory of differentially closed fields
Pavel Pudlák
Consistency and games—in search of new combinatorial principles
Michael Rathjen
Realizability for constructive ZermeloFraenkel set theory
Saharon Shelah
On long EFequivalence in nonisomorphic models
Richard A. Shore and Theodore A. Slaman
The $\forall\exists$ theory of ${\mathcal D} (1leq,\vee,\prime)$ is undecidable
M.C. Stanley
Cocovering and set forcing
J.V. Tucker and J.I. Zucker
Abstract versus concrete computability: the case of countable algebras
<Back
to LNL titles listing