Refuting Tarski and Gödel with a Sound Deductive Formalism

Download Edit this record How to cite View on PhilPapers
The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.
PhilPapers/Archive ID
Upload history
First archival date: 2020-03-28
Latest version: 14 (2020-04-01)
View other versions
Added to PP index

Total views
55 ( #53,868 of 2,448,368 )

Recent downloads (6 months)
14 ( #40,080 of 2,448,368 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.