Walter Felscher

Logic of Arithmetic (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 312
• Erscheinungstermin: 30. Mai 2000
• Englisch
• ISBN-13: 9781482283013
• Artikelnr.: 57531005

Autorenporträt

Felscher, Walter

Inhaltsangabe

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