로그인이
필요합니다

도서를 검색해 주세요.

원하시는 결과가 없으시면 문의 주시거나 다른 검색어를 입력해보세요.

견본신청 문의
단체구매 문의
오탈자 문의

Sets and Proofs: Invited Papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997(1999) 요약정보 및 구매

상품 선택옵션 0 개, 추가옵션 0 개

사용후기 0 개
지은이 S. Barry CooperJohn K. Truss
발행년도 2013-11-20
판수 1판
페이지 446
ISBN 9780521635493
도서상태 구매가능
판매가격 54,000원
포인트 0점
배송비결제 주문시 결제

선택된 옵션

  • Sets and Proofs: Invited Papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997(1999)
    +0원
위시리스트

관련상품

  • Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at "Logic Colloquium "97" (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, postgraduate researchers, and the informed and interested nonspecialist.
  • 1. An introduction to finitary analyses of proof figures T. Arai 2. What mathematical truth could not be - II P. Benacerraf 3. Proof search in constructive logics R. Dyckhoff and L. F. Pinto 4. David's trick S. D. Friedman 5. A semantical calculus for intuitionistic propositional logic J. Hudelmaier 6. An iteration model violating the singular cardinals hypothesis P. Koepke 7. An introduction to core model theory B. Lwe and J. R. Steel 8. Games of countable length I. Neeman 9. On the complexity of the propositional calculus P. Pudlak 10. The realm of ordinal analysis M. Rathjen 11. Covering properties of core models E. Schimmerling 12. Ordinal systems A. Setzer 13. Polish group topologies S. Solecki 14. Forcing closed unbounded subsets of Nw+1 M. C. Stanley 15. First steps into metapredicativity in explicit mathematics T. Strahm 16. What makes a (pointwise) subrecursive hierarchy slow growing? A. Weiermann 17. Minimality arguments for infinite time Turing degrees P. D. Welch.
  • Professor of Mathematical Logic in the School of Mathematics at the University of Leeds. A graduate of the University of Oxford, he obtained his doctorate on "Degrees of Unsolvability" from the University of Leicester, working with Reuben Louis Goodstein, and C. E. M. Yates at the University of Manchester. His research follows that of Alan Turing in its focus on the nature of mental and physical computation. It seeks to characterise the computational framework underlying emergence in nature and the causal structure of the real universe. Author and editor of numerous books, including Computability Theory, New Computational Paradigms, and Computability in Context, he is a leading advocate of multidisciplinary research at the interface between what is known to be computable, and theoretical and practical incomputability. He is chair of the Turing Centenary Advisory Committee, which coordinates the wide range of Turing Centenary activities, is president of the association Computability in Europe, which is responsible for the largest computability-themed international conference series, and chairs the Editorial Board of its Springer book series "Theory and Applications of Computability." He is an organizer of the 2012 Isaac Newton Institute programme "Semantics and Syntax: A Legacy of Alan Turing" in Cambridge.
  • 학습자료


    등록된 학습자료가 없습니다.

    정오표


    등록된 정오표가 없습니다.

  • 상품 정보

    상품 정보 고시

  • 사용후기

    등록된 사용후기

    사용후기가 없습니다.

  • 상품문의

    등록된 상품문의

    상품문의가 없습니다.

  • 배송/교환정보

    배송정보

    cbff54c6728533e938201f4b3f80b6da_1659402509_9472.jpg

    교환/반품 정보

    cbff54c6728533e938201f4b3f80b6da_1659402593_2152.jpg
     

선택된 옵션

  • Sets and Proofs: Invited Papers from Logic Colloquium '97 - European Meeting of the Association for Symbolic Logic, Leeds, July 1997(1999)
    +0원