For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of order-plus-addition (Pressburger arithmetic). It makes use of an algorithm eliminating quantifiers which, in turn, is also applied to obtain consistency proofs for these fragments.
| Author: Walter Felscher |
| Publisher: CRC Press |
| Publication Date: 36676 |
| Number of Pages: 312 pages |
| Binding: Medical |
| ISBN-10: 9056992686 |
| ISBN-13: 9789056992682 |
Related Products
Sale 9%
Sale 9%
