A diophantine undecidable subsystem of arithmetic with no induction axioms

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

A Note on Induction, Abstraction, and Dedekind-Finiteness.G. Aldo Antonelli - 2012 - Notre Dame Journal of Formal Logic 53 (2):187-192.
Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
Induction and foundation in the theory of hereditarily finite sets.Flavio Previale - 1994 - Archive for Mathematical Logic 33 (3):213-241.

Analytics

Added to PP
2014-04-01

Downloads
21 (#630,965)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references