The Axiomatic Method: An Introduction to Mathematical Logic
β Scribed by A. H. Lightstone
- Publisher
- Prentice-Hall
- Year
- 1964
- Tongue
- English
- Leaves
- 257
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book is written primarily for the student of mathematics who possesses some measure of mathematical ability, has a working knowledge of the axiomatic approach to mathematics, and in particular has been exposed to the axiomatic method as applied to the study of modern abstract algebra.
It is the axiomatic method itself that is under scrutiny here. Consider the statement: ββEuclidβs fifth postulate is a logical consequence of his other four postulates.β There are two possible interpretations of this statement, depending upon the viewpoint. To a working mathematician, a proposition is a logical consequence of a postulate-set if the given proposition is true about each mathematical system for which the postulates are true. To a logician, a proposition is a logical consequence of a postulate-set provided that the given proposition can be deduced from the postulate-set by applying the laws and procedures of a particular system of logic. Notice that in the latter approach mathematical systemsβthe realizations of the given postulatesetβare not involved.
On the one hand, then, the axiomatic approach is concerned with mathematical systems and with demonstrating that given propositions (i.e., theorems) are true in these mathematical systems. The other side of the axiomatic method is the purely logical side in which the theorems of the system are established by applying a completely formalized Theory of Deduction to the given postulate-set. There is a striking difference in viewpoint: the first approach emphasizes the mathematical systems characterized by the given postulate-set, whereas the second approach considers only the logical apparatus, which is applied directly to the postulate-set. A theory of deduction may be regarded as a black box: feed in a set of propositions (the given postulate-set), turn a crank, and out come the theorems of the system.
Our plan is to study both approaches to the axiomatic method and to demonstrate that they are indeed two aspects of the same thing. To be precise, we shall prove that, under a suitable theory of deduction, each logical consequence of a given postulate-set under the first interpretation is also a logical consequence of the given postulate-set under the second interpretation.
β¦ Table of Contents
Title page
Imprint
Preface
Contents
part I Review of fundamentals
chapter | Symbolic logic
1. The Logical Connectives
2. Truth-table Analysis
3. Propositions Constructed from Independent Propositions
4. The Disjunctive Normal Form
5. Tautologies and Valid Arguments
6. The Algebra of Propositions
7. Applications to Switching Networks
8. The Universal Quantifier
9. The Existential Quantifier
10. Propositions Involving Several Quantifiers
chapter 2 Set theory
1. Sets
2. Russell's Paradox
3. Operations on Sets
4. The Algebra of Sets
5. Ordered n-tuples
6. Mappings
7. Operators
8. Relations
9. Equivalence Relations and Partitions
10. Cardinal Numbers
part II The axiomatic method
chapter 3 The axiomatic method and abstract algebra
1. Algebraic Systems
2. The Axiomatic Method
3. Semi-groups
4. Groups
5. Fields
6. Boolean Algebra
part III Mathematical logic
chapter 4 The propositional calculus
1. Introduction
2. The Language of the Propositional Calculus
3. Parentheses-Omitting Conventions
4. The Concept of a "Proof"
5. Components and Wff-Builders
6. Normal Form
7. Syntactical Transforms and Duality
8. More Provable Wff
9. The Completeness of the Propositional Calculus
10. The Consequences of a Set of Wff
chapter 5 The predicate calculus
1. Introduction
2. The Language of the Predicate Calculus
3. Parentheses-Omitting Conventions
4. Some Syntactical Transforms
5. Structures, Swff and Models
6. The Concept of a Proof
7. Some Results About Proofs and Provable Wff
8. Components and Wff-Builders
9. Duality
10. Prenex Normal Form
11. The Consequences of a Set of Wff
chapter 6 The completeness of the predicate calculus
1. The Extended Completeness Theorem
2. Maximal-Consistent Sets
3. Ζ-Complete Sets
4. Proof of the Extended Completeness Theorem
5. Some Consequences of the Extended Completeness Theorem
6. Algebraic Structures
7. The Diagram of a Structure
appendix Complete theories
1. Introduction
2. Vaughtβs Test
3. On Simplifying the Concept of a Model
4. Robinsonβs Test
References
Answers
Index
β¦ Subjects
axiomaticmethodi0000ligh
π SIMILAR VOLUMES
This text was developed for a course at the upper-sophomore or junior level within the mathematics curriculum. It is intended as a course in logic useful to the student of mathematics rather than as a beginning course for a prospective specialist in philosophy. I have no doubt that the sophisticated