Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Relative Complexities of First Order Calculi

Name: Relative Complexities of First Order Calculi
Brand: Friedrich Vieweg & Sohn Verlagsgesellschaft mbH
SKU: 06802517
Price: 55.69 EUR
Availability: InStock
Author: Elmar Eder
ISBN: 9783528051228

Elmar Eder

Език

Английски език

Книга С твърди корици

Код Либристо: 06802517

Издателство Friedrich Vieweg & Sohn Verlagsgesellschaft mbH, април 1992

In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest pro... Цялото описание

Код Либристо: 06802517

135 b

55.69 €

108.91 лв

Външен склад Изпращаме след 5-8 дни

До 30 дни за връщане на стоки

Клиентите са закупили също

Die drei ??? Kids, 97, Die Fragezeichen-Falle Stefani Kampmann

С твърди корици

10.92 € 21.35 лв

FRONTERA INFINITA NUM. 3 DE 3 WILLIAMSON

С меки корици

13.80 € 26.99 лв

Champagne e cambiali. Nuove storie e leggende dei produttori italiani da Cinecittà a Hollywood Domenico Monetti

С меки корици

26.73 € 52.29 лв

Infanta Bodo Kirchhoff

С меки корици

14.32 € 28.00 лв

Mali WIELCY. Elton John Maria Isabel Sanchez-Vegara

С твърди корици

9.27 € 18.13 лв

Politik Iktisadin Gündemi

С меки корици

10.71 € 20.95 лв

Las Aves: Salvados de la Extinción Mattern

С меки корици

10.71 € 20.95 лв

Voyage aux Régions Équinoxiales du Nouveau Continent - Tome 8 - Angostura Humboldt

С меки корици

26.48 € 51.78 лв

El delito de quebrantamiento en el ámbito de la violencia de género Cueto Moreno

С меки корици

41.52 € 81.20 лв

Catalogue de Tableaux Par Meissonier, Decamps, Marilhat Francis Petit

С меки корици

13.65 € 26.69 лв

Gib auf dich acht! Theresia Singer

Аудио компактдиск

11.64 € 22.76 лв

Quanto Sabes De... Futebol Indoor Wanceulen Notebook

С меки корици

10.97 € 21.45 лв

La Notte dell'Incanto MS Daniela Piccolo

С меки корици

12.93 € 25.28 лв

heiligen Zeiten und Feste nach ihrer Geschichte und Feier in der kath. Kirche Nickel Markus Adam Nickel

С меки корици

30.08 € 58.84 лв

El libro de yoga Swami Vishnu Devananda

С меки корици

19.11 € 37.37 лв

Obstbaumschnitt Helmut Loose

С меки корици

9.32 € 18.23 лв

Sicilia Nel 1876 ... Libro Primo. (L. F. Condizioni Politiche E Amministrative. Libro Secondo. S. Sonnino. I Contadini.). Leopoldo Franchetti

С меки корици

26.78 € 52.39 лв

In this paper, a comparison is made of several proof calculi in terms of the lengths of shortest proofs for some given formula of first order predicate logic with function symbols. In particular, we address the question whether, given two calculi, any derivation in one of them can be simulated in the other in polynomial time. The analogous question for propositional logic has been intensively studied by various authors because of its implications for complexity theory. And it seems there has not been as much endeavour in this field in first order logic as there has been in propositional logic. On the other hand, fOr most of the practical applications of logic, a powerful tool such as the language of first order logic is needed. The main interest of this investigation lies in the calculi most frequently used in automated theorem proving, the resolution calculus, and analytic calculi such as the tableau calculus and the connection method. In automated theorem proving there are two important aspects of complexity. In order to have a good theorem proving system, we must first have some calculus in which we can express our derivations in concise form. And second, there must be an efficient search strategy. This book deals mainly with the first aspect which is a necessary condition for the second since the length of a shortest proof always also gives a lower bound to the complexity of any strategy.