1269:-
Uppskattad leveranstid 7-12 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
Andra format:
- Inbunden 2229:-
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.
- Format: Pocket/Paperback
- ISBN: 9780367398576
- Språk: Engelska
- Antal sidor: 312
- Utgivningsdatum: 2019-09-05
- Förlag: CRC Press