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)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense reasoning, expert systems implementation, (...) deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human (...) reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (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)

A history of logic -- Patterns of reasoning -- A language and its meaning -- A symbolic language -- 1850-1950 mathematical logic -- Modern symbolic logic -- Elements of set theory -- Sets, functions, relations -- Induction -- Turning machines -- Computability and decidability -- Propositional logic -- Syntax and proof systems -- Semantics of PL -- Soundness and completeness -- First order logic -- Syntax and proof systems of FOL -- Semantics of FOL -- More semantics -- Soundness (...) and completeness -- Why is first order logic "First Order"? (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)

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)

INTRODUCTION MATHEMATICAL logic differs from the traditional formal logic so markedly in method, and so far surpasses it in power and subtlety, ...

Recent years have seen the appearance of many English-language hand books of logic and numerous monographs on topical discoveries in the foundations of mathematics. These publications on the foundations of mathematics as a whole are rather difficult for the beginners or refer the reader to other handbooks and various piecemeal contribu tions and also sometimes to largely conceived "mathematical fol klore" of unpublished results. As distinct from these, the present book is as easy as possible systematic exposition of the (...) now classical results in the foundations of mathematics. Hence the book may be useful especially for those readers who want to have all the proofs carried out in full and all the concepts explained in detail. In this sense the book is self-contained. The reader's ability to guess is not assumed, and the author's ambition was to reduce the use of such words as evident and obvious in proofs to a minimum. This is why the book, it is believed, may be helpful in teaching or learning the foundation of mathematics in those situations in which the student cannot refer to a parallel lecture on the subject. This is also the reason that I do not insert in the book the last results and the most modem and fashionable approaches to the subject, which does not enrich the essential knowledge in founda tions but can discourage the beginner by their abstract form. A. G. (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 ...

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.

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.

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.

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)

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

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

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

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)

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

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.The logical systems presented are:- Propositional calculus (including binary decision diagrams);- Predicate calculus;- Resolution;- Hoare logic;- (...) Z;- Temporal logic.Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5 Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. (shrink)

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.

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)

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)

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.

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)

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.

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

The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...