Logic of Arithmetic

Walter Felscher (Autor)

Buch | Hardcover

312 Seiten

2000
Taylor & Francis Ltd (Verlag)
978-90-5699-268-2 (ISBN)

Artikel merken

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

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.

Felscher, Walter

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

Erscheint lt. Verlag	30.5.2000
Verlagsort	London
Sprache	englisch
Maße	152 x 229 mm
Gewicht	689 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
ISBN-10	90-5699-268-6 / 9056992686
ISBN-13	978-90-5699-268-2 / 9789056992682
Zustand	Neuware