+612 9045 4394
 
CHECKOUT
Automated Development of Fundamental Mathematical Theories : Automated Reasoning Series - Art Quaife

Automated Development of Fundamental Mathematical Theories

Automated Reasoning Series

Hardcover Published: 30th November 1992
ISBN: 9780792320210
Number Of Pages: 273

Share This Book:

Hardcover

RRP $844.99
$585.25
31%
OFF
or 4 easy payments of $146.31 with Learn more
Ships in 7 to 10 business days

The author provides an introduction to automated reasoning, and in particular to resolution theorem proving using the prover OTTER. He presents a new clausal version of von Neumann-Bernays-Godel set theory, and lists over 400 theorems proved semiautomatically in elementary set theory. He presents a semiautomated proof that the composition of homomorphisms is a homomorphism, thus solving a challenge problem.
The author next develops Peano's arithmetic, and gives more than 1200 definitions and theorems in elementary number theory. He gives part of the proof of the fundamental theorem of arithmetic (unique factorization), and gives and OTTER-generated proof of Euler's generalization of Fermat's theorem.
Next he develops Tarski's geometry within OTTER. He obtains proofs of most of the challenge problems appearing in the literature, and offers further challenges. He then formalizes the modal logic calculus K4, in order to obtain very high level automated proofs of Lob's theorem, and of Godel's two incompleteness theorems. Finally he offers thirty-one unsolved problems in elementary number theory as challenge problems.

` Quaife's work represents a breakthrough in automated reasoning for demonstrating that proofs of deep, well-known theorems of set theory and number theory can be mechanically derived, in a practical way, from the most elegant, simple, and general purpose foundations: set theory (a finite, first order axiomatization) and resolution (as implemented in the Otter system). ' Robert Boyer, University of Texas at Austin

Preface: A Personal View of Automated Reasoning Research
Introduction to Automated Reasoning
Von Neumann-Bernays-G÷del Set Theory
Peano's Arithmetic
Tarski's Geometry
L÷b's Theorem and G÷del's Two Incompleteness Theorems
Unsolved Problems in Elementary Number Theory
G÷del's Axioms for Set Theory
Theorems Proved in NBG Set Theory
Theorems Proved in Peano's Arithmetic
Bibliography
Index of Names
Index of Subjects
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780792320210
ISBN-10: 0792320212
Series: Automated Reasoning Series
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 273
Published: 30th November 1992
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 23.4 x 15.6  x 1.7
Weight (kg): 1.31