"This accessible approach to set theory for upper-level undergraduates poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. A historical introduction is followed by discussions of classes and sets, functions, natural and cardinal numbers, the arithmetic of ordinal numbers, and related topics. 1971 edition with new material by the author"--

This undergraduate text develops its subject through observations of the physical world, covering finite sets, cardinal numbers, infinite cardinals, and ordinals. Includes exercises with answers. 1958 edition.

In this book, first published in 2003, categorical algebra is used to build a foundation for the study of geometry, analysis, and algebra.

Author and artist Mark Bennett compiles his entertaining collection of blueprints extrapolated from the storylines and sets of the 1950s to 1980s television sitcom homes millions of Americans grew up with. An extraordinary work of imagination, these blueprints of TV homes that are as familiar to us as our neighbor's den and backyard give us a fascinating "real life" view that the camera angles never offered. From Ward and June Cleaver's house to Rob and Laura Petrie's apartment to Mary Richards's Minneapolis bachelorette apartment to the Jetson's "house" in the clouds, each home is lovingly recreated with painstaking precision in the fine blue lines of architectural blueprints.

Suitable for advanced undergraduates and graduate students, this text introduces the broad scope of convexity. It leads students to open questions and unsolved problems, and it highlights diverse applications. Author Steven R. Lay, Professor of Mathematics at Lee University in Tennessee, reinforces his teachings with numerous examples, plus exercises with hints and answers. The first three chapters form the foundation for all that follows, starting with a review of the fundamentals of linear algebra and topology. They also survey the development and applications of relationships between hyperplanes and convex sets. Subsequent chapters are relatively self-contained, each focusing on a particular aspect or application of convex sets. Topics include characterizations of convex sets, polytopes, duality, optimization, and convex functions. Hints, solutions, and references for the exercises appear at the back of the book.

An introduction to the basic tools of the theory of (partially) ordered sets such as visualization via diagrams, subsets, homomorphisms, important order-theoretical constructions and classes of ordered sets. Using a thematic approach, the author presents open or recently solved problems to motivate the development of constructions and investigations for new classes of ordered sets. The text can be used as a focused follow-up or companion to a first proof (set theory and relations) or graph theory course.

Among other subjects explored are the Clements-Lindström extension of the Kruskal-Katona theorem to multisets and the Greene-Kleitmen result concerning k-saturated chain partitions of general partially ordered sets. Includes exercises and solutions.

From the Preface to the first edition (1906): "A few of the most modern books on the Theory of Functions devote some pages to the establishment of certain results belonging to our subject, and required for the special purposes in hand... But we may fairly claim that the present work is the first attempt at a systematic exposition of the subject as a whole."

This is the first monograph on codebooks and linear codes from difference sets and almost difference sets. It aims at providing a survey of constructions of difference sets and almost difference sets as well as an in-depth treatment of codebooks and linear codes from difference sets and almost difference sets. To be self-contained, this monograph covers necessary mathematical foundations and the basics of coding theory. It also contains tables of best BCH codes and best cyclic codes over GF(2) and GF(3) up to length 125 and 79, respectively. This repository of tables can be used to benchmark newly constructed cyclic codes. This monograph is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications.

Volume IV of the Transactions on Rough Sets (TRS) introduces a number of new advances in the theory and application of rough sets. Rough sets and - proximationspaceswereintroducedmorethan30yearsagobyZdzis lawPawlak. These advances have profound implications in a number of research areas such as the foundations of rough sets, approximate reasoning, arti?cial intelligence, bioinformatics,computationalintelligence, cognitivescience, intelligentsystems, datamining,machineintelligence,andsecurity. Inaddition,itisevidentfromthe papers included in this volume that the foundations and applications of rough sets is a very active research area worldwide. A total of 16 researchers from 7 countries are represented in this volume, namely, Canada, India, Norway, S- den, Poland, Russia and the United States of America. Evidence of the vigor, breadth and depth of research in the theory and applications of rough sets can be found in the 10 articles in this volume. Prof. Pawlak has contributed a treatise on the philosophical underpinnings of rough sets. In this treatise, observations are made about the Cantor notion of a set, antinomies arising from Cantor sets, the problem of vagueness (es- cially, vague (imprecise) concepts), fuzzy sets, rough sets, fuzzy vs. rough sets as well as logic and rough sets. Among the many vistas and research directions suggested by Prof. Pawlak, one of the most fruitful concerns the model for a rough membership function, which was incarnated in many di?erent forms since its introduction by Pawlakand Skowronin 1994. Recall, here, that Prof.