Stoltenberg-Hansen / Väänänen Logic Colloquium '03

Erscheinungsjahr 2020
ISBN: 978-1-108-58714-3
Verlag: Cambridge University Press
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, Band 24, 0 Seiten

Reihe: Lecture Notes in Logic

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the twenty-fourth publication in the Lecture Notes in Logic series, contains the proceedings of the European Summer Meeting of the Association for Symbolic Logic, held in Helsinki, Finland, in August 2003. These articles include an extended tutorial on generalizing finite model theory, as well as seventeen original research articles spanning all areas of mathematical logic, including proof theory, set theory, model theory, computability theory and philosophy.

Autoren/Hrsg.

Stoltenberg-Hansen, Viggo

Väänänen, Jouko

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Introduction; Part I. Tutorial: 1. Generalizing finite model theory Michael Benedikt; Part II. Research Articles: 2. Indestructibility and strong compactness Arthur W. Apter; 3. Some applications of regular markers Charles M. Boykin and Steve Jackson; 4. Has the continuum hypothesis been settled? Matthew Foreman; 5. Geometry of interaction IV: the feedback equation Jean-Yves Girard; 6. On local modularity in homogeneous structures Tapani Hyttinen; 7. Descriptive set theory and uncountable model theory Michael C. Lakowski; 8. Decidable properties of logical calculi and of varieties of algebras Larisa Maksimova; 9. Stabilization – an introduction to double-negation translation for classical natural deduction Ralph Matthes; 10. Definability and reducibility in higher types over the reals Dag Normann; 11. Predicativity problems in point-free topology Erik Palmgren; 12. Rank inequalities in the theory of differentially closed fields Wai Yan Pong; 13. Consistency and games – in search of new combinatorial principles Pavel Pudlák; 14. Realizability for constructive Zermelo–Fraenkel set theory Michael Rathjen; 15. On long EF-equivalence in non-isomorphic models Saharon Shelah; 16. The \forall\exists theory of D(<,V,') is undecidable Richard A. Shore and Theodore A. Slaman; 17. Cocovering and set forcing M. C. Stanley; 18. Abstract versus concrete computability: the case of countable algebras J. V. Tucker and J. I. Zucker.

Über Autor(innen)

Väänänen, Jouko
Jouko Väänänen is a professor at the University of Helsinki, Finland where he researches foundations of mathematics, logic in computer science, semantics of natural language, games, generalized quantifiers, infinitary languages, abstract logic, model theory and set theory.

Stoltenberg-Hansen, Viggo
Viggo Stoltenberg-Hansen is a Professor at Uppsala Universitet, Sweden and researches computability theory, constructive mathematics, type theory, domain theory, categorical logic and model theory.