Skip to content
Cart 
Register Sign in Wishlist
Logic Colloquium '01

Logic Colloquium '01

$118.00 USD

Part of Lecture Notes in Logic

Alexander Leitsch, Itay Neeman, Ulrich Berger, Paulo Oliva, Andrea Cantini, James Cummings, Harvey M. Friedman, D. M. Gabbay, N. Olivetti, Julia F. Knight, Pascal Koiran, Michiel van Laambalgen, Fritz Hamm, Chris Miller, Rahim N. Moosa, Karl-Georg Niebergall, Jan Reimann, Frank Stephan, Ralf Schindler, Saharon Shelah, Gaisi Takeuti, Frank Wagner, S. S. Wainer
View all contributors
  • Date Published: No date available
  • availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
  • format: Adobe eBook Reader
  • isbn: 9781108695442

$ 118.00 USD
Adobe eBook Reader

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

Looking for an inspection copy?

Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book

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 twentieth publication in the Lecture Notes in Logic series, contains the proceedings of the 2001 European Summer Meeting of the Association for Symbolic Logic, held at the Vienna University of Technology. Two long articles present accessible expositions on resolution theorem proving and the determinacy of long games. The remaining articles cover separate research topics in many areas of mathematical logic, including applications in computer science, proof theory, set theory, model theory, computability theory, linguistics and aspects of philosophy. This collection will interest not only mathematical logicians but also philosophical logicians, historians of logic, computer scientists, formal linguists and mathematicians working in algebra, abstract analysis and topology.

    • Features two long expository articles and seventeen research articles
    • Of interest to all specialists in mathematical logic, as well as researchers in computer science, philosophy and linguistics
    • With a number of articles aimed at non-specialists, it serves as a good introduction for graduate students
    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

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

    Preface
    Part I. Tutorials:
    1. Resolution theorem proving: a logical view Alexander Leitsch
    2. An introduction to proofs of determinacy of long games Itay Neeman
    Part II. Articles:
    3. Modified bar recursion and classical dependent choice Ulrich Berger and Paulo Oliva
    4. Choice and uniformity in weak applicative theories Andrea Cantini
    5. Compactness and incompactness phenomena in set theory James Cummings
    6. Selection for Borel relations Harvey M. Friedman
    7. Interpolation in goal-directed proof systems D. M. Gabbay and N. Olivetti
    8. Sequences of degrees associated with models of arithmetic Julia F. Knight
    9. The limit theory of generic polynomials Pascal Koiran
    10. Moschovakis's notion of meaning as applied to linguistics Michiel van Laambalgen and Fritz Hamm
    11. Tameness in expansions of the real field Chris Miller
    12. The model theory of compact complex spaces Rahim N. Moosa
    13. 'Natural' representations and extensions of Gödel's second theorem Karl-Georg Niebergall
    14. Effective Hausdorff dimension Jan Reimann and Frank Stephan
    15. Mutual stationarity in the core model Ralf Schindler
    16. The pair (אn, א0) may fail א0-compactness Saharon Shelah
    17. Incompleteness theorem and its frontier Gaisi Takeuti
    18. Groups in simple theories Frank Wagner
    19. Provable recursiveness and complexity S. S Wainer.

  • Editors

    Matthias Baaz, Technische Universität Wien, Austria
    Matthias Baaz is currently University Professor and Head of the Group for Computational Logic at the Institute of Discrete Mathematics and Geometry at the Technische Universität Wien, Austria.

    Sy-David Friedman, Universität Wien, Austria
    Sy-David Friedman works in the Kurt Gödel Research Center for Mathematical Logic at the Universität Wien, Austria.

    Jan Krajíček, Academy of Sciences of the Czech Republic, Prague
    Jan Krajíček works in the Mathematical Institute of the Academy of Sciences of the Czech Republic, Prague.

    Contributors

    Alexander Leitsch, Itay Neeman, Ulrich Berger, Paulo Oliva, Andrea Cantini, James Cummings, Harvey M. Friedman, D. M. Gabbay, N. Olivetti, Julia F. Knight, Pascal Koiran, Michiel van Laambalgen, Fritz Hamm, Chris Miller, Rahim N. Moosa, Karl-Georg Niebergall, Jan Reimann, Frank Stephan, Ralf Schindler, Saharon Shelah, Gaisi Takeuti, Frank Wagner, S. S. Wainer

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.
×