Henry A. Pogorzelski. Commutative recursive word arithmetic in the alphabet of prime numbers. Notre Dame journal of formal logic, vol. 5 no. 1 , pp. 13–23 [Book Review]

Journal of Symbolic Logic 31 (2):271 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269837

Links

PhilArchive



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

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

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: 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.
Commutative Recursive word Arithmetic in the Alphabet of Prime Numbers.Henry A. Pogorzelski - 1966 - Journal of Symbolic Logic 31 (2):271-271.
The substitution schema in recursive arithmetic.R. D. Lee - 1965 - Notre Dame Journal of Formal Logic 6 (3):193-200.
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.
Limited universal and existential quantifiers in commutative partially ordered recursive arithmetics.M. T. Partis - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):17-23.
Omitting the replacement schema in recursive arithmetic.T. J. Heath - 1967 - Notre Dame Journal of Formal Logic 8:234.
Omitting the replacement schema in recursive arithmetic.I. J. Heath - 1967 - Notre Dame Journal of Formal Logic 8 (3):234-238.
Recursive surreal numbers.Leon Harkleroad - 1990 - Notre Dame Journal of Formal Logic 31 (3):337-345.
Provably recursive real numbers.William J. Collins - 1978 - Notre Dame Journal of Formal Logic 19 (4):513-522.
H. A. Pogorzelski. Primitive words in an infinite abstract alphabet. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 193–198. - H. A. Pogorzelski. Skolem arithmetics on certain concrete word systems. Mathematica Scandinavica, vol. 14 , pp. 93–105. [REVIEW]V. Vučković - 1966 - Journal of Symbolic Logic 31 (2):271-271.
Lee R. D.. The substitution schema in recursive arithmetic. Notre Dame journal of formal logic, vol. 6 no. 3 , pp. 193–200. [REVIEW]H. E. Rose - 1968 - Journal of Symbolic Logic 32 (4):543-543.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Bolesław Sobociński. Certain extensions of modal system S4. Notre Dame journal of formal logic, vol. 11 no. 3 , pp. 347–368. - Bolesław Sobociński. Concerning some extensions of S4. Notre Dame journal of formal logic, vol. 12 , pp. 363–370. - G. F. Schumm. Solutions to four modal problems of Sobocinski. Notre Dame journal of formal logic, vol. 12 , pp. 335–340. - J. Jay Zeman. A study of some systems in the neighborhood of S4.4. Notre Dame journal of formal logic, vol. 12 , pp. 341–357. - Bolesław Sobociński. A new class of modal systems. Notre Dame journal of formal logic, vol. 12 , pp. 371–377. - Bolesław Sobociński. A proper subsystem of S4.04. Notre Dame journal of formal logic, vol. 12 , pp. 381–384. [REVIEW]M. J. Cresswell - 1975 - Journal of Symbolic Logic 40 (4):602.
Local recursive theory.Vladeta Vučković - 1973 - Notre Dame Journal of Formal Logic 14 (2):237-246.

Analytics

Added to PP
2016-06-30

Downloads
14 (#985,107)

6 months
4 (#775,606)

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