Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Non-Hausdorff Topology and Domain Theory
Selected Topics in Point-Set Topology

$113.00 (C)

Part of New Mathematical Monographs

  • Date Published: May 2013
  • availability: In stock
  • format: Hardback
  • isbn: 9781107034136

$ 113.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 collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This unique book on modern topology looks well beyond traditional treatises and explores spaces that may, but need not, be Hausdorff. This is essential for domain theory, the cornerstone of semantics of computer languages, where the Scott topology is almost never Hausdorff. For the first time in a single volume, this book covers basic material on metric and topological spaces, advanced material on complete partial orders, Stone duality, stable compactness, quasi-metric spaces and much more. An early chapter on metric spaces serves as an invitation to the topic (continuity, limits, compactness, completeness) and forms a complete introductory course by itself. Graduate students and researchers alike will enjoy exploring this treasure trove of results. Full proofs are given, as well as motivating ideas, clear explanations, illuminating examples, application exercises and some more challenging problems for more advanced readers.

    • The only topology book that covers domain theory (essential for modern computer science)
    • Material becomes progressively more advanced to suit both graduate students and experienced researchers
    • Includes a variety of more than 450 exercises to challenge readers at every level
    Read more

    Reviews & endorsements

    "The presentation is very well thought out and lively, and the topic selection shows great care on the part of the author. The book will certainly be a very welcome addition to the topological literature … this is certainly topology done well, presented in a highly readable form."
    Alexander Yurievich Shibakov, Mathematical Reviews

    "It is well written, and profusely (and helpfully) illustrated. The notation is well-chosen, and the numerous exercises are well-integrated into the text, so that it would make a good self-study text."
    Peter Johnstone, Bulletin of the London Mathematical Society

    "The presentation is highly original … [this] book brings a refreshing perspective to topology … the material has obviously been chosen with great care and the book is very well written."
    Hans-Peter Künzi, Zentralblatt MATH

    See more reviews

    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: May 2013
    • format: Hardback
    • isbn: 9781107034136
    • length: 497 pages
    • dimensions: 235 x 157 x 28 mm
    • weight: 0.82kg
    • contains: 46 b/w illus. 485 exercises
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Elements of set theory
    3. A first tour of topology: metric spaces
    4. Topology
    5. Approximation, and function spaces
    6. Metrics, quasi-metrics, hemi-metrics
    7. Completeness
    8. Sober spaces
    9. Stably compact spaces, and compact pospaces
    References
    Notation index
    Index.

  • Resources for

    Non-Hausdorff Topology and Domain Theory

    Jean Goubault-Larrecq

    General Resources

    Welcome to the resources site

    Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    *This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.


    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email lecturers@cambridge.org

  • Author

    Jean Goubault-Larrecq, Ecole Normale Supérieure de Cachan
    Jean Goubault-Larrecq is Full Professor of Computer Science at the École Normale Supérieure de Cachan, France. He obtained his PhD in 1993 from the École Polytechnique in the field of automated deduction, and since then he has led an active career in several fields of computer science: logic, computer security, semantics, domain theory, probabilistic and non-deterministic systems. He is currently heading team SECSI (security of information systems) at INRIA, France's national institute for research in computer science and control. He is the recipient of the 2011 CNRS Silver Medal in the field of computer science and its interactions. This is the highest scientific distinction in computer science in France.

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

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