ABSTRACT

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 alg

chapter |9 pages

Introduction

chapter |2 pages

Introduction to Chapters 3 – 9

chapter 7|10 pages

The Arithmetization of Syntax

chapter 8|25 pages

Consequences of Arithmetization

chapter 9|29 pages

Axioms for Arithmetic

chapter 10|36 pages

Peano Arithmetic PA and its Expansion PR

chapter 11|37 pages

Unprovability of Consistency

chapter |4 pages

Epilogue