A. Shen – författare
Visar alla böcker från författaren A. Shen. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Häftad, Engelska, 2002
567 kr
Skickas inom 5-8 vardagar
The main notions of set theory (cardinals, ordinals, transfinite induction) are fundamental to all mathematicians, not only to those who specialize in mathematical logic or set-theoretic topology. Basic set theory is generally given a brief overview in courses on analysis, algebra, or topology, even though it is sufficiently important, interesting, and simple to merit its own dedicated treatment.This book provides just that in the form of a leisurely exposition for a diversified audience. It is suitable for a broad range of readers, from undergraduate students to professional mathematicians who want to finally find out what transfinite induction is and why it is always replaced by Zorn's Lemma. The text introduces all main subjects of ""naive"" (nonaxiomatic) set theory: functions, cardinalities, ordered and well-ordered sets, transfinite induction and its applications, ordinals, and operations on ordinals. Included are discussions and proofs of the Cantor-Bernstein Theorem, Cantor's diagonal method, Zorn's Lemma, Zermelo's Theorem, and Hamel bases. With over 150 problems, the book is a complete and accessible introduction to the subject.
Inbunden, Engelska, 2014
539 kr
Skickas inom 10-15 vardagar
Through an empirical inquiry into three categories of offending women, Offending Women in Contemporary China: Gender and Pathways into Crime explores the socioeconomic conditions that facilitate womens' pathways into crime, and examines the interplay between gender, class, rapid social changes and female law-breaking in neoliberal China.
Häftad, Engelska, 2017
1 471 kr
Skickas inom 5-8 vardagar
Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory.The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the "Kolmogorov seminar" in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues.This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.