Review: Rozsa Peter, The Bounds of the Axiomatic Method [Book Review]

Journal of Symbolic Logic 6 (3):111-111 (1941)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268606

Links

PhilArchive



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

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

Review: Laszlo Kalmar, Reduction of the Decision Problem to the Satisfiability Question of Logical Formulae on a Finite Set. [REVIEW]Rózsa Péter - 1955 - Journal of Symbolic Logic 20 (1):72-72.
Review: Laszlo Kalmar, Egyszeru Pelda Eldonthetetlen Aritmetikai Problemara (Ein Einfaches Beispiel fur ein Unentscheidbares Arithmetisches Problem). [REVIEW]Rózsa Péter - 1944 - Journal of Symbolic Logic 9 (1):24-24.
Review: Laszlo Kalmar, A Hilbert-fele Bizonyitaselmelet Celkituzesei, Modszerei es Eredmenyei (Zielsetzungen, Methoden und Ergebnisse der Hilbertschen Beweistheorie). [REVIEW]Rózsa Péter - 1941 - Journal of Symbolic Logic 6 (3):110-111.
Review: A. H. Lightstone, The Axiomatic Method. An Introduction to Mathematical Logic. [REVIEW]Peter Andrews - 1966 - Journal of Symbolic Logic 31 (1):106-108.
.[author unknown] - unknown
Review: W. V. Quine, On Derivability. [REVIEW]Rozsa Peter - 1938 - Journal of Symbolic Logic 3 (1):53-53.
The intuitiveness and truth of modern physics.Peter Mittelstaedt - 2006 - In Emily Carson & Renate Huber (eds.), Intuition and the Axiomatic Method. Springer. pp. 251--266.
Review: W. W. Tait, Nested Recursion. [REVIEW]Rózsa Péter - 1963 - Journal of Symbolic Logic 28 (1):103-104.
Review: Paul Axt, Enumeration and the Grzegorczyk Hierarchy. [REVIEW]Rozsa Peter - 1965 - Journal of Symbolic Logic 30 (1):90-91.
Review: Andrzej Grzegorczyk, Fonctions Recursives. [REVIEW]Rozsa Peter - 1966 - Journal of Symbolic Logic 31 (3):481-483.
Review: Rozsa Peter, Uber die Mehrfache Rekursion. [REVIEW]S. C. Kleene - 1937 - Journal of Symbolic Logic 2 (1):57-57.
Review: S. C. Kleene, $lambda$-Definability and Recursiveness. [REVIEW]Rózsa Péter - 1937 - Journal of Symbolic Logic 2 (1):38-39.
A. M. Turing. Computability and λ-definability. The journal of symbolic logic, Bd. 2 , S. 153–163. [REVIEW]Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.

Analytics

Added to PP
2013-11-22

Downloads
13 (#1,034,116)

6 months
6 (#514,728)

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