Skip to content
Register Sign in Wishlist
Logic Colloquium '03

Logic Colloquium '03

$105.00 ( ) USD

Part of Lecture Notes in Logic

Michael Benedikt, Arthur W. Apter, Charles M. Boykin, Steve Jackson, Matthew Foreman, Jean-Yves Girard, Tapani Hyttinen, Michael C. Lakowski, Larisa Maksimova, Ralph Matthes, Dag Normann, Erik Palmgren, Wai Yan Pong, Pavel Pudlák, Michael Rathjen, Saharon Shelah, Richard A. Shore, Theodore A. Slaman, M. C. Stanley, J. V. Tucker, J. I. Zucker
View all contributors
  • Publication planned for: April 2020
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9781108587143

$ 105.00 USD ( )
Adobe eBook Reader

You will be taken to ebooks.com for this purchase
Buy eBook Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Contains seventeen original research articles by leading logicians
    • Includes an extended tutorial on generalizing finite model theory
    • Appealing to all researchers and students in mathematical logic
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Publication planned for: April 2020
    • format: Adobe eBook Reader
    • isbn: 9781108587143
    • contains: 1 b/w illus.
    • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • Table of Contents

    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.

  • Editors

    Viggo Stoltenberg-Hansen, Uppsala Universitet, Sweden
    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.

    Jouko Väänänen, University of Helsinki
    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.

    Contributors

    Michael Benedikt, Arthur W. Apter, Charles M. Boykin, Steve Jackson, Matthew Foreman, Jean-Yves Girard, Tapani Hyttinen, Michael C. Lakowski, Larisa Maksimova, Ralph Matthes, Dag Normann, Erik Palmgren, Wai Yan Pong, Pavel Pudlák, Michael Rathjen, Saharon Shelah, Richard A. Shore, Theodore A. Slaman, M. C. Stanley, J. V. Tucker, J. I. Zucker

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×