This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and were revised and (...) updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

Undergraduate students with no prior classroom instruction in mathematical logic will benefit from this evenhanded multipart text by one of the centuries greatest authorities on the subject. Part I offers an elementary but thorough overview of mathematical logic of first order. The treatment does not stop with a single method of formulating logic; students receive instruction in a variety of techniques, first learning model theory (truth tables), then Hilbert-type proof theory, and proof theory handled through derived rules. Part (...) II supplements the material covered in Part I and introduces some of the newer ideas and the more profound results of logical research in the twentieth century. Subsequent chapters introduce the study of formal number theory, with surveys of the famous incompleteness and undecidability results of Godel, Church, Turing, and others. The emphasis in the final chapter reverts to logic, with examinations of Godel's completeness theorem, Gentzen's theorem, Skolem's paradox and nonstandard models of arithmetic, and other theorems. Unabridged republication of the edition published by John Wiley & Sons, Inc. New York, 1967. Preface. Bibliography. Theorem and Lemma Numbers: Pages. List of Postulates. Symbols and Notations. Index. (shrink)

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most (...) striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic. (shrink)

8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.

W. V. Quine’s systematic development of mathematical logic has been widely praised for the new material presented and for the clarity of its exposition. This revised edition, in which the minor inconsistencies observed since its first publication have been eliminated, will be welcomed by all students and teachers in mathematics and philosophy who are seriously concerned with modern logic. Max Black, in Mind, has said of this book, “It will serve the purpose of inculcating, by precept and example, standards (...) of clarity and precision which are, even in formal logic, more often pursued than achieved.”. (shrink)

Suitable for advanced undergraduates and graduate students from diverse fields and varying backgrounds, this self-contained course in mathematical logic features numerous exercises that vary in difficulty. The author is a Professor of Mathematics at the University of Wisconsin.

Mathematical Logic: An Introduction is a textbook that uses mathematical tools to investigate mathematics itself. In particular, the concepts of proof and truth are examined. The book presents the fundamental topics in mathematical logic and presents clear and complete proofs throughout the text. Such proofs are used to develop the language of propositional logic and the language of first-order logic, including the notion of a formal deduction. The text also covers Tarski’s definition of truth and the computability (...) concept. It also provides coherent proofs of Godel’s completeness and incompleteness theorems. Moreover, the text was written with the student in mind and thus, it provides an accessible introduction to mathematical logic. In particular, the text explicitly shows the reader how to prove the basic theorems and presents detailed proofs throughout the book. Most undergraduate books on mathematical logic are written for a reader who is well-versed in logical notation and mathematical proof. This textbook is written to attract a wider audience, including students who are not yet experts in the art of mathematical proof. (shrink)

" There are 31 chapters in 5 parts and approximately 320 exercises marked by difficulty and whether or not they are necessary for further work in the book.

This textbook is a second edition of the successful, Mathematical Logic: On Numbers, Sets, Structures, and Symmetry. It retains the original two parts found in the first edition, while presenting new material in the form of an added third part to the textbook. The textbook offers a slow introduction to mathematical logic, and several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions. Part I, Logic Sets, and Numbers, shows how mathematical logic (...) is used to develop the number structures of classical mathematics. All necessary concepts are introduced exactly as they would be in a course in mathematical logic; but are accompanied by more extensive introductory remarks and examples to motivate formal developments. The second part, Relations, Structures, Geometry, introduces several basic concepts of model theory, such as first-order definability, types, symmetries, and elementary extensions, and shows how they are used to study and classify mathematical structures. The added Part III to the book is closer to what one finds in standard introductory mathematical textbooks. Definitions, theorems, and proofs that are introduced are still preceded by remarks that motivate the material, but the exposition is more formal, and includes more advanced topics. The focus is on the notion of countable categoricity, which analyzed in detail using examples from the first two parts of the book. This textbook is suitable for graduate students in mathematical logic and set theory and will also be of interest to mathematicians who know the technical aspects of the subject, but are not familiar with its history and philosophical background. (shrink)

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical (...) class='Hi'>mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage. The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging. This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students in relevant disciplines. (shrink)

An introduction to Mathematical Logic using a unique pedagogical approach in which the students implement the underlying conceps as well as almost all the mathematical proofs in the Python programming language. The textbook is accompanied by an extensive collection of programming tasks, code skeletons, and unit tests. The covered mathematical material includes Propositional Logic and first-order Predicate Logic, culminating in a proof of Gödel's Completeness Theorem. A "sneak peak" into Gödel's Incompleteness Theorem is also provided.

A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included.

onl y to discuss some claims concerning the relationship between mathematical logic and the philosophy of mathematics that repeatedly occur in his writings. Although I do not know to what extent they are representative of his present position, they correspond to widespread views of the logical community and so seem worth discussing anyhow. Such claims will be used as reference to make some remarks about the present state of relations between mathematical logic and the philosophy of mathematics.

Mathematical logic was first introduced to China in early 1920s. Although, the process of introduction was facilitated by the lectures of Bertrand Russel at Peking University in 1921 and continued by China’s most passionate adherents of Russell’s philosophy, the establishment of mathematical logic as an academic discipline occurred only in late 1920s, in the framework of a recently reorganised Qinghua University in Peking. The main aim of this paper is to shed some light on the process of establishment (...) of mathematical logic at the department of philosophy at Qinghua University, between the years 1926 and 1945. In its main line of discussion, the article highlights the curricular developments at the department, connecting them with concrete theoretical endeavours by the leading members of the department. Furthermore, in its later parts, the article summarises the main advances made in the context of studies of modern logic at Qinghua University, from the expositions on the quintessential work Principia Mathematica, to the subsequent integration of criticisms coming from circles of logicians at Harvard University and ground-breaking contributions of Kurt Gödel in the mid-1930s. (shrink)

This book presents a comprehensive treatment of basic mathematical logic. The author's aim is to make exact the vague, intuitive notions of natural number, preciseness, and correctness, and to invent a method whereby these notions can be communicated to others and stored in the memory. He adopts a symbolic language in which ideas about natural numbers can be stated precisely and meaningfully, and then investigates the properties and limitations of this language. The treatment of mathematical concepts in the (...) main body of the text is rigorous, but, a section of 'historical remarks' traces the evolution of the ideas presented in each chapter. Sources of the original accounts of these developments are listed in the bibliography. (shrink)

Every branch of mathematics has its subject matter, and one of the distinguishing features of logic is that so many of its fundamental objects of study are rooted in language. The subject deals with terms, expressions, formulas, theorems, and proofs. When we speak about these notions informally, we are talking about things that can be written down and communicated with symbols. One of the goals of mathematical logic is to introduce formal definitions that capture our intuitions about such objects (...) and enable us to reason about them precisely. At the most basic level, syntactic objects can be viewed as strings of symbols. For concreteness, we can identify symbols with particular set-theoretic objects, but for most purposes, it doesn't matter what they are; all that is needed is that they are distinct from one another. (shrink)

Designed to provide a firm foundation in mathematical logic, this work aims to serve as an elementary textbook for both graduate study and for applications of logic, such as logic programming and format specification and verification.

Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic. At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics. Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a (...) derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved. Optinal sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch. Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches. Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in logic, mathematics, philosophy, and computer science. (shrink)

Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.

An excellent introduction to mathematical logic, this book provides readers with a sound knowledge of the most important approaches to the subject, stressing the use of logical methods in attacking nontrivial problems. It covers the logic of classes, of propositions, of propositional functions, and the general syntax of language, with a brief introduction that also illustrates applications to so-called undecidability and incompleteness theorems. Other topics include the simple proof of the completeness of the theory of combinations, Church's theorem on (...) the recursive unsolvability of the decision problem for the restricted function calculus, and the demonstrable properties of a formal system as a criterion for its acceptability. 1950 ed. (shrink)

This book is intended to be used as a textbook by students of mathematics, and also within limitations as a reference work.

Therefore, the text is divided into three parts: an introduction into mathematical logic (Chapter 1), model theory (Chapters 2 and 3), and the model theoretic ...

Logic forms the basis of mathematics and is a fundamental part of any mathematics course. This book provides students with a clear and accessible introduction to this important subject, using the concept of model as the main focus and covering a wide area of logic. The chapters of the book cover propositional calculus, boolean algebras, predicate calculus and completelness theorems with answeres to all of the excercises and the end of the volume. This is an ideal introduction to mathematics and (...) logic for the advanced undergraduate student. (shrink)

(or not oveA-complete.) . Let * be a unary operator defined on the set F of formulas of the language £ (ie, if A is a formula of £, then *A is also a ...

This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.

Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.

often insisted existence in mathematics means logical consistency, and formal logic is the sole guarantor of rigor. The paper joins this to his view of intuition and his own mathematics. It looks at predicativity and the infinite, Poincaré's early endorsement of the axiom of choice, and Cantor's set theory versus Zermelo's axioms. Poincaré discussed constructivism sympathetically only once, a few months before his death, and conspicuously avoided committing himself. We end with Poincaré on Couturat, Russell, and Hilbert.

Proceedings of the Steklov Institute of Mathematics is a cover-to-cover translation of the Trudy Matematicheskogo Instituta imeni V.A. Steklova of the Russian Academy of Sciences. Each issue ordinarily contains either one book-length article or a collection of articles pertaining to the same topic.

In dealing with the problem of the interrelations between mathematical logic and formal logic, we must first of all make clear just what mathematical logic is. In our opinion, the concept "mathematical logic" is employed in two different senses in mathematical and logical literature. A successful approach to our problem necessitates a clear differentiation between these two senses. Therefore we shall speak hereafter not of mathematical logic in general, but of mathematical logic in the (...) narrow meaning and in the broad meaning of the term. (shrink)

This books states, as clearly and concisely as possible, the most fundamental principles of set-theory and mathematical logic. Included is an original proof of the incompleteness of formal logic. Also included are clear and rigorous definitions of the primary arithmetical operations, as well as clear expositions of the arithmetic of transfinite cardinals.

This volume is a collection of essays in honour of Professor Mohammad Ardeshir. It examines topics which, in one way or another, are connected to the various aspects of his multidisciplinary research interests. Based on this criterion, the book is divided into three general categories. The first category includes papers on non-classical logics, including intuitionistic logic, constructive logic, basic logic, and substructural logic. The second category is made up of papers discussing issues in the contemporary philosophy of mathematics and logic. (...) The third category contains papers on Avicenna’s logic and philosophy. Mohammad Ardeshir is a full professor of mathematical logic at the Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran, where he has taught generations of students for around a quarter century. Mohammad Ardeshir is known in the first place for his prominent works in basic logic and constructive mathematics. His areas of interest are however much broader and include topics in intuitionistic philosophy of mathematics and Arabic philosophy of logic and mathematics. In addition to numerous research articles in leading international journals, Ardeshir is the author of a highly praised Persian textbook in mathematical logic. Partly through his writings and translations, the school of mathematical intuitionism was introduced to the Iranian academic community. (shrink)