Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
First-Order Schemata and Inductive Proof Analysis

First-Order Schemata and Inductive Proof Analysis

Cerna, David Michael
Lolic, Anela
Leitsch, Alexander

Hardcover

Series: Computer Science Foundations and Applied Logic

FictionGeneral ComputersHistory & Philosophy of Science

Currently unavailable to order

ISBN10: 303205740X
ISBN13: 9783032057402
Publisher: Birkhauser
Published: Jan 3 2026
Pages: 246
Weight: 1.14
Height: 0.77 Width: 6.47 Depth: 9.38
Language: English

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.

Also from

Leitsch, Alexander

View All

Also in

General Computers

View All