ParhainHinta.fi
First-Order Schemata and Inductive Proof Analysis

Birkhäuser

First-Order Schemata and Inductive Proof Analysis

Alin havaittu hinta

175,99 €
1 kauppa

Hinnat kaupoissa

1 tarjous
Springer Nature Link Shop
Havaittu
175,99 €
Siirry kauppaan

Hinnat ovat viimeksi havaittuja. Tarkista ajantasainen hinta, saatavuus ja toimituskulut kaupasta.

Hintahistoria

1 hintahavainto

Kaavio näyttää kunkin havaintopäivän alimman tallennetun tuotehinnan. Havaintojen välistä hintaa ei ole vahvistettu.

Hinta nyt 175,99 €. Alin havaittu 175,99 €, korkein 175,99 €.

Alin havaittu
175,99 €
Korkein havaittu
175,99 €
Viimeisin historian havainto
Hintahistoria: 1 havaintopäivä175,99 €8.11.2026: 175,99 €8.11.2026
Näytä hintahavainto
Hinta havaittu (Suomen aika)Hinta
175,99 €

Tuotetiedot

Schemata are formal tools for describing inductive reasoning. They opened a new area in the analysis of inductive proofs. The book introduces schemata for first-order terms, first-order formulas and first-order inference systems. Based on general first-order schemata, the cut-elimination-by-resolution (CERES) method—developed around the year 2000—is extended to schematic proofs. This extension requires the development of schematic methods for resolution and unification which are defined in this book. The added value of proof schemata compared to other inductive approaches consists in the extension of Herbrand’s theorem to inductive proofs (in the form of Herbrand systems, which can be constructed effectively). An application to an analysis of mathematical proof is given. The work also contains and extends the newest results on schematic unification and corresponding algorithms. Core topics covered: first-order schemata cut-elimination by resolution point transition systems schematic resolution Herbrand systems inductive proof analysis This volume is the first comprehensive work on first-order schemata and their applications. As such, it will be eminently suitable for researchers and PhD students in logic and computer science either working or with an interest in proof theory, inductive reasoning and automated deduction. Prerequisites are a firm knowledge of first-order logic, basic knowledge of automated deduction and a background in theoretical computer science. Alexander Leitsch and Anela Lolic are affiliated with the Institute of Logic and Computation of the Technische Universität Wien, David M. Cerna with the Czech Academy of Sciences, Institute of Computer Science (Ústav informatiky AV ČR, v.v.i.).

Brändi
Birkhäuser
EAN / GTIN
9783032057402