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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Studibuch, Stuttgart, Allemagne
hardcover. Etat : Sehr gut. 153 Seiten; 9780821845769.2 Gewicht in Gramm: 1. N° de réf. du vendeur 1345355
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 153 pages. 10.25x7.25x0.50 inches. In Stock. N° de réf. du vendeur __0821845764
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 6019066-n
Quantité disponible : 2 disponible(s)
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Hardback. Etat : New. 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. N° de réf. du vendeur LU-9780821845769
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 6019066
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 6019066
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9780821845769_new
Quantité disponible : 2 disponible(s)
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Hardback. Etat : New. 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. N° de réf. du vendeur LU-9780821845769
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. 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. Series: Translations of Mathematical Monographs Reprint. Num Pages: 153 pages. BIC Classification: HPL; PBCD; PBK. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 260 x 184. Weight in Grams: 510. . 1993. Hardback. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780821845769
Quantité disponible : 1 disponible(s)
Vendeur : BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, Allemagne
Etat : gut. 1993. Complexity of Proofs and Their Transformations in Axiomatic Theories (Translations of Mathematical Monographs) In englischer Sprache. pages. N° de réf. du vendeur BN575392
Quantité disponible : 1 disponible(s)