Logic of Arithmetic

Inbunden, Engelska, 2000

Av Walter Felscher

2 079 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 169 kr

Skickas inom 7-10 vardagar

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.

Produktinformation

Utgivningsdatum2000-05-30
Mått152 x 229 x 21 mm
Vikt740 g
FormatInbunden
SpråkEngelska
Antal sidor312
FörlagTaylor & Francis Ltd
ISBN9789056992682

Tillhör följande kategorier

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