Skip to content
Register Sign in Wishlist

Admissible Sets and Structures

$160.00 (C)

Part of Perspectives in Logic

  • Date Published: March 2017
  • availability: Available
  • format: Hardback
  • isbn: 9781107168336

$ 160.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] 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. Admissible set theory is a major source of interaction between model theory, recursion theory and set theory, and plays an important role in definability theory. In this volume, the seventh publication in the Perspectives in Logic series, Jon Barwise presents the basic facts about admissible sets and admissible ordinals in a way that makes them accessible to logic students and specialists alike. It fills the artificial gap between model theory and recursion theory and covers everything the logician should know about admissible sets.

    • Accessible to logic students and specialists alike
    • Fills an artificial gap between model theory and recursion theory
    • Covers everything about admissible sets that a logician should know
    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

    • Date Published: March 2017
    • format: Hardback
    • isbn: 9781107168336
    • length: 408 pages
    • dimensions: 240 x 162 x 32 mm
    • weight: 0.8kg
    • contains: 21 b/w illus.
    • availability: Available
  • Table of Contents

    Introduction
    Part I. The Basic Theory:
    1. Admissible set theory
    2. Some admissible sets
    3. Countable fragments of L∞ω
    4. Elementary results on HYPM
    Part II. The Absolute Theory:
    5. The recursion theory of Σ1, predicates on admissible sets
    6. Inductive definitions
    Part III. Towards a General Theory:
    7. More about L∞ω
    8. Strict Π11 predicates and Koenig principles
    Appendix. Nonstandard compactness arguments and the admissible cover
    References
    Index of notation
    Subject index.

  • Author

    Jon Barwise, University of Wisconsin, Madison
    Jon Barwise works in the Department of Mathematics at the University of Wisconsin, Madison.

Related Books

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]

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 ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

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