Showing results for "azriel levy"
Showing 1 - 1 of 1 Results
Adult content is visible.
- Series -
- Dover Books on Mathematics
2012
EN
Although this book deals with basic set theory (in general, it stops short of areas where model-theoretic methods are used) on a rather advanced level, it does it at an unhurried pace. This enables the author to pay close attention to interesting and important aspects of the topic that might otherwise be skipped over. Written for upper-level undergraduate and graduate students, the book is divided into two parts. The first covers pure set theory, including the basic notions, order and well...
People who read this also enjoyed
2007
EN
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of ...
Set Theory
A First Course
- Series -
- Cambridge Mathematical Textbooks
2016
EN
Set theory is a rich and beautiful subject whose fundamental concepts permeate virtually every branch of mathematics. One could say that set theory is a unifying theory for mathematics, since nearly all mathematical concepts and results can be formalized within set theory. This textbook is meant for an upper undergraduate course in set theory. In this text, the fundamentals of abstract sets, including relations, functions, the natural numbers, order, cardinality, transfinite recursion, the...
Computability Theory
An Introduction to Recursion Theory
2010
EN
Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes...
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic
Volume I: Set Theory
2025
EN
This book presents both axiomatic and descriptive set theory, targeting upper-level undergraduate and beginning graduate students. It aims to equip them for advanced studies in set theory, mathematical logic, and other mathematical fields, including analysis, topology, and algebra.The book is designed as a flexible and accessible text for a one-semester introductory in set theory, where the existing alternatives may be more demanding or specialized. Readers will learn the universal...
2017
EN
Thoroughly revised, updated, expanded, and reorganized to serve as a primary text for mathematics courses, Introduction to Set Theory, Third Edition covers the basics: relations, functions, orderings, finite, countable, and uncountable sets, and cardinal and ordinal numbers. It also provides five additional self-contained chapters, consolidates the material on real numbers into a single updated chapter affording flexibility in course design, supplies end-of-section problems, with hints, of...
Set Theory
With an Introduction to Real Point Sets
- Series -
- Mathematics and Statistics (R0)
2013
EN
What is a number? What is infinity? What is continuity? What is order? Answers to these fundamental questions obtained by late nineteenth-century mathematicians such as Dedekind and Cantor gave birth to set theory. This textbook presents classical set theory in an intuitive but concrete manner.To allow flexibility of topic selection in courses, the book is organized into four relatively independent parts with distinct mathematical flavors. Part I begins with the Dedekind–Peano axio...
- Series -
- Dover Books on Mathematics
2017
EN
This classic by one of the twentieth century's most prominent mathematicians offers a concise introduction to set theory. Suitable for advanced undergraduates and graduate students in mathematics, it employs the language and notation of informal mathematics. There are very few displayed theorems; most of the facts are stated in simple terms, followed by a sketch of the proof. Only a few exercises are designated as such since the book itself is an ongoing series of exercises with hints. The...
2015
EN
A mathematical introduction to the theory and applications of logic and set theory with an emphasis on writing proofsHighlighting the applications and notations of basic mathematical concepts within the framework of logic and set theory, A First Course in Mathematical Logic and Set Theory introduces how logic is used to prepare and structure proofs and solve more complex problems.The book begins with propositional logic, including two-colu...
Set Theory
Boolean-Valued Models and Independence Proofs
- Book 47 -
- Oxford Logic Guides
2011
EN
This third edition, now available in paperback, is a follow up to the author's classic Boolean-Valued Models and Independence Proofs in Set Theory,. It provides an exposition of some of the most important results in set theory obtained in the 20th century: the independence of the continuum hypothesis and the axiom of choice. Aimed at graduate students and researchers in mathematics, mathematical logic, philosophy, and computer science, the third edition has been extensively update...
Computational Logic and Set Theory
Applying Formalized Logic to Analysis
- Series -
- Computer Science (R0)
2011
EN
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of com...
Proofs and Algorithms
An Introduction to Logic and Computability
- Series -
- Computer Science (R0)
2011
EN
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s inco...











