Cantitate/Preț
Produs
Total produse
Vezi coșul
An Introduction to Metalogic de Aladdin M. Yaqub

An Introduction to Metalogic

Autor Aladdin M. Yaqub
en Limba Engleză Paperback – 24 oct 2014
An Introduction to Metalogic is a uniquely accessible introduction to the metatheory of first-order predicate logic. No background knowledge of logic is presupposed, as the book is entirely self-contained and clearly defines all of the technical terms it employs. Yaqub begins with an introduction to predicate logic and ends with detailed outlines of the proofs of the incompleteness, undecidability, and indefinability theorems, covering many related topics in between.
Citește tot Restrânge

Preț: 26480 lei

Preț vechi: 32119 lei
-18%

Puncte Express: 397
Preț estimativ în valută:
4682€ • 5593$ • 4055£

Carte disponibilă

Livrare economică 21 februarie-07 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9781554811717
ISBN-10: 1554811716
Pagini: 300
Dimensiuni: 178 x 229 x 16 mm
Greutate: 0.28 kg
Editura: BROADVIEW PR
Colecția Broadview Press
Locul publicării:Peterborough, Canada

Recenzii

An Introduction to Metalogic is a uniquely accessible introduction to the metatheory of first-order predicate logic. No background knowledge of logic is presupposed, as the book is entirely self-contained and clearly defines all of the technical terms it employs. Yaqub begins with an introduction to predicate logic and ends with detailed outlines of the proofs of the incompleteness, undecidability, and indefinability theorems, covering many related topics in between.

“This is an excellent text in intermediate logic that should be warmly received by students. The well-paced exposition is remarkably clear. The choice of material, including remarks on the philosophical significance of the principal theorems and welcome sections on Second-Order logic, seems just right. And the ample exercises at the end of each chapter, which range from easy to difficult, not only test the reader’s understanding, but move the subject forward. Highly recommended.” — David Keyt, Research Professor, University of Arizona; Professor Emeritus, University of Washington
“An Introduction to Metalogic provides extensive coverage of the usual meta-theoretic results concerning the standard logical systems. It covers the completeness theorems, compactness, the Löwenheim-Skolem theorems, and the incompleteness of arithmetic. There is also a good sketch of more advanced topics, giving the enthusiastic reader and student incentive to keep studying the field. As with Professor Yaqub’s earlier logic text, An Introduction to Logical Theory, the presentation is clear and straightforward.” — Stewart Shapiro, Ohio State University
“Yaqub has produced a pedagogically sensitive, yet completely rigorous tour of the introductory metalogical terrain. His textbook will be welcomed by instructors in philosophy, mathematics, computer science and linguistics who endeavor to offer their students something more substantial than standard introductory logic.” — Kai Wehmeier, University of California, Irvine

Cuprins

Introduction
Chapter One: First-Order Predicate Logic (PL)
1.1 The Syntax of PL
  1. The basic vocabulary of PL
  2. PL terms
  3. PL formulas
  4. Bound and free variables and PL sentences
1.2 The Semantics of PL
  1. PL interpretations
  2. Examples of PL interpretations
  3. Objectual and substitutional quantification
  4. The size of a PL interpretation
  5. The truth conditions of PL sentences
  6. Possible objections to substitutional quantification and replies
1.3 Logical Concepts in PL
  1. Definition of a PL argument
  2. Validity and logical consequence
  3. Definition of a valid argument
  4. Definition of an invalid argument
  5. Definition of a valid sentence
  6. Definition of a contradictory sentence
  7. Definition of a contingent sentence
  8. Definition of logically equivalent sentences
  9. Definition of a satisfiable set
  10. Definition of an unsatisfiable set
  11. Decidable and semidecidable concepts
1.4 PL Proof Theory
  1. The notion of formal derivation
  2. The statements of the Soundness and Completeness Theorems for PL
  3. Corollaries of the Soundness and Completeness Theorems
  4. The structure and application of inference rules
  5. The Natural Deduction System (NDS)
  6. A justification for the rule Explosion
  7. The Gentzen Deduction System (GDS)
1.5 Exercises
  • Solutions to the Starred Exercises
Chapter Two: Resources of the Metatheory
2.1 Linguistic and Logical Resources
  1. The metatheory of PL
  2. The language of the metatheory
  3. Logical resources
2.2 Arithmetical Resources
  1. The structure of the natural numbers
  2. The Principle of Mathematical Induction
2.3 Set-Theoretic Resources
  1. Basic concepts and principles
  2. Russell’s Paradox
  3. Relations and functions
  4. Cardinalities of sets
  5. Cantor’s Diagonal Argument
2.4 An Economical Version of PL
  1. Expressive completeness
  2. The Mini Deduction System (MDS)
2.5 Exercises
  • Solutions to the Starred Exercises
Chapter Three: The Soundness and Completeness Theorems
3.1 The Soundness Theorem
3.2 The Completeness Theorem
  1. An equivalent formulation of the Completeness Theorem
  2. Lindenbaum’s Lemma
  3. Henkin sets
  4. Henkin interpretations of Henkin sets without the identity predicate
  5. Henkin interpretations of Henkin sets with the identity predicate
3.3 The Compactness Theorem
  1. The Compactness Theorem
  2. The Finite-Satisfiability Theorem
3.4 Elementary Equivalence and Isomorphism
3.5 Properties of PL Sets
  1. PL theories
  2. Axiomatizable PL theories
  3. Complete and categorical PL sets
3.6 The Löwenheim-Skolem Theorem
  1. A proof of the theorem
  2. Skolem’s Paradox
3.7 Exercises
  • Solutions to the Starred Exercises
Chapter Four: Computability
4.1 Effective Procedures and Computable Functions
4.2 Turing Computability
  1. Turing machines
  2. An example
  3. Instruction lines and diagrams of Turing machines
  4. The zero, successor, and addition functions
  5. Turing-computable functions and Church’s Thesis
  6. Decidable and semidecidable sets
4.3 The Halting Problem
4.4 Partial Recursive Functions
4.5 Exercises
  • Solutions to the Starred Exercises
Chapter Five: The Incompleteness Theorems
5.1 Peano Arithmetic
5.2 Representability in Peano Arithmetic
5.3 Arithmetization of the Metatheory
5.4 Diagonalization and the First Incompleteness Theorem
  1. The Diagonalization Lemma
  2. Gödel’s First Incompleteness Theorem
5.5 Consequences of Diagonalization and Incompleteness
  1. The undecidability of consistent extensions of Peano Arithmetic
  2. Tarski’s Indefinability Theorem
  3. Church’s Undecidability Theorem
5.6 The Incompleteness of Second-Order Predicate Logic
  1. Second-Order Predicate Logic (PL²)
  2. Second-Order Peano Arithmetic
  3. PL2 and the Compactness Theorem
  4. The incompleteness of PL²
5.7 Gödel’s Second Incompleteness Theorem
  1. Hilbert’s Program
  2. The Provability Conditions
5.8 Exercises
  • Solutions to the Starred Exercises
Index