Complexity of Proofs and Their Transformations in Axiomatic Theories
Regular price
€174.84
14 days return policy
Shipping & Delivery
A01=American Mathematical Society
Author_American Mathematical Society
Category=PBCD
Category=PBK
Category=QDTL
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Product details
- ISBN 9780821845769
- Weight: 510g
- Publication Date: 30 Oct 1993
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
The aim of this work is to develop the tool of logical deduction schemata and use it to establish upper and lower bounds on the complexity of proofs and their transformations in axiomatized theories. The main results are establishment of upper bounds on the elongation of deductions in cut eliminations; a proof that the length of a direct deduction of an existence theorem in the predicate calculus cannot be bounded above by an elementary function of the length of an indirect deduction of the same theorem; a complexity version of the existence property of the constructive predicate calculus; and, for certain formal systems of arithmetic, restrictions on the complexity of deductions that guarantee that the deducibility of a formula for all natural numbers in some finite set implies the deducibility of the same formula with a universal quantifier over all sufficiently large numbers.
