The mathematical proof is the most important form of justification in mathematics. It is not, however, the only kind of justification for mathematical propositions. The existence of other forms, some of very significant strength, places a question mark over the prominence given to proof within mathematics. This collection of essays, by leading figures working within the philosophy of mathematics, is a response to the challenge of understanding the nature and role of the proof.

A collection of essays from distinguished contributors looking at why it is that mathematical proof is given precedence over other forms of mathematical justification.

These questions arise from any attempt to discover an epistemology for mathematics. This collection of essays considers various questions concerning the nature of justification in mathematics and possible sources of that justification. Among these are the question of whether mathematical justification is a priori or a posteriori in character, whether logical and mathematical differ, and if formalization plays a significant role in mathematical justification,

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.

Culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. This work shows that set theory and number theory can be developed within the framework of a new, different and simple equational formalism, closely related to the formalism of the theory of relation algebras.

This volume presents the proceedings of the First International Static Analysis Symposium (SAS '94), held in Namur, Belgium in September 1994. The proceedings comprise 25 full refereed papers selected from 70 submissions as well as four invited contributions by Charles Consel, Saumya K. Debray, Thomas W. Getzinger, and Nicolas Halbwachs. The papers address static analysis aspects for various programming paradigms and cover the following topics: generic algorithms for fixpoint computations; program optimization, transformation and verification; strictness-related analyses; type-based analyses and type inference; dependency analyses and abstract domain construction.