A Machine-Level Interpretation of Deductive Rules on Enact I and Enact II Model Theorems.

This research proposal is on provable forms based on s yntactic theorem using Kleene Axiom schema. Enact model I and II of propositional formulas from enactment logic are proven in terms of theorems based on deductive rules. Work proves by deduction rules that Enact Model I and II are model theorems[1] in machinelevel interpretation. Enactprover is a machine program for reading and writing Kleene theorem proving axioms based one enactment logic.

Content

Author and article information

Journal

Title: ScienceOpen Preprints

Publisher: ScienceOpen

Publication date (Electronic preprint): 4 November 2020

Affiliations

[1 ] KCL Department of ENGINEERING

Author information

Frank Appiah https://orcid.org/0000-0001-6732-9503

Article

DOI: 10.14293/S2199-1006.1.SOR-.PPVOHXY.v2

SO-VID: f5c55900-5026-48a4-932d-c0d46bbb4320

License:

This work has been published open access under Creative Commons Attribution License CC BY 4.0 , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Conditions, terms of use and publishing policy can be found at www.scienceopen.com .

History

Date received : 5 October 2020

Data availability: Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

ScienceOpen disciplines: Engineering

Keywords: model,composites,enactment,logic,proof,syntactic,theorem,enactprover,machine,Program