Logic for Mathematics and Computer Science
Stanley Burris
Abstract
Stanley Burris
Abstract
I. QUANTIFIER-FREE LOGICS. 1. From Aristotle to Boole. 2. Propositional Logic. 3. Equational Logic. 4. Predicate Clause Logic. II. LOGIC WITH QUANTIFIERS. 5. First-Order Logic: Introduction, and Fundamental Results on Semantics. 6. A Proof System for First-Order Logic and Goedel's Completeness Theorem. Appendix A. A Simple Timetable of Mathematical Logic and Computing. Appendix B. Dedekind-Peano Number System. Appendix C. Writing Up an Inductive Definition or Proof. Appendix D. FL Propositional Logic. Bibliography. Index.
OpenAlex reports 46 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
I. QUANTIFIER-FREE LOGICS. 1. From Aristotle to Boole. 2. Propositional Logic. 3. Equational Logic. 4. Predicate Clause Logic. II. LOGIC WITH QUANTIFIERS. 5. First-Order Logic: Introduction, and Fundamental Results on Semantics. 6. A Proof System for First-Order Logic and Goedel's Completeness Theorem. Appendix A. A Simple Timetable of Mathematical Logic and Computing. Appendix B. Dedekind-Peano Number System. Appendix C. Writing Up an Inductive Definition or Proof. Appendix D. FL Propositional Logic. Bibliography. Index.
Key concepts: Zeroth-order logic, Many-valued logic, Second-order logic, Predicate logic, Intermediate logic, Higher-order logic, Autoepistemic logic, Dynamic logic (digital electronics)