Review: Henry A. Pogorzelski, Commutative Recursive word Arithmetic in the Alphabet of Prime Numbers [Book Review]

Journal of Symbolic Logic 31 (2):271-271 (1966)
  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,783

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

Commutative recursive word arithmetic in the alphabet of prime numbers.Henry A. Pogorzelski - 1964 - Notre Dame Journal of Formal Logic 5 (1):13-23.
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: H. A. Pogorzelski, Recursive Arithmetic of Skolem. [REVIEW]R. L. Goodstein - 1964 - Journal of Symbolic Logic 29 (2):101-102.
A Note on an Arithmetization of a Word System in a Denumerable Alphabet.H. A. Pogorzelski - 1962 - Mathematical Logic Quarterly 8 (3‐4):247-249.
Word Arithmetic: Theory of Primitive Words.H. A. Pogorzelski - 1962 - Mathematical Logic Quarterly 8 (3‐4):251-255.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Is Euclid's proof of the infinitude of prime numbers tautological?Zeeshan Mahmud - manuscript
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
Primitive words in an infinite abstract alphabet.H. A. Pogorzelski - 1964 - Mathematical Logic Quarterly 10 (13‐17):193-198.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Review: R. L. Goodstein, A Decidable Fragment of Recursive Arithmetic. [REVIEW]V. Vuckovic - 1968 - Journal of Symbolic Logic 33 (4):618-618.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
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.
Recantation or any old w-sequence would do after all.Paul Benacerraf - 1996 - Philosophia Mathematica 4 (2):184-189.
Discontinuities of provably correct operators on the provably recursive real numbers.William J. Collins & Paul Young - 1983 - Journal of Symbolic Logic 48 (4):913-920.

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