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.

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."

2010 Reprint of 1915 Edition. Georg Ferdinand Ludwig Philipp Cantor was a German mathematician, best known as the inventor of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between sets, defined infinite and well-ordered sets, and proved that the real numbers are "more numerous" than the natural numbers. In fact, Cantor's theorem implies the existence of an "infinity of infinities." He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact of which he was well aware. In 1895-97 Cantor fully propounded his view of continuity and the infinite, including infinite ordinals and cardinals, in his best known work, Contributions to the Founding of the Theory of Transfinite Numbers . This work contains his conception of transfinite numbers, to which he was led by his demonstration that an infinite set may be placed in a one-to-one correspondence with one of its subsets.

Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary pointsets. This subject was started by the French analysts at the turn of the 20th century, most prominently Lebesgue, and, initially, was concerned primarily with establishing regularity properties of Borel and Lebesgue measurable functions, and analytic, coanalytic, and projective sets. Its rapid development came to a halt in the late 1930s, primarily because it bumped against problems which were independent of classical axiomatic set theory. The field became very active again in the 1960s, with the introduction of strong set-theoretic hypotheses and methods from logic (especially recursion theory), which revolutionized it. This monograph develops Descriptive Set Theory systematically, from its classical roots to the modern 'effective' theory and the consequences of strong (especially determinacy) hypotheses. The book emphasizes the foundations of the subject, and it sets the stage for the dramatic results (established since the 1980s) relating large cardinals and determinacy or allowing applications of Descriptive Set Theory to classical mathematics. The book includes all the necessary background from (advanced) set theory, logic and recursion 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.

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.

This text introduces topos theory, a development in category theory that unites important but seemingly diverse notions from algebraic geometry, set theory, and intuitionistic logic. Topics include local set theories, fundamental properties of toposes, sheaves, local-valued sets, and natural and real numbers in local set theories. 1988 edition.

This text unites the logical and philosophical aspects of set theory in a manner intelligible both to mathematicians without training in formal logic and to logicians without a mathematical background. It combines an elementary level of treatment with the highest possible degree of logical rigor and precision.
Starting with an explanation of all the basic logical terms and related operations, the text progresses through a stage-by-stage elaboration that proves the fundamental theorems of finite sets. It focuses on the Bernays theory of finite classes and finite sets, exploring the system's basis and development, including Stage I and Stage II theorems, the theory of finite ordinals, and the theory of finite classes and finite sets. This volume represents an excellent text for undergraduates studying intermediate or advanced logic as well as a fine reference for professional mathematicians.

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."

This is the second volume of a two-volume graduate text in set theory. The first volume covered the basics of modern set theory and was addressed primarily to beginning graduate students. This second volume is intended as a bridge between introductory set theory courses and advanced monographs that cover selected branches of set theory, such as forcing or large cardinals. The authors give short but rigorous introductions to set-theoretic concepts and techniques such as trees, partition calculus, cardinal invariants of the continuum, Martin's Axiom, closed unbounded and stationary sets, the Diamond Principle ($\diamond$), and the use of elementary submodels. Great care has been taken to motivate the concepts and theorems presented. The book is written as a dialogue with the reader.The presentation is interspersed with numerous exercises. The authors wish to entice readers into active participation in discovering the mathematics presented, making the book particularly suitable for self-study. Each topic is presented rigorously and in considerable detail. Carefully planned exercises lead the reader to active mastery of the techniques presented. Suggestions for further reading are given. Volume II can be read independently of Volume I.

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.

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 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.

The transition from school mathematics to university mathematics is seldom straightforward. Students are faced with a disconnect between the algorithmic and informal attitude to mathematics at school, versus a new emphasis on proof, based on logic, and a more abstract development of general concepts, based on set theory. The authors have many years' experience of the potential difficulties involved, through teaching first-year undergraduates and researching the ways in which students and mathematicians think. The book explains the motivation behind abstract foundational material based on students' experiences of school mathematics, and explicitly suggests ways students can make sense of formal ideas. This second edition takes a significant step forward by not only making the transition from intuitive to formal methods, but also by reversing the process- using structure theorems to prove that formal systems have visual and symbolic interpretations that enhance mathematical thinking. This is exemplified by a new chapter on the theory of groups. While the first edition extended counting to infinite cardinal numbers, the second also extends the real numbers rigorously to larger ordered fields. This links intuitive ideas in calculus to the formal epsilon-delta methods of analysis. The approach here is not the conventional one of 'nonstandard analysis', but a simpler, graphically based treatment which makes the notion of an infinitesimal natural and straightforward. This allows a further vision of the wider world of mathematical thinking in which formal definitions and proof lead to amazing new ways of defining, proving, visualising and symbolising mathematics beyond previous expectations.

This book presents a non-traditional approach to the theory of turbulence. Its objective is to prove that Newtonian mechanics is fully equipped for the description of turbulent motions without the help of experimentally obtained closures. Turbulence is one of the most fundamental problems in theoretical physics that is still unsolved. The term "unsolved" here means that turbulence cannot be properly formulated (ie: reduced to standard mathematical procedure such as solving differential equations). In other words, it is not just a computational problem: prior to computations, a consistent mathematical model must be found. Although applicability of the Navier-Stokes equations as a model for fluid mechanics is not in question, the instability of their solutions for flows with supercritical Reynolds numbers raises a more general question: is Newtonian mechanics complete?

Type-2 fuzzy sets extend both ordinary and interval-valued fuzzy sets to allow distributions, rather than single values, as degrees of membership. Computations with these truth values are governed by the truth value algebra of type-2 fuzzy sets. The Truth Value Algebra of Type-2 Fuzzy Sets: Order Convolutions of Functions on the Unit Interval explores the fundamental properties of this algebra and the role of these properties in applications. Accessible to anyone with a standard undergraduate mathematics background, this self-contained book offers several options for a one- or two-semester course. It covers topics increasingly used in fuzzy set theory, such as lattice theory, analysis, category theory, and universal algebra. The book discusses the basics of the type-2 truth value algebra, its subalgebra of convex normal functions, and their applications. It also examines the truth value algebra from a more algebraic and axiomatic view.

Fixed-point theory initially emerged in the article demonstrating existence of solutions of differential equations, which appeared in the second quarter of the 18th century (Joseph Liouville, 1837). Later on, this technique was improved as a method of successive approximations (Charles Emile Picard, 1890) which was extracted and abstracted as a fixed-point theorem in the framework of complete normed space (Stefan Banach, 1922). It ensures presence as well as uniqueness of a fixed point, gives an approximate technique to really locate the fixed point and the a priori and a posteriori estimates for the rate of convergence. It is an essential device in the theory of metric spaces. Subsequently, it is stated that fixed-point theory is initiated by Stefan Banach. Fixed-point theorems give adequate conditions under which there exists a fixed point for a given function and enable us to ensure the existence of a solution of the original problem. In an extensive variety of scientific issues, beginning from different branches of mathematics, the existence of a solution is comparable to the existence of a fixed point for a suitable mapping. The book "Fixed Point Theory & its Applications to Real World Problems" is an endeavour to present results in fixed point theory which are extensions, improvements and generalizations of classical and recent results in this area and touches on distinct research directions within the metric fixed-point theory. It provides new openings for further exploration and makes for an easily accessible source of knowledge. This book is apposite for young researchers who want to pursue their research in fixed-point theory and is the latest in the field, giving new techniques for the existence of a superior fixed point, a fixed point, a near fixed point, a fixed circle, a near fixed interval circle, a fixed disc, a near fixed interval disc, a coincidence point, a common fixed point, a coupled common fixed point, amiable fixed sets, strong coupled fixed points and so on, utilizing minimal conditions. It offers novel applications besides traditional applications which are applicable to real world problems. The book is self-contained and unified which will serve as a reference book to researchers who are in search of novel ideas. It will be a valued addition to the library.

This book originates as an essential underlying component of a modern, imaginative three-semester honors program (six undergraduate courses) in Mathematical Studies. In its entirety, it covers Algebra, Geometry and Analysis in One Variable.The book is intended to provide a comprehensive and rigorous account of the concepts of set, mapping, family, order, number (both natural and real), as well as such distinct procedures as proof by induction and recursive definition, and the interaction between these ideas; with attempts at including insightful notes on historic and cultural settings and information on alternative presentations. The work ends with an excursion on infinite sets, principally a discussion of the mathematics of Axiom of Choice and often very useful equivalent statements.

Set-Indexed Martingales offers a unique, comprehensive development of a general theory of Martingales indexed by a family of sets. The authors establish-for the first time-an appropriate framework that provides a suitable structure for a theory of Martingales with enough generality to include many interesting examples. Developed from first principles, the theory brings together the theories of Martingales with a directed index set and set-indexed stochastic processes. Part One presents several classical concepts extended to this setting, including: stopping, predictability, Doob-Meyer decompositions, martingale characterizations of the set-indexed Poisson process, and Brownian motion. Part Two addresses convergence of sequences of set-indexed processes and introduces functional convergence for processes whose sample paths live in a Skorokhod-type space and semi-functional convergence for processes whose sample paths may be badly behaved. Completely self-contained, the theoretical aspects of this work are rich and promising. With its many important applications-especially in the theory of spatial statistics and in stochastic geometry- Set Indexed Martingales will undoubtedly generate great interest and inspire further research and development of the theory and applications.