Abstract
This study examines how the Gödel phenomena are to be treated in core logic. We show in formal detail how one can use core logic in the metalanguage to prove Gödel’s incompleteness theorems for arithmetic even when classical logic is used for logical closure in the object language.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have