Baker, Siani

2018-01-31T11:16:39Z

2018-01-31T11:16:39Z

1993

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.

http://hdl.handle.net/1842/26197

The University of Edinburgh

Annexe Thesis Digitisation Project 2017 Block 15

Aspects of the constructive omega rule within automated deduction

Thesis or Dissertation

Doctoral

PhD Doctor of Philosophy