This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society (co-sponsored by the Centre for Logic, Epistemology and the History of Science, State University of Campinas, São Paolo) in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mário 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.

This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. The classic text is replete with illustrative examples and exercises. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists.

Provides a sound basis in logic, and introduces logical frameworks used in modelling, specifying and verifying computer systems.

This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.

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 incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

This is a mathematics textbook with theorems and proofs. 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. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.

Logic and its components (propositional, first-order, non-classical) play a key role in Computer Science and Artificial Intelligence. While a large amount of information exists scattered throughout various media (books, journal articles, webpages, etc.), the diffuse nature of these sources is problematic and logic as a topic benefits from a unified approach. Logic for Computer Science and Artificial Intelligence utilizes this format, surveying the tableaux, resolution, Davis and Putnam methods, logic programming, as well as for example unification and subsumption. For non-classical logics, the translation method is detailed. Logic for Computer Science and Artificial Intelligence is the classroom-tested result of several years of teaching at Grenoble INP (Ensimag). It is conceived to allow self-instruction for a beginner with basic knowledge in Mathematics and Computer Science, but is also highly suitable for use in traditional courses. The reader is guided by clearly motivated concepts, introductions, historical remarks, side notes concerning connections with other disciplines, and numerous exercises, complete with detailed solutions, The title provides the reader with the tools needed to arrive naturally at practical implementations of the concepts and techniques discussed, allowing for the design of algorithms to solve problems.

This book contains the proceedings of the Special Session, Interaction of Inverse Problems and Image Analysis, held at the January 2001 meeting of the AMS in New Orleans, LA. The common thread among inverse problems, signal analysis, and image analysis is a canonical problem: recovering an object (function, signal, picture) from partial or indirect information about the object. Both inverse problems and imaging science have emerged in recent years as interdisciplinary research fields with profound applications in many areas of science, engineering, technology, and medicine. Research in inverse problems and image processing shows rich interaction with several areas of mathematics and strong links to signal processing, variational problems, applied harmonic analysis, and computational mathematics. This volume contains carefully referred and edited original research papers and high-level survey papers that provide overview and perspective on the interaction of inverse problems, image analysis, and medical imaging. The book is suitable for graduate students and researchers interested in signal and image processing and medical imaging.

This book presents the proceedings from the conference on algebraic geometry in honor of Professor Friedrich Hirzebruch's 70th Birthday. The event was held at the Stefan Banach International Mathematical Center in Warsaw (Poland). Topics covered in the book include intersection theory, singularities, low-dimensional manifolds, moduli spaces, number theory, and interactions between mathematical physics and geometry. Also included are articles from notes of two special lectures. The first, by Professor M. Atiyah, describes the important contributions to the field of geometry by Professor Hirzebruch. The second article contains notes from the talk delivered at the conference by Professor Hirzebruch. Contributors to the volume are leading researchers in the field.

This volume contains the proceedings of an AMS special session held at the 1999 Joint Mathematics Meetings in San Antonio. The participants were an international group of researchers studying singularities from algebraic and analytic viewpoints. The contributed papers contain original results as well as some expository and historical material. This volume is dedicated to Oscar Zariski, on the one hundredth anniversary of his birth. Topics include the role of valuation theory in algebraic geometry with recent applications to the structure of morphisms; algorithmic approaches to resolution of equisingular surface singularities and locally toric varieties; weak subintegral closures of ideals and Rees valuations; constructions of universal weakly subintegral extensions of rings; direct-sum decompositions of finitely generated modules; construction and examples of resolution graphs of surface singularities; Jacobians of meromorphic curves; investigation of spectral numbers of curve singularities using Puiseux pairs; Gröbner basis calculations of Hochschild homology for hypersurfaces with isolated singularities; and the theory of characteristic classes of singular spaces - a brief history with conjectures and open problems.