A Decidable Class Of Equations In Recursive Arithmetic

&
Mathematical Logic Quarterly 12 (1):235-239 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19660120118

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

My notes

Similar books and articles

A Decidable Class of Equations in Recursive Arithmetic.R. L. Goodstein & R. D. Lee - 1968 - Journal of Symbolic Logic 33 (4):618-619.
Review: R. L. Goodstein, R. D. Lee, A Decidable Class of Equations in Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-619.
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.
Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Mathematical Logic Quarterly 9 (12‐15):199-201.
Review: R. L. Goodstein, A Decidable Fragment of Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-618.
A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (12-15):199-201.
On the contrapositive of countable choice.Hajime Ishihara & Peter Schuster - 2011 - Archive for Mathematical Logic 50 (1-2):137-143.
Goodstein R. L. and Lee R. D.. A decidable class of equations in recursive arithmetic. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 , pp. 235–239. [REVIEW]V. Vuckovic - 1969 - Journal of Symbolic Logic 33 (4):618-618.
An Extention of the Decidable Class of Equations Considered by Goodstein and Lee.Nadejda Georgieva - 1978 - Mathematical Logic Quarterly 24 (25‐30):399-404.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
Godel's theorem in retrospect.Martin Tabakov - 1984 - Bulletin of the Section of Logic 13 (3):132-134.
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.
Initial Segments of the Lattice of $\Pi^0_1$ Classes.Douglas Cenzer & Andre Nies - 2001 - Journal of Symbolic Logic 66 (4):1749-1765.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP
2017-02-21

Downloads
7 (#1,360,984)

6 months
1 (#1,516,429)

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