Complexity of Proofs and Their Transformations in Axiomatic Theories
Seiten
1993
American Mathematical Society (Verlag)
9780821845769 (ISBN)
American Mathematical Society (Verlag)
9780821845769 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Intends 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 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.
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.
Introduction Upper bounds on deduction elongation in cut elimination Systems of term equations with substitutions Logical deduction schemata in axiomatized theories Bounds for the complexity of terms occurring in proofs Proof strengthening theorems References.
| Erscheint lt. Verlag | 1.12.1994 |
|---|---|
| Reihe/Serie | Translations of Mathematical Monographs |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 510 g |
| Themenwelt | Geisteswissenschaften ► Philosophie ► Logik |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-13 | 9780821845769 / 9780821845769 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
ein Gegenentwurf zum kurzfristigen Denken : so werden wir zu den …
Buch | Hardcover (2023)
REDLINE (Verlag)
CHF 27,90
