Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CSL
2001
Springer

favoriteEmaildiscussreport

114views Automated Reasoning» more CSL 2001»

On a Generalisation of Herbrand's Theorem

13 years 9 months ago

On a Generalisation of Herbrand's Theorem

Download cl-informatik.uibk.ac.at

In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the length of Herbrand disjunctions in terms of proof length and logical complexity of the end-formula as usual. The main result is that we can bound the length of the reduct of Herbrand disjunctions in this way. (Reducts are deﬁned by omitting numerals.)

Matthias Baaz, Georg Moser

Real-time Traffic

Automated Reasoning | CSL 2001 | Herbrand Disjunctions | Induction Deriving Numerals | Logical Rule |

claim paper

Related Content

» On Herbrands Theorem

» Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

» Saturated models of universal theories

» A Hidden Herbrand Theorem

» Herbrands Theorem Skolemization and Proof Systems for FirstOrder Lukasiewicz Logic

» Bertrand Russell Herbrands Theorem and the Assignment Statement

» Herbrands theorem and term induction

» On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arit...

» Interprocedural Herbrand Equalities

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	CSL
Authors	Matthias Baaz, Georg Moser

Comments (0)