A Decidable Fragment of Recursive Arithmetic

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (12-15):199-201 (1963)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Mathematical Logic Quarterly 9 (12‐15):199-201.
A Decidable Class of Equations in Recursive Arithmetic.R. L. Goodstein & R. D. Lee - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):235-239.
An Extention of the Decidable Class of Equations Considered by Goodstein and Lee.Nadejda Georgieva - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):399-404.
A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.
Nonstandard Models for a Fragment of the Arithmetic and Their Decision Problem.Ibrahim Garro - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):481-483.
Gödel's Second Incompleteness Theorem for General Recursive Arithmetic.William Ryan - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):457-459.
On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (3):245-253.

Analytics

Added to PP
2016-02-04

Downloads
22 (#733,560)

6 months
22 (#129,165)

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