ISBN: 9781482283013
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.
| Edition : | 00 |
| Number of Pages : | 311 |
| Published : | 05/30/2000 |
| isbn : | 9781482283013 |
