8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.

This completely self-contained study, widely considered the best book in the field, is intended to serve both as an introduction to quantification theory and as ...

Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens / von Dr. Gottlob Frege,...Date de l'edition originale : 1879Ce livre est la reproduction fidele d'une oeuvre publiee avant 1920 et fait partie d'une collection de livres reimprimes a la demande editee par Hachette Livre, dans le cadre d'un partenariat avec la Bibliotheque nationale de France, offrant l'opportunite d'acceder a des ouvrages anciens et souvent rares issus des fonds patrimoniaux de la BnF.Les oeuvres faisant partie de cette collection ont ete numerisees (...) par la BnF et sont presentes sur Gallica, sa bibliotheque numerique.En entreprenant de redonner vie a ces ouvrages au travers d'une collection de livres reimprimes a la demande, nous leur donnons la possibilite de rencontrer un public elargi et participons a la transmission de connaissances et de savoirs parfois difficilement accessibles.Nous avons cherche a concilier la reproduction fidele d'un livre ancien a partir de sa version numerisee avec le souci d'un confort de lecture optimal. Nous esperons que les ouvrages de cette nouvelle collection vous apporteront entiere satisfaction.Pour plus d'informations, rendez-vous sur www.hachettebnf.frhttp://gallica.bnf.fr/ark:/12148/bpt6k65658c. (shrink)

We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.

The concept of identity has been seen to lead to paradox: we cannot truly and usefully say that a thing is the same either as itself or as something else. This book is a full examination of this paradox in philosophical logic, and of its implications for the philosophy of mathematics, the philosphy of mind, and relativism about identity. The author's account involves detailed discussion of the views of Wittgenstein, Russell, Frege, and Hintikka.

This analysis of Frege's views on language and metaphysics in On Sense and Reference, arguably one of the most important philosophical essays of the past hundred years, provides a thorough introduction to the function/argument analysis and applies Frege's technique to the central notions of predication, identity, existence and truth. Of particular interest is the analysis of the Paradox of Identity and a discussion of three solutions: the little-known Begriffsschrift solution, the sense/reference solution, and Russell's 'On Denoting' solution. Russell's views wend (...) their way through the work, serving as a foil to Frege. Appendices give the proofs of the first 68 propositions of Begriffsschrift in modern notation. This book will be of interest to students and professionals in philosophy and linguistics. (shrink)

This outstanding book is a leading text for symbolic or formal logic courses. All techniques and concepts are presented with clear, comprehensive explanations and numerous, carefully constructed examples. Its flexible organization (all chapters are complete and self-contained) allows instructors the freedom to cover the topics they want in the order they choose.

This brief paperback is designed for symbolic/formal logic courses. It features the tree method proof system developed by Jeffrey. The new edition contains many more examples and exercises and is reorganized for greater accessibility.

The typical rules for truth-trees for first-order logic without functions can fail to generate finite branches for formulas that have finite models–the rule set fails to have the finite tree property. In 1984 Boolos showed that a new rule set proposed by Burgess does have this property. In this paper we address a similar problem with the typical rule set for first-order logic with identity and functions, proposing a new rule set that does have the finite tree property.