Use this URL to cite or link to this record in EThOS:
Title: Aspects of the constructive omega rule within automated deduction
Author: Baker, S. L.
Awarding Body: University of Edinburgh
Current Institution: University of Edinburgh
Date of Award: 1992
Availability of Full Text:
Full text unavailable from EThOS.
Please contact the current institution’s library for further details.
In general, cut elimination holds for arithmetical systems with the ω-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 ω-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.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available