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.

Large cardinal hypotheses play a central role in modern set theory. One important way to understand such hypotheses is to construct concrete, minimal universes, or "core models," satisfying them. Since Godel's pioneering work on the universe of constructible sets, several larger core models satisfying stronger hypotheses have been constructed, and these have proved quite useful. Here the author extends this theory so that it can produce core models satisfying "There is a Woodin cardinal," a large cardinal hypothesis which is the focus of much current research. The book is intended for advanced graduate students and reseachers in set theory."

1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles.

Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Godel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.

This reprint of the original 1914 edition of this famous work contains many topics that had to be omitted from later editions, notably, Symmetric Sets, Principle of Duality, most of the 'Algebra' of Sets, Partially Ordered Sets, Arbitrary Sets of Complexes, Normal Types, Initial and Final Ordering, Complexes of Real Numbers, General Topological Spaces, Euclidean Spaces, the Special Methods Applicable in the Euclidean Plane, Jordan's Separation Theorem, the Theory of Content and Measure, the Theory of the Lebesgue Integral. The text is in German.

Les buts principaux de cet ouvrage qui comble un vide sont de:

- donner les concepts et r sultats fondamentaux sur les ensembles ordonn?'s finis,

- pr senter leurs usages dans des domaines vari?'s (de la RO ou l IA la micro- conomie),

- signaler un certain nombre de r sultats et de recherches en cours.

Symmetric Boolean functions have played an important role in many aspects of design automation for many years. This book summarizes developments and provides a collection of new tools and techniques that can be used to advance the study of Boolean functions. Moreover, Boolean functions provide the necessary framework for expressing the operation of logic gates, which are the key building units for the accomplishment of signal processing tasks in fundamental and system-oriented levels. The book concludes with a discussion on how Boolean functions can be used to ensure the minimum degree of logical functionality between light-wave modulated signals.

Slenderness is a concept relevant to the fields of algebra, set theory, and topology. This first book on the subject is systematically presented and largely self-contained, making it ideal for researchers and graduate students. The appendix gives an introduction to the necessary set theory, in particular to the (non-)measurable cardinals, to help the reader make smooth progress through the text. A detailed index shows the numerous connections among the topics treated. Every chapter has a historical section to show the original sources for results and the subsequent development of ideas, and is rounded off with numerous exercises. More than 100 open problems and projects are presented, ready to inspire the keen graduate student or researcher. Many of the results are appearing in print for the first time, and many of the older results are presented in a new light.

This volume explores A.P. Morse's (1911-1984) development of a formal language for writing mathematics, his application of that language in set theory and mathematical analysis, and his unique perspective on mathematics. The editor brings together a variety of Morse's works in this compilation, including Morse's book A Theory of Sets, Second Edition (1986), in addition to material from another of Morse's publications, Web Derivatives, and notes for a course on analysis from the early 1950's. Because Morse provided very little in the way of explanation in his written works, the editor's commentary serves to outline Morse's goals, give informal explanations of Morse's formal language, and compare Morse's often unique approaches to more traditional approaches. Minor corrections to Morse's previously published works have also been incorporated into the text, including some updated axioms, theorems, and definitions. The editor's introduction thoroughly details the corrections and changes made and provides readers with valuable insight on Morse's methods. A.P. Morse's Set Theory and Analysis will appeal to graduate students and researchers interested in set theory and analysis who also have an interest in logic. Readers with a particular interest in Morse's unique perspective and in the history of mathematics will also find this book to be of interest.

Set Theoretical Aspects of Real Analysis is built around a number of questions in real analysis and classical measure theory, which are of a set theoretic flavor. Accessible to graduate students, and researchers the beginning of the book presents introductory topics on real analysis and Lebesgue measure theory. These topics highlight the boundary between fundamental concepts of measurability and nonmeasurability for point sets and functions. The remainder of the book deals with more specialized material on set theoretical real analysis. The book focuses on certain logical and set theoretical aspects of real analysis. It is expected that the first eleven chapters can be used in a course on Lebesque measure theory that highlights the fundamental concepts of measurability and non-measurability for point sets and functions. Provided in the book are problems of varying difficulty that range from simple observations to advanced results. Relatively difficult exercises are marked by asterisks and hints are included with additional explanation. Five appendices are included to supply additional background information that can be read alongside, before, or after the chapters. Dealing with classical concepts, the book highlights material not often found in analysis courses. It lays out, in a logical, systematic manner, the foundations of set theory providing a readable treatment accessible to graduate students and researchers.

Information granules, as encountered in natural language, are implicit in nature. To make them fully operational so they can be effectively used to analyze and design intelligent systems, information granules need to be made explicit. An emerging discipline, granular computing focuses on formalizing information granules and unifying them to create a coherent methodological and developmental environment for intelligent system design and analysis. Granular Computing: Analysis and Design of Intelligent Systems presents the unified principles of granular computing along with its comprehensive algorithmic framework and design practices. Introduces the concepts of information granules, information granularity, and granular computing Presents the key formalisms of information granules Builds on the concepts of information granules with discussion of higher-order and higher-type information granules Discusses the operational concept of information granulation and degranulation by highlighting the essence of this tandem and its quantification in terms of the associated reconstruction error Examines the principle of justifiable granularity Stresses the need to look at information granularity as an important design asset that helps construct more realistic models of real-world systems or facilitate collaborative pursuits of system modeling Highlights the concepts, architectures, and design algorithms of granular models Explores application domains where granular computing and granular models play a visible role, including pattern recognition, time series, and decision making Written by an internationally renowned authority in the field, this innovative book introduces readers to granular computing as a new paradigm for the analysis and synthesis of intelligent systems. It is a valuable resource for those engaged in research and practical developments in computer, electrical, industrial, manufacturing, and biomedical engineering. Building from fundamentals, the book is also suitable for readers from nontechnical disciplines where information granules assume a visible position.

Celebrating the work of world-renowned mathematician Sam B. Nadler, Jr., this reference examines the most recent advances in the analysis of continua. The book offers articles on the contributions of Professor Nadler, theorems on the structure and uniqueness of hyperspaces, results on the dynamics of solenoids, examples involving inverse limits of maps of the interval conditions on embeddability of hyperspaces and symmetric products, open problems on a number of topics. It examines boundary bumping theorems, fixed point theorems for nonseparating plane continua, Whitney maps and Whitney properties, topological entropy for arc-like continua, a variety of mapping properties, and more.

How can the infinite, a subject so remote from our finite experience, be an everyday tool for the working mathematician? Blending history, philosophy, mathematics, and logic, Shaughan Lavine answers this question with exceptional clarity. Making use of the mathematical work of Jan Mycielski, he demonstrates that knowledge of the infinite is possible, even according to strict standards that require some intuitive basis for knowledge.

Mathematical systems theory is a vibrant research area in its own right. The theory has an impact in numerous applications areas including aeronautics, biological systems, chemical engineering, communication systems, financial engineering and robotics to name just a few. This volume contains survey and research articles by some of the leading researchers in mathematical systems theory. Many authors have taken special care that their articles are self-contained and accessible also to non-specialists. The articles contained in this volume are from those presented as plenary lectures, invited one hour lectures and minisymposia at the 15th International Symposium on the Mathematical Theory of Networks and Systems held at the University of Notre Dame, August 12-16, 2002.

An introduction to mathematical logic covering all the usual topics: compactness and axiomatizability of semantical consequence; Lowenheim-Skolem-Tarski theorems; prenex and other normal forms; and characterizations of elementary classes with help of ultraproducts. Logic is based exclusively on semantics. Truth and satisfiability of formulas in structures are the basic notions, and there is no need to mention logical calculi with axioms and rules (they are the subjects of Volume Two). The methods are algebraic in the sense that notions such as homomorphisms and congruence relations are applied throughout, and this not just as abbreviations, but in order to gain new insights. These concepts are developed in an introductory chapter which, together with chapters five to nine on equations, can be viewed as a first course on universal algebra. The approach to algorithms generating semantical consequences is algebraic as well: for equations in algebras, for propositional formulas, for open formulas of predicate logic, and for the formulas of quantifier logic. The structural description of logical consequence is a straightforward extension of that of equational consequence as long as Bool