Logic Colloquium '86


Book Description

The result of the European Summer Meeting of the Association for Symbolic Logic, this volume gives an overview of the latest developments in most of the major fields of logic being actively pursued today. Important new developments in the applications of logic in computer science are presented. Other areas examined include model theory, set theory, recursion theory, proof theory, and the history of logic.This volume contains the texts of ten of the invited lectures and six of the contributed papers.




Sets and Extensions in the Twentieth Century


Book Description

Set theory is an autonomous and sophisticated field of mathematics that is extremely successful at analyzing mathematical propositions and gauging their consistency strength. It is as a field of mathematics that both proceeds with its own internal questions and is capable of contextualizing over a broad range, which makes set theory an intriguing and highly distinctive subject. This handbook covers the rich history of scientific turning points in set theory, providing fresh insights and points of view. Written by leading researchers in the field, both this volume and the Handbook as a whole are definitive reference tools for senior undergraduates, graduate students and researchers in mathematics, the history of philosophy, and any discipline such as computer science, cognitive psychology, and artificial intelligence, for whom the historical background of his or her work is a salient consideration - Serves as a singular contribution to the intellectual history of the 20th century - Contains the latest scholarly discoveries and interpretative insights




Labyrinth of Thought


Book Description

"José Ferreirós has written a magisterial account of the history of set theory which is panoramic, balanced, and engaging. Not only does this book synthesize much previous work and provide fresh insights and points of view, but it also features a major innovation, a full-fledged treatment of the emergence of the set-theoretic approach in mathematics from the early nineteenth century. This takes up Part One of the book. Part Two analyzes the crucial developments in the last quarter of the nineteenth century, above all the work of Cantor, but also Dedekind and the interaction between the two. Lastly, Part Three details the development of set theory up to 1950, taking account of foundational questions and the emergence of the modern axiomatization." (Bulletin of Symbolic Logic)




Computability Theory and Its Applications


Book Description

This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM 1999 Summer Conference on Computability Theory and Applications, which focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role. Some presentations are narrowly focused; others cover a wider area. Topics included from "pure" computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kucera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).




Computability and Randomness


Book Description

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.




Extensions of Logic Programming


Book Description

The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.




Handbook of Set Theory


Book Description

Numbers imitate space, which is of such a di?erent nature —Blaise Pascal It is fair to date the study of the foundation of mathematics back to the ancient Greeks. The urge to understand and systematize the mathematics of the time led Euclid to postulate axioms in an early attempt to put geometry on a ?rm footing. With roots in the Elements, the distinctive methodology of mathematics has become proof. Inevitably two questions arise: What are proofs? and What assumptions are proofs based on? The ?rst question, traditionally an internal question of the ?eld of logic, was also wrestled with in antiquity. Aristotle gave his famous syllogistic s- tems, and the Stoics had a nascent propositional logic. This study continued with ?ts and starts, through Boethius, the Arabs and the medieval logicians in Paris and London. The early germs of logic emerged in the context of philosophy and theology. The development of analytic geometry, as exempli?ed by Descartes, ill- tratedoneofthedi?cultiesinherentinfoundingmathematics. Itisclassically phrased as the question ofhow one reconciles the arithmetic with the geom- ric. Arenumbers onetypeofthingand geometricobjectsanother? Whatare the relationships between these two types of objects? How can they interact? Discovery of new types of mathematical objects, such as imaginary numbers and, much later, formal objects such as free groups and formal power series make the problem of ?nding a common playing ?eld for all of mathematics importunate. Several pressures made foundational issues urgent in the 19th century.




Logic Colloquium '87


Book Description

Fourteen papers presented at the 1987 European Summer Meeting of the Association for Symbolic Logic are collected in this volume.The main areas covered by the conference were Logic, Set Theory, Recursion Theory, Model Theory, Logic for Computer Science and Semantics of Natural Languages.




Quantifiers: Logics, Models and Computation


Book Description

Quantifiers: Logics, Models and Computation is the first concentrated effort to give a systematic presentation of the main research results on the subject, since the modern concept was formulated in the late '50s and early '60s. The majority of the papers are in the nature of a handbook. All of them are self-contained, at various levels of difficulty. The Introduction surveys the main ideas and problems encountered in the logical investigation of quantifiers. The Prologue, written by Per Lindström, presents the early history of the concept of generalised quantifiers. The volume then continues with a series of papers surveying various research areas, particularly those that are of current interest. Together they provide introductions to the subject from the points of view of mathematics, linguistics, and theoretical computer science. The present volume has been prepared in parallel with Quantifiers: Logics, Models and Computation, Volume Two. Contributions, which contains a collection of research papers on the subject in areas that are too fresh to be summarised. The two volumes are complementary. For logicians, mathematicians, philosophers, linguists and computer scientists. Suitable as a text for advanced undergraduate and graduate specialised courses in logic.




Interpolation and Definability


Book Description

This book is a specialized monograph on interpolation and definability, a notion central in pure logic and with significant meaning and applicability in all areas where logic is applied, especially computer science, artificial intelligence, logic programming, philosophy of science and natural language.Suitable for researchers and graduate students in mathematics, computer science and philosophy, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism (second edition), J. M. Dunn and G. Hardegree's Algebraic Methods in Philosophical Logic, H. Rott's Change, Choice and Inference: A Study of Belief Revision and NonmonotonicReasoning, P. T. Johnstone's Sketches of an Elephant: A Topos Theory Compendium: Volumes 1 and 2, and David J. Pym and Eike Ritter's Reductive Logic and Proof Search: Proof theory, semantics and control.