A Finitary Model of Peano Arithmetic

15 years 4 months ago

Download alixcomsi.com

We define a finitary model of first-order Peano Arithmetic in which satisfaction and quantification are interpreted constructively in terms of Turing-computability.

Bhupinder Singh Anand

Real-time Traffic

Computer Science | FCS 2008 | Finitary Model | First-order Peano Arithmetic |

claim paper

Related Content

» Why Brouwer Was Justified in his Objection to Hilberts Unqualified Interpretation of Quant...

» A standard model of Peano arithmetic with no conservative elementary extension

» Definability of Initial Segments

» Nonstandard models that are definable in models of Peano Arithmetic

» The minimal edegree problem in fragments of Peano arithmetic

» Bounding homogeneous models

» Die Another Day

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	FCS
Authors	Bhupinder Singh Anand

Comments (0)

Sciweavers

A Finitary Model of Peano Arithmetic

Computer Science | FCS 2008 | Finitary Model | First-order Peano Arithmetic |

Explore & Download

Productivity Tools

Sciweavers