A01=Walter Felscher
advanced arithmetic logic foundations
atomic
Atomic Formulas
Atomic Sentences
Author_Walter Felscher
axiom
Axiom Systems
Canonically Represented
Category=PBCD
Category=PBCH
Consistency Proofs
decidability results
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Equality Logic
Follow
formal proof techniques
Formally Defined
formula
Free Variable Formula
FSO
function
H Ilb E Rt
Incompleteness Theorem
mathematical logic
Modus Ponens
natural
number
Open Formulas
Peano Arithmetic
Predicate Symbols
Prime Factor Decomposition
primitive
Primitive Recursive Functions
Primitive Recursively
Provable Sentence
Quantifier Elimination
quantifier elimination methods
recursion
recursive
Recursive Function
recursive function theory
Recursive Relations
Sequent Calculus
syntax arithmetisation
systems
Values Recursion
Product details
- ISBN 9789056992682
- Weight: 740g
- Dimensions: 152 x 229mm
- Publication Date: 30 May 2000
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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
