A Proof Of Syntactic Incompleteness Of The Second-Order Categorical Arithmetic

eBook (PDF), 6 Pages
This item has not been rated yet
Price: Free
Actually, Arithmetic is considered as syntactically incomplete. However there are different types of arithmetical theories. One of the most important is the SecondOrder Categorical Arithmetic(AR), which interprets the induction principle by the socalled full semantics.Now who ever concluded that AR is sintactically (or semantically, from the categoricity)incomplete? Since this theory is not effectively axiomatizable, the incompleteness Theorems cannot be applied to it. Nor is it legitimate to assert that the undecidability for a statements is generally kept in passing from a certain theory (e.g. PA) to another that includes it (e.g. AR). Of course, although the language of AR is semantically incomplete, this does not imply that the same AR is semantically/sintactically incomplete. Pending a response to the previous question, this paper presents a proof of the syntactic/semantical incompleteness of AR, by examples based on the different modes of representation (i.e. codes) of the... More > natural numbers in computation< Less
Available in PDF Format

Ratings & Reviews

Log in to review this item
There are no reviews for the current version of this product
There are no reviews for previous versions of this product

Product Details

April 20, 2017
File Format
File Size
166.66 KB
Product ID

Formats for this Ebook

Required Software Any PDF Reader, Apple Preview
Supported Devices Windows PC/PocketPC, Mac OS, Linux OS, Apple iPhone/iPod Touch... (See More)
# of Devices Unlimited
Flowing Text / Pages Pages
Printable? Yes
Report This Content to Lulu >

Moderation of Questionable Content

Thank you for your interest in helping us moderate questionable content on Lulu. If you need assistance with an order or the publishing process, please contact our support team directly.

How does this content violate the Lulu Membership Agreement?


Listed In

More From giuseppe raguní