Formal logic
its scope and limits
By Richard C. Jeffrey
"Formal logic" was published by McGraw-Hill in 1967 - New York, it has 238 pages and the language of the book is English.
“Formal logic” Metadata:
- Title: Formal logic
- Author: Richard C. Jeffrey
- Language: English
- Number of Pages: 238
- Publisher: McGraw-Hill
- Publish Date: 1967
- Publish Location: New York
“Formal logic” Subjects and Themes:
- Subjects: ➤ First-order logic - Wiskundige logica - Mathematische Logik - Waarheid - Afleiding (logica) - Formele logica - Symbolische logica - Ontbrekende gegevens - Einführung - Equivalentie - Logic - Identiteitsbeginsel - Logique - Symbolic and mathematical Logic
Edition Identifiers:
- The Open Library ID: OL22622641M - OL13263483W
- Online Computer Library Center (OCLC) ID: 1243841372
- Library of Congress Control Number (LCCN): 67016929
- ISBN-13: 9780070323162
- ISBN-10: 007032316X
- All ISBNs: 007032316X - 9780070323162
AI-generated Review of “Formal logic”:
"Formal logic" Description:
The Open Library:
The first beginning logic text to employ the tree method--a complete formal system of first-order logic that is remarkably easy to understand and use--this text allows students to take control of the nuts and bolts of formal logic quickly, and to move on to more complex and abstract problems. The tree method is elaborated in manageable steps over five chapters, in each of which its adequacy is reviewed; soundness and completeness proofs are extended at each step, and the decidability proof is extended at the step from truth functions to the logic of nonoverlapping quantifiers with a single variable, after which undecidability is demonstrated by example. The first three chapters are bilingual, with arguments presented twice, in logical notation and in English. The last three chapters consider the discoveries defining the scope and limits of formal methods that marked logic’s coming of age in the 20th century: Godel’s completeness and incompleteness theorems for first and second-order logic, and the Church-Turing theorem on the undecidability of first-order logic. This new edition provides additional problems, solutions to selected problems, and two new Supplements: Truth-Functional Equivalence reinstates material on that topic from the second edition that was omitted in the third, and Variant Methods, in which John Burgess provides a proof regarding the possibility of modifying the tree method so that it will always find a finite model when there is one, and another, which shows that a different modification―once contemplated by Jeffrey--can result in a dramatic speed--up of certain proofs.
Read “Formal logic”:
Read “Formal logic” by choosing from the options below.
Search for “Formal logic” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Formal logic" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: borrow
- Check if available: The Open Library & The Internet Archive
Find “Formal logic” in Libraries Near You:
Read or borrow “Formal logic” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Formal logic” at a library near you.
Buy “Formal logic” online:
Shop for “Formal logic” on popular online marketplaces.