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.

About the Author
Felscher, Walter


Book Information
ISBN 9789056992682
Author Walter Felscher
Format Hardback
Page Count 312
Imprint Taylor & Francis Ltd
Publisher Taylor & Francis Ltd
Weight(grams) 689g