Computational Natural Deduction
The formalization of the notion of a logically sound argument as a natural deduction proof offers the prospect of a computer program capable of constructing such arguments for conclusions of interest. We present a constructive definition for a new subclass of natural deduction proofs, called atomic normal form (ANF) proofs. A natural deduction proof is readily understood as an argument leading from a set of premisses, by way of simple principles of reasoning, to the conclusion of interest....[Show more]
|Collections||Open Access Theses|
|04Chapter4-7_keronen.pdf||4.7 MB||Adobe PDF|
|03Chapte1-3_keronen.pdf||3.51 MB||Adobe PDF|
|01Front_keronen.pdf||Front Matter_FOR ACCESS TO THIS THESIS PLEASE GO TO http://anulib.anu.edu.au/about/collections/theses_externalaccess.html||751.84 kB||Adobe PDF|
|Keronen Thesis 2004.pdf||8.93 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.