In this book the authors present an alternative set theory dealing with a more relaxed notion of infiniteness, called finitely supported mathematics (FSM). It has strong connections to the Fraenkel-Mostowski (FM) permutative model of Zermelo-Fraenkel (ZF) set theory with atoms and to the theory of (generalized) nominal sets. More exactly, FSM is ZF mathematics rephrased in terms of finitely supported structures, where the set of atoms is infinite (not necessarily countable as for nominal sets). In FSM, 'sets' are replaced either by `invariant sets' (sets endowed with some group actions satisfying a finite support requirement) or by `finitely supported sets' (finitely supported elements in the powerset of an invariant set). It is a theory of `invariant algebraic structures' in which infinite algebraic structures are characterized by using their finite supports. After explaining the motivation for using invariant sets in the experimental sciences as well as the connections with the nominal approach, admissible sets and Gandy machines (Chapter 1), the authors present in Chapter 2 the basics of invariant sets and show that the principles of constructing FSM have historical roots both in the definition of Tarski `logical notions' and in the Erlangen Program of Klein for the classification of various geometries according to invariants under suitable groups of transformations. Furthermore, the consistency of various choice principles is analyzed in FSM. Chapter 3 examines whether it is possible to obtain valid results by replacing the notion of infinite sets with the notion of invariant sets in the classical ZF results. The authors present techniques for reformulating ZF properties of algebraic structures in FSM. In Chapter 4 they generalize FM set theory by providing a new set of axioms inspired by the theory of amorphous sets, and so defining the extended Fraenkel-Mostowski (EFM) set theory. In Chapter 5 they define FSM semantics for certain process calculi (e.g., fusion calculus), and emphasize the links to the nominal techniques used in computer science. They demonstrate a complete equivalence between the new FSM semantics (defined by using binding operators instead of side conditions for presenting the transition rules) and the known semantics of these process calculi. The book is useful for researchers and graduate students in computer science and mathematics, particularly those engaged with logic and set theory.

In this book; the information on how to do what I am (Jeremiah Semien) is doing to make it; in the enrtainment business.

Number theory, spectral geometry, and fractal geometry are interlinked in this in-depth study of the vibrations of fractal strings, that is, one-dimensional drums with fractal boundary. Throughout Geometry, Complex Dimensions and Zeta Functions, Second Edition, new results are examined and a new definition of fractality as the presence of nonreal complex dimensions with positive real parts is presented. The new final chapter discusses several new topics and results obtained since the publication of the first edition.

..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. .... The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists." Acta Scientiarum Mathematicarum, Ungarn 1988 ..."The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be." Zentralblatt fur Mathematik, 623.1988

Published in honor of Victor L. Selivanov, the 17 articles collected in this volume inform on the latest developments in computability theory and its applications in computable analysis; descriptive set theory and topology; and the theory of omega-languages; as well as non-classical logics, such as temporal logic and paraconsistent logic. This volume will be of interest to mathematicians and logicians, as well as theoretical computer scientists.

While intuitionistic (or constructive) set theory IST has received a certain attention from mathematical logicians, so far as I am aware no book providing a systematic introduction to the subject has yet been published. This may be the case in part because, as a form of higher-order intuitionistic logic - the internal logic of a topos - IST has been chiefly developed in a tops-theoretic context. In particular, proofs of relative consistency with IST for mathematical assertions have been (implicitly) formulated in topos- or sheaf-theoretic terms, rather than in the framework of Heyting-algebra-valued models, the natural extension to IST of the well-known Boolean-valued models for classical set theory. In this book I offer a brief but systematic introduction to IST which develops the subject up to and including the use of Heyting-algebra-valued models in relative consistency proofs. I believe that IST, presented as it is in the familiar language of set theory, will appeal particularly to those logicians, mathematicians and philosophers who are unacquainted with the methods of topos theory.

This classic of mathematics presents the best systematic elementary account of the modern theory of the continuum as a type of serial order. Based on the Dedekind-Cantor ordinal theory, it requires no knowledge of higher mathematics. Includes 119 footnotes, mostly bibliographical. "An admirable introduction." -- "Science Progress." 1917 edition.

Introduction to Modern Set Theory is designed for a one-semester course in set theory at the advanced undergraduate or beginning graduate level. Three features are the full integration into the text of the study of models of set theory, the use of illustrative examples both in the text and in the exercises, and the integration of consistency results and large cardinals into the text early on. This book is aimed at two audiences: students who are interested in studying set theory for its own sake, and students in other areas who may be curious about applications of set theory to their field. In particular, great care is taken to develop the intuitions that lie behind modern, as well as classical, set theory, and to connect set theory with the rest of mathematics.

The chief purpose of the book is to present, in detail, a compilation of proofs of the Cantor-Bernstein Theorem (CBT) published through the years since the 1870's. Over thirty such proofs are surveyed.

The book comprises five parts. In the first part the discussion covers the role of CBT and related notions in the writings of Cantor and Dedekind. New views are presented, especially regarding the general proof of CBT obtained by Cantor, his proof of the Comparability Theorem, the ruptures in the Cantor-Dedekind correspondence and the origin of Dedekind's proof of CBT.

The second part covers the first CBT proofs published (1896-1901). The works of the following mathematicians is considered in detail: Schroder, Bernstein, Bore, Schoenflies and Zermelo. Here a subtheme of the book is launched; it concerns the research project following Bernstein's Division Theorem (BDT).

In its third part the book covers proofs that emerged during the period when the logicist movement was developed (1902-1912). It covers the works of Russell and Whitehead, Jourdain, Harward, Poincare, J. Konig, D. Konig (his results in graph theory), Peano, Zermelo, Korselt. Also Hausdorff's paradox is discussed linking it to BDT.

In the fourth part of the book are discussed the developments of CBT and BDT (including the inequality-BDT) in the hands of the mathematicians of the Polish School of Logic, including Sierpi ski, Banach, Tarski, Lindenbaum, Kuratowski, Sikorski, Knaster, the British Whittaker, and Reichbach.

Finally, in the fifth part, the main discussion concentrates on the attempts to port CBT to intuitionist mathematics (with results by Brouwer, Myhill, van Dalen and Troelstra) and to Category Theory (by Trnkova and Koubek).The second purpose of the book is to develop a methodology for the comparison of proofs. The core idea of this methodology is that a proof can be described by two descriptors, called gestalt and metaphor. It is by comparison of their descriptors that the comparison of proofs is obtained. The process by which proof descriptors are extracted from a proof is named 'proof-processing', and it is conjectured that mathematicians perform proof-processing habitually, in the study of proofs.

Ernst Zermelo (1871-1953) is regarded as the founder of axiomatic set theory and best-known for the first formulation of the axiom of choice. However, his papers include also pioneering work in applied mathematics and mathematical physics.

This edition of his collected papers will consist of two volumes. Besides providing a biography, the present Volume I covers set theory, the foundations of mathematics, and pure mathematics and is supplemented by selected items from his Nachlass and part of his translations of Homer's Odyssey. Volume II will contain his work in the calculus of variations, applied mathematics, and physics.

The papers are each presented in their original language together with an English translation, the versions facing each other on opposite pages. Each paper or coherent group of papers is preceded by an introductory note provided by an acknowledged expert in the field which comments on the historical background, motivations, accomplishments, and influence.

This book provides a self-contained introduction to modern set theory and also opens up some more advanced areas of current research in this field. The first part offers an overview of classical set theory wherein the focus lies on the axiom of choice and Ramsey theory. In the second part, the sophisticated technique of forcing, originally developed by Paul Cohen, is explained in great detail. With this technique, one can show that certain statements, like the continuum hypothesis, are neither provable nor disprovable from the axioms of set theory. In the last part, some topics of classical set theory are revisited and further developed in the light of forcing. The notes at the end of each chapter put the results in a historical context, and the numerous related results and the extensive list of references lead the reader to the frontier of research. This book will appeal to all mathematicians interested in the foundations of mathematics, but will be of particular use to graduates in this field.

2011 Reprint of 1960 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. Paul Richard Halmos (1916-2006) was a Hungarian-born American mathematician who made fundamental advances in the areas of probability theory, statistics, operator theory, ergodic theory, and functional analysis (in particular, Hilbert spaces). He was also recognized as a great mathematical expositor. ..".He (the author) uses the language and notation of ordinary informal mathematics to state the basic set-theoretic facts which a beginning student of advanced mathematics needs to know...Because of the informal method of presentation, the book is eminently suited for use as a textbook or for self-study. The reader should derive from this volume a maximum of understanding of the theorems of set theory and of their basic importance in the study of mathematics." - "Philosophy and Phenomenological Research."

Grigori Mints is one the most distinguished proof theorists of our time. He has contributed significantly not only to the subject in general but also to most of its applications. This collection of papers by a number of Mints' colleagues worldwide are both a personal tribute and a testimony to his breadth and importance by dealing with all areas in which Mints has worked: from proof-theoretical reductions through non-classical logics and category theory to automated theorem proving and proof mining, i.e., the extraction of mathematical information from formal proofs. The collection itself is significant for another reason: it bridges the two logical worlds in which Mints has worked, the world of the former Soviet Union and that of the West.

This book is an introduction to modern cardinal arithmetic, developed in the frame of the axioms of Zermelo-Fraenkel set theory together with the axiom of choice. It splits into three parts. Part one, which is contained in Chapter 1, describes the classical cardinal arithmetic due to Bernstein, Cantor, Hausdorff, Konig, and Tarski. The results were found in the years between 1870 and 1930. Part two, which is Chapter 2, characterizes the development of cardinal arith metic in the seventies, which was led by Galvin, Hajnal, and Silver. The third part, contained in Chapters 3 to 9, presents the fundamental investigations in pcf-theory which has been developed by S. Shelah to answer the questions left open in the seventies. All theorems presented in Chapter 3 and Chapters 5 to 9 are due to Shelah, unless otherwise stated. We are greatly indebted to all those set theorists whose work we have tried to expound. Concerning the literature we owe very much to S. Shelah's book [Sh5] and to the article by M. R. Burke and M. Magidor [BM] which also initiated our students' interest for Shelah's pcf-theory.

Reprint. Paperback. 387 pp. Diophantus of Alexandria, sometimes called "the father of algebra," was an Alexandrian mathematician and the author of a series of books called Arithmetica. These texts deal with solving algebraic equations, many of which are now lost. In studying Arithmetica, Pierre de Fermat concluded that a certain equation considered by Diophantus had no solutions, and noted without elaboration that he had found "a truly marvelous proof of this proposition," now referred to as Fermat's Last Theorem. This led to tremendous advances in number theory, and the study of diophantine equations ("diophantine geometry") and of diophantine approximations remain important areas of mathematical research. Diophantus was the first Greek mathematician who recognized fractions as numbers; thus he allowed positive rational numbers for the coefficients and solutions. In modern use, diophantine equations are usually algebraic equations with integer coefficients, for which integer solutions are sought. Diophantus also made advances in mathematical notation. Heath's work is one of the standard books in the field.

This volume is a compilation of the best papers presented at the First International Symposium on Fuzzy and Rough Sets (ISFUROS 2006) held in Santa Clara, Cuba. They contain valuable contributions both in the theoretical field and in several application domains such as intelligent control, data analysis, decision making and machine learning, just to name a few. Together, they capture the huge potential of the aforementioned methodologies.

Now in a new edition --the classic presentation of the theory of computable functions in the context of the foundations of mathematics. Part I motivates the study of computability with discussions and readings about the crisis in the foundations of mathematics in the early 20th century, while presenting the basic ideas of whole number, function, proof, and real number. Part II starts with readings from Turing and Post leading to the formal theory of recursive functions. Part III presents sufficient formal logic to give a full development of G del's incompleteness theorems. Part IV considers the significance of the technical work with a discussion of Church's Thesis and readings on the foundations of mathematics. This new edition contains the timeline "Computability and Undecidability" as well as the essay "On mathematics."

Labyrinth of Thought discusses the emergence and development of set theory and the set-theoretic approach to mathematics during the period 1850-1940. Rather than focusing on the pivotal figure of Georg Cantor, it analyzes his work and the emergence of transfinite set theory within the broader context of the rise of modern mathematics. The text has a tripartite structure. Part 1, The Emergence of Sets within Mathematics, surveys the initial motivations for a mathematical notion of a set within several branches of the discipline (geometry, algebra, algebraic number theory, real and complex analysis), emphasizing the role played by Riemann in fostering acceptance of the set-theoretic approach. In Part 2, Entering the Labyrinth, attention turns to the earliest theories of sets, their evolution, and their reception by the mathematical community; prominent are the epoch-making contributions of Cantor and Dedekind, and the complex interactions between them. Part 3, In Search of an Axiom System, studies the four-decade period from the discovery of set-theoretic paradoxes to Godel s independence results, an era during which set theory gradually became assimilated into mainstream mathematics; particular attention is given to the interactions between axiomatic set theory and modern systems of formal logic, especially the interplay between set theory and type theory. A new Epilogue for this second edition offers further reflections on the foundations of set theory, including the "dichotomy conception" and the well-known iterative conception."

This volume is both a tribute to Ulrich Felgner's research in algebra, logic, and set theory and a strong research contribution to these areas. Felgner's former students, friends and collaborators have contributed sixteen papers to this volume that highlight the unity of these three fields in the spirit of Ulrich Felgner's own research. The interested reader will find excellent original research surveys and papers that span the field from set theory without the axiom of choice via model-theoretic algebra to the mathematics of intonation.

Russell's paradox arises when we consider those sets that do not belong to themselves. The collection of such sets cannot constitute a set. Step back a bit. Logical formulas define sets (in a standard model). Formulas, being mathematical objects, can be thought of as sets themselves-mathematics reduces to set theory. Consider those formulas that do not belong to the set they define. The collection of such formulas is not definable by a formula, by the same argument that Russell used. This quickly gives Tarski's result on the undefinability of truth. Variations on the same idea yield the famous results of Godel, Church, Rosser, and Post. This book gives a full presentation of the basic incompleteness and undecidability theorems of mathematical logic in the framework of set theory. Corresponding results for arithmetic follow easily, and are also given. Godel numbering is generally avoided, except when an explicit connection is made between set theory and arithmetic. The book assumes little technical background from the reader. One needs mathematical ability, a general familiarity with formal logic, and an understanding of the completeness theorem, though not its proof. All else is developed and formally proved, from Tarski's Theorem to Godel's Second Incompleteness Theorem. Exercises are scattered throughout.