Affiliation:
1. Computer Science Department, State University of New York, 1400 Washington Avenue, Albany, New York 12222, USA
Abstract
Abstract
Our previous research showed that the semantic tableau deductive methodology of Fitting and Smullyan permits boundary-case exceptions to the second incompleteness theorem, if multiplication is viewed as a 3-way relation (rather than as a total function). It is known that tableau methodologies prove a schema of theorems verifying all instances of the law of the excluded middle. But if one promotes this schema of theorems into formalized logical axioms, then the meaning of the pronoun of ‘I’, used by our self-referencing engine, changes quite sharply. Our partial evasions of the second incompleteness theorem shall then come to a complete halt.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference57 articles.
1. Existentially closed structures and Gödel’s second incompletenes theorem;Adamowicz;Journal of Symbolic Logic,2001
2. On Herbrand consistency in weak theories;Adamowicz;Archive for Mathematical Logic,2001
3. Explicit provablity and constructive semantics;Artemov;Bulletin of Symbolic Logic,2001
4. The provability of consistency;Artemov;Cornell Archives,2020
5. Provability logic;Artemov,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献