In recent years, several remarkable results have shown that certain theorems of finite combinatorics are unprovable in certain logical systems. These developments have been instrumental in stimulating research in both areas, with the interface between logic and combinatorics being especially important because of its relation to crucial issues in the foundations of mathematics which were raised by the work of Kurt Godel. Because of the diversity of the lines of research that have begun to shed light on these (...) issues, there was a need for a comprehensive overview which would tie the lines together. This volume fills that need by presenting a balanced mixture of high quality expository and research articles that were presented at the August 1985 AMS-IMS-SIAM Joint Summer Research Conference, held at Humboldt State University in Arcata, California.With an introductory survey to put the works into an appropriate context, the collection consists of papers dealing with various aspects of 'unprovable theorems and fast-growing functions'. Among the topics addressed are: ordinal notations, the dynamical systems approach to Ramsey theory, Hindman's finite sums theorem and related ultrafilters, well quasiordering theory, uncountable combinatorics, nonstandard models of set theory, and a length-of-proof analysis of Godel's incompleteness theorem. Many of the articles bring the reader to the frontiers of research in this area, and most assume familiarity with combinatorics and/or mathematical logic only at the senior undergraduate or first-year graduate level. (shrink)

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)

This is a concise book that introduces students to the basics of logical thinking and important mathematical structures that are critical for a solid understanding of logical formalisms themselves as well as for building the necessary background to tackle other fields that are based on these logical principles. Despite its compact and small size, it includes many solved problems and quite a few end-of-section exercises that will help readers consolidate their understanding of the material. This textbook is essential reading for (...) anyone interested in the logical foundations of Informatics, Computer Science, Data Science, Artificial Intelligence, and other related areas. Written with undergraduate students in these disciplines in mind, this book can very well serve the needs of interested and curious readers who wish to get a grasp of the logical principles upon which these fields are built. This book does not require readers to possess math skills beyond those learned in high school. (shrink)

Mathematical Foundations of Quantum Theory is a collection of papers presented at the 1977 conference on the Mathematical Foundations of Quantum Theory, held in New Orleans. The contributors present their topics from a wide variety of backgrounds and specialization, but all shared a common interest in answering quantum issues. Organized into 20 chapters, this book's opening chapters establish a sound mathematical basis for quantum theory and a mode of observation in the double slit experiment. This book then describes (...) the Lorentz particle system and other mathematical structures with which fun ... (shrink)

This paper is devoted to the mathematical rationale of the Kapitsa's hypothesis about interference nature of the phenomenon known as “ball lightning.” It is shown that (i) there are exact solutions of the free Maxwell equations in vacuum describing closed spherical magnetic surfaces (with a tangential time dependent magnetic field, and without an electric field) and (ii) ring-like formations with tangential time-dependent electric field (and with a zero magnetic field everywhere on the ring). It is concluded that the form of (...) these spheres and rings does not suffer changes with time. (shrink)

applied, for instance, to developing a decision support system for the Space Shuttle INogueira et al., 2001] and to graph-theoretic problems arising in..

This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying methodologies, this book is an indispensable reference (...) for both the pure logician and the theoretical computer scientist. (shrink)

Chomsky’s highly influential Syntactic Structures ( SS ) has been much praised its originality, explicitness, and relevance for subsequent cognitive science. Such claims are greatly overstated. SS contains no proof that English is beyond the power of finite state description (it is not clear that Chomsky ever gave a sound mathematical argument for that claim). The approach advocated by SS springs directly out of the work of the mathematical logician Emil Post on formalizing proof, but few linguists are aware of (...) this, because Post’s papers are not cited. Chomsky’s extensions to Post’s systems are not clearly defined, and the arguments for their necessity are weak. Linguists have also overlooked Post’s proofs of the first two theorems about effects of rule format restrictions on generative capacity, published more than ten years before SS was published. (shrink)

On the mathematical foundations of theoretical statistics.

The concepts of measurement and measurable quantity are discussed. A probabilistic interpretation independent of the arrow of time is recommended and a definition of quantizable physical systems is given. The space of states of information about the physical system is Schwarz space rather than Hilbert space.

Consistency, interpretability and probability are three key instruments in the mathematical philosopher’s kit when it comes to questions of foundational theory comparison. This paper aims to bring these tools together with a focus on theories capable of providing foundations for mathematics with a particular emphasis on set theory. A number of counterintuitive results emerge which are then addressed by offering a novel framework based on what we call pointwise interpretability. We then investigate a plausible, existing instance of this (...) framework, the generic multiverse, and demonstrate that it can be naturally situated within our pointwise interpretability framework. (shrink)

Wittgenstein's work remains, undeniably, now, that off one of those few philosophers who will be read by all future generations.

A new hypothesis on the basic features characterising the Foundations of Mathematics is suggested. By means of them the entire historical development of Mathematics before the 20th Century is summarised through a table. Also the several programs, launched around the year 1900, on the Foundations of Mathematics are characterised by a corresponding table. The major difficulty that these programs met was to recognize an alternative to the basic feature of the deductive organization of a theory (...) - more precisely, to Hilbert’s main tenet. Ironically, already half a century before the births of these programs the alternative organization has been substantially represented by Lobachevsky's theory on parallel lines. Moreover, although each program’s founder recognised the basic features in a partial way only, all together these programs represented just the four possible foundational approaches. (shrink)

This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability. The individual contributions touch on most of the core aspects of Davis’ work and set it in a contemporary context. They analyse, discuss and develop many of the ideas and concepts that Davis put forward, including such issues as contemporary satisfiability solvers, essential unification, quantum computing and generalisations of Hilbert’s tenth problem. (...) The book starts out with a scientific autobiography by Davis, and ends with his responses to comments included in the contributions. In addition, it includes two previously unpublished original historical papers in which Davis and Putnam investigate the decidable and the undecidable side of Logic, as well as a full bibliography of Davis’ work. As a whole, this book shows how Davis’ scientific work lies at the intersection of computability, theoretical computer science, foundations of mathematics, and philosophy, and draws its unifying vision from his deep involvement in Logic. (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 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)

First published in 2000. Routledge is an imprint of Taylor & Francis, an informa company.