Online research in philosophy

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.

Thus far the logic out of which mathematics has developed has been First-order Predicate Calculus with Identity, that is the logic of the sentential functors, ¬, →, ∧, ∨, etc., together with identity and the existential and universal quotifiers restricted to quotify- ing only over individuals, and not anything else, such as qualities or quotities themselves. Some philosophers—among them Quine— have held that this, First-order Logic, as it is often called, con- stitutes the whole of logic. But that is a mistake. It leaves out Second-order Logic, which we need if we are to characterize the natural numbers precisely, and pays scant attention to the logic of relations, especially transitive relations, which is the key to much of modern mathematics. Quine’s argument for restricting logic to First-order Logice was based on the grounds that only First- order logical theories display “Law and Order” and himself regards modal logic as belonging with witchcraft and superstition.1 Pred- icates are ontologically more suspect than individuals, and have a different logic, which is liable to give rise to paradox and inconsis- tency. Moreover, Second-order Logic lacks the completeness that First-order Logice has, which provides a pleasing parallel between syntactic and semantic notions, and argues for the analyticity of deductive logic.

Filling the need for an accessible, carefully structured introductory text in symbolic logic, Modern Logic has many features designed to improve students' comprehension of the subject, including a proof system that is the same as the award-winning computer program MacLogic, and a special appendix that shows how to use MacLogic as a teaching aid. There are graded exercises at the end of each chapter--more than 900 in all--with selected answers at the end of the book. Unlike competing texts, Modern Logic gives equal weight to semantics and proof theory and explains their relationship, and develops in detail techniques for symbolizing natural language in first-order logic. After a general introduction featuring the notion of logical form, the book offers sections on classical sentential logic, monadic predicate logic, and full first-order logic with identity. A concluding section deals with extensions of and alternatives to classical logic, including modal logic, intuitionistic logic, and fuzzy logic. For students of philosophy, mathematics, computer science, or linguistics, Modern Logic provides a thorough understanding of basic concepts and a sound basis for more advanced work.

A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-order logic. An exception is S5, which, being interpretable in monadic second-order logic, is decidable.

This is a free book, 165 pages. It is for anyone who has had a solid introductory logic course and wants more. Topics covered include soundness and completeness for first-order logic, Tarski's theorem on the undefinability of truth, Gödel's incompleteness theorems, the undecidability of first-order logic, a smattering of second-order logic, and modal logic (both propositional and quantificational). I wrote it for use in my own course, because I thought I could present the most important results and concepts more clearly than the available textbooks.

This paper is an attempt to develop the many-valued first-order fuzzy logic. The set of its truth, values is supposed to be either a finite chain or the interval 0, 1 of reals. These are special cases of a residuated lattice L, , , , , 1, 0. It has been previously proved that the fuzzy propositional logic based on the same sets of truth values is semantically complete. In this paper the syntax and semantics of the first-order fuzzy logic is developed. Except for the basic connectives and quantifiers, its language may contain also additional n-ary connectives and quantifiers. Many propositions analogous to those in the classical logic are proved. The notion of the fuzzy theory in the first-order fuzzy logic is introduced and its canonical model is constructed. Finally, the extensions of Gödel's completeness theorems are proved which confirm that the first-order fuzzy logic is also semantically complete.

Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999.

Pure second-order logic is second-order logic without functional or first-order variables. In "Pure Second-Order Logic," Denyer shows that pure second-order logic is compact and that its notion of logical truth is decidable. However, his argument does not extend to pure second-order logic with second-order identity. We give a more general argument, based on elimination of quantifiers, which shows that any formula of pure second-order logic with second-order identity is equivalent to a member of a circumscribed class of formulas. As a corollary, pure second-order logic with second-order identity is compact, its notion of logical truth is decidable, and it satisfies a pure second-order analogue of model completeness. We end by mentioning an extension to n th-order pure logics.

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.

In this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater degrees of absoluteness. Our aim is to investigate the hierarchies of strong logics of first and second order that are generically invariant and faithful against the backdrop of the strongest large cardinal hypotheses. We show that there is a close correspondence between the two hierarchies and we characterize the strongest logic in each hierarchy. On the first-order side, this leads to a new presentation of Woodin's Ω-logic. On the second-order side, we compare the strongest logic with full second-order logic and argue that the comparison lends support to Quine's claim that second-order logic is really set theory in sheep's clothing.