Advanced Logic for Applications [electronic resource] / by R.E. Grandy.

За: Інтелектуальна відповідальність: Вид матеріалу: Текст Серія: Synthese Library, Studies in Epistemology, Logic, Methodology, and Philosophy of Science ; 110Публікація: Dordrecht : Springer Netherlands : Imprint: Springer, 1977Видання: 1st ed. 1977Опис: XIII, 176 p. online resourceТип вмісту:
  • text
Тип засобу:
  • computer
Тип носія:
  • online resource
ISBN:
  • 9789401011914
Тематика(и): Додаткові фізичні формати: Printed edition:: Немає назви; Printed edition:: Немає назви; Printed edition:: Немає назвиДесяткова класифікація Дьюї:
  • 160 23
Класифікація Бібліотеки Конгресу:
  • BC1-199
Електронне місцезнаходження та доступ:
Вміст:
I. Henkin Sets and the Fundamental Theorem -- II. Derivation Rules and Completeness -- III. Gentzen Systems and Constructive Completeness Proofs -- IV. Quantification Theory with Identity and Functional Constants -- V. First Order Theories with Equality -- VI. Gödel’s Incompleteness Theorems: Preliminary Discussion -- VII. Undecidability and Incompleteness -- VIII. Gödel’s Second Incompleteness Theorem -- IX. Tarski’s Theorems and the Definition of Truth -- X. Some Recursive Function Theory -- XI. Intuitionistic Logic -- XII. Second Order Logic -- XIII. Algebraic Logic -- XIV. Anadic Logic -- Selected Bibliography -- Index of Names -- Index of Subjects -- Index of Symbols.
У: Springer Nature eBookЗведення: This book is intended to be a survey of the most important results in mathematical logic for philosophers. It is a survey of results which have philosophical significance and it is intended to be accessible to philosophers. I have assumed the mathematical sophistication acquired· in an introductory logic course or in reading a basic logic text. In addition to proving the most philosophically significant results in mathematical logic, I have attempted to illustrate various methods of proof. For example, the completeness of quantification theory is proved both constructively and non-constructively and relative ad­ vantages of each type of proof are discussed. Similarly, constructive and non-constructive versions of Godel's first incompleteness theorem are given. I hope that the reader· will develop facility with the methods of proof and also be caused by reflect on their differences. I assume familiarity with quantification theory both in under­ standing the notations and in finding object language proofs. Strictly speaking the presentation is self-contained, but it would be very difficult for someone without background in the subject to follow the material from the beginning. This is necessary if the notes are to be accessible to readers who have had diverse backgrounds at a more elementary level. However, to make them accessible to readers with no background would require writing yet another introductory logic text. Numerous exercises have been included and many of these are integral parts of the proofs.
Тип одиниці:
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

I. Henkin Sets and the Fundamental Theorem -- II. Derivation Rules and Completeness -- III. Gentzen Systems and Constructive Completeness Proofs -- IV. Quantification Theory with Identity and Functional Constants -- V. First Order Theories with Equality -- VI. Gödel’s Incompleteness Theorems: Preliminary Discussion -- VII. Undecidability and Incompleteness -- VIII. Gödel’s Second Incompleteness Theorem -- IX. Tarski’s Theorems and the Definition of Truth -- X. Some Recursive Function Theory -- XI. Intuitionistic Logic -- XII. Second Order Logic -- XIII. Algebraic Logic -- XIV. Anadic Logic -- Selected Bibliography -- Index of Names -- Index of Subjects -- Index of Symbols.

This book is intended to be a survey of the most important results in mathematical logic for philosophers. It is a survey of results which have philosophical significance and it is intended to be accessible to philosophers. I have assumed the mathematical sophistication acquired· in an introductory logic course or in reading a basic logic text. In addition to proving the most philosophically significant results in mathematical logic, I have attempted to illustrate various methods of proof. For example, the completeness of quantification theory is proved both constructively and non-constructively and relative ad­ vantages of each type of proof are discussed. Similarly, constructive and non-constructive versions of Godel's first incompleteness theorem are given. I hope that the reader· will develop facility with the methods of proof and also be caused by reflect on their differences. I assume familiarity with quantification theory both in under­ standing the notations and in finding object language proofs. Strictly speaking the presentation is self-contained, but it would be very difficult for someone without background in the subject to follow the material from the beginning. This is necessary if the notes are to be accessible to readers who have had diverse backgrounds at a more elementary level. However, to make them accessible to readers with no background would require writing yet another introductory logic text. Numerous exercises have been included and many of these are integral parts of the proofs.

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.