Aspects of the constructive omega rule within automated deduction

In general, cut elimination holds for arithmetical systems with the w -rule, but not for systems with ordinary induction. Hence in the latter, there is the problem of generalisation, since arbitrary formulae can be cut in. This makes automatic theorem -proving very difficult. An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semi- formal systems with the w -rule. This thesis describes the implementation of such a system. Moreover, an important application is presented in the form of a new method of generalisation by means of "guiding proofs" in the stronger system, which sometimes succeeds in producing proofs in the original system when other methods fail

The Computer Modelling of Mathematical Reasoning

xv, 403 p.; 23 cm

Graduate and Undergraduate Catalog, 2011-2012

Eastern Washington University\u27s course catalog for the 2011-2012 academic year.https://dc.ewu.edu/catalogs/1004/thumbnail.jp

Graduate and Undergraduate Catalog, 2010-2011

Eastern Washington University\u27s course catalog for the 2010-2011 academic year.https://dc.ewu.edu/catalogs/1005/thumbnail.jp

Graduate and Undergraduate Catalog, 2009-2010

Eastern Washington University\u27s course catalog for the 2009-2010 academic year.https://dc.ewu.edu/catalogs/1006/thumbnail.jp

Graduate and Undergraduate Catalog, 2007-2008

Eastern Washington University\u27s course catalog for the 2007-2008 academic year.https://dc.ewu.edu/catalogs/1008/thumbnail.jp