Cantitate/Preț
Produs
Total produse
Vezi coșul
Logic of Arithmetic de Walter Felscher

Logic of Arithmetic

Autor Walter Felscher
en Limba Engleză Hardback – 30 mai 2000
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.
Citește tot Restrânge

Preț: 90276 lei

Preț vechi: 110093 lei
-18%

Puncte Express: 1354
Paperback 51426 lei
Hardback 90276 lei

Carte tipărită la comandă

Livrare economică 14-28 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9789056992682
ISBN-10: 9056992686
Pagini: 312
Dimensiuni: 152 x 229 x 25 mm
Greutate: 0.74 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press

Cuprins

1. Consistency, Decidability, Completeness for the Arithmetic of Order with Successor 2. Consistency, Decidability, Completeness for the Arithmetic of Addition and Order 3. Antinomies, Pseudomenos, and Their Analysis 4. Undefinability and Incompleteness, General Theory 5.Elementary and Primitive Recursive Functions 6. Recursive Relations and Recursive Functions 7. The Arithmitization of Syntax 8. Consequences of Arithmetization 9. Axioms for Arithmetic 10. Peano Arithmetic PA and Its Expansion PR 11. Unprovability of Consistency

Descriere

For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulaas. 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.