Review: H. A. Pogorzelski, Recursive Arithmetic of Skolem [Book Review]

Journal of Symbolic Logic 29 (2):101-102 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

My notes

Similar books and articles

Review: R. L. Goodstein, Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus. [REVIEW]Th Skolem - 1958 - Journal of Symbolic Logic 23 (2):227-228.
Review: H. A. Pogorzelski, Primitive Words in an Infinite Abstract Alphabet; H. A. Pogorzelski, Skolem Arithmetics on Certain Concrete Word Systems. [REVIEW]V. Vuckovic - 1966 - Journal of Symbolic Logic 31 (2):271-271.
Review: Henry A. Pogorzelski, Commutative Recursive word Arithmetic in the Alphabet of Prime Numbers. [REVIEW]V. Vuckovic - 1966 - Journal of Symbolic Logic 31 (2):271-271.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Review: Th. Skolem, Some Considerations Concerning Recursive Arithmetic. [REVIEW]H. G. Rice - 1958 - Journal of Symbolic Logic 23 (2):228-228.
Review: Th. Skolem, Recursive Arithmetic. [REVIEW]Oiva Ketonen - 1948 - Journal of Symbolic Logic 13 (3):169-170.
Review: Thoralf Skolem, The Development of Recursive Arithmetic. [REVIEW]David Nelson - 1948 - Journal of Symbolic Logic 13 (1):54-54.
Commutative recursive word arithmetic in the alphabet of prime numbers.Henry A. Pogorzelski - 1964 - Notre Dame Journal of Formal Logic 5 (1):13-23.
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
A note on definability in fragments of arithmetic with free unary predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Review: R. L. Goodstein, A Decidable Fragment of Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-618.
Nonconcatenative Abstract Skolem Arithmetics I.H. A. Pogorzelski - 1965 - Mathematical Logic Quarterly 11 (2):89-92.

Analytics

Added to PP
2013-11-22

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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