Online research in philosophy

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

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.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.

Q.E.D. presents some of the most famous mathematical proofs in a charming book that will appeal to nonmathematicians and math experts alike. Grasp in an instant why Pythagoras’s theorem must be correct. Follow the ancient Chinese proof of the volume formula for the frustrating frustum, and Archimedes’ method for finding the volume of a sphere. Discover the secrets of pi and why, contrary to popular belief, squaring the circle really is possible. Study the subtle art of mathematical domino tumbling, and find out how slicing cones helped save a city and put a man on the moon.

In the early years of this century, Poincaré and Russell engaged in a debate concerning the nature of mathematical reasoning. Siding with Kant, Poincaré argued that mathematical reasoning is characteristically non-logical in character. Russell urged the contrary view, maintaining that (i) the plausibility originally enjoyed by Kant's view was due primarily to the underdeveloped state of logic in his (i.e., Kant's) time, and that (ii) with the aid of recent developments in logic, it is possible to demonstrate its falsity. This refutation of Kant's views consists in showing that every known theorem of mathematics can be proven by purely logical means from a basic set of axioms. In our view, Russell's alleged refutation of Poincaré's Kantian viewpoint is mistaken. Poincaré's aim (as Kant's before him) was not to deny the possibility of finding a logical ‘proof’ for each theorem. Rather, it was to point out that such purely logical derivations fail to preserve certain of the important and distinctive features of mathematical proof. Against such a view, programs such as Russell's, whose main aim was to demonstrate the existence of a logical counterpart for each mathematical proof, can have but little force. For what is at issue is not whether each mathematical theorem can be fitted with a logical ‘proof’, but rather whether the latter has the epistemic features that a genuine mathematical proof has.

This paper explores some of the benefits informal logic may have for the analysis of mathematical inference. It shows how Stephen Toulmin’s pioneering treatment of defeasible argumentation may be extended to cover the more complex structure of mathematical proof. Several common proof techniques are represented, including induction, proof by cases, and proof by contradiction. Affinities between the resulting system and Imre Lakatos’s discussion of mathematical proof are then explored.

Preface -- Introduction -- There is only one reality -- The ultimate perspective and the ultimate drama -- Proof #1: Science -- Proof #2: History -- Proof #3: Prophecy -- Proof #4: Supernatural -- Proof #5: Psychology -- Proof #6: Sociology -- Proof #7: Inerrancy -- Proof #8: Micro-science -- Proof #9: Logic -- Proof #10: The only provably -- Inerrant, complete system -- Why proof is important -- Personal iplications of proof.

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

This book is a specialized monograph on the development of the mathematical and computational metatheory of reductive logic and proof-search including proof-theoretic, semantic/model-theoretic and algorithmic aspects. The scope ranges from the conceptual background to reductive logic, through its mathematical metatheory, to its modern applications in the computational sciences.

Proof and Knowledge in Mathematics tackles the main problem that arises when considering an epistemology for mathematics, the nature and sources of mathematical justification. Focusing both on particular and general issues, these essays from leading philosophers of mathematics raise important issues for our current understanding of mathematics. Is mathematical justification a priori or a posteriori? What role, if any, does logic play in mathematical reasoning or inference? And how epistemologically important is the formalizability of proof? Michael Detlefsen has brought together an outstanding collection of essays in a volume which will be essential for philosophers and historians of mathematics who are interested in the nature of reasoning and justification. A companion volume, Proof, Knowledge and Formalization is also available from Routledge.