Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus

Journal of Symbolic Logic 18 (2):180-181 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268960

Other Versions

original Kreisel, G. (1953) "Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II". Proceedings of the XIth International Congress of Philosophy 14():39-49
reprint Kreisel, G. (1956) "Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II". Journal of Symbolic Logic 21(4):403-404

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

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

Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II.G. Kreisel - 1953 - Proceedings of the XIth International Congress of Philosophy 14:39-49.
Kreisel G.. Note on arithmetic models for consistent formulae of the predicate calculus. Fundamenta mathematicae, vol. 37 , pp. 265–285. [REVIEW]Hao Wang - 1953 - Journal of Symbolic Logic 18 (2):180-181.
Kreisel G.. Note on arithmetic models for consistent formulae of the predicate calculus II. Actes du Xlème Congrès International de Philosophie, Volume XIV, Volume complémentaire et communications du Colloque de Logique, North-Holland Publishing Company, Amsterdam 1953, und Éditions E. Nauwelaerts, Leuven 1953, S. 39–49. [REVIEW]G. Hasenjaeger - 1956 - Journal of Symbolic Logic 21 (4):403-404.
G. Kreisel. Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae. The journal of symbolic logic, vol. 23 no. 3 , pp. 317–330. [REVIEW]Joan Rand Moschovakis - 1967 - Journal of Symbolic Logic 32 (2):282-283.
G. Kreisel. On weak completeness of intuitionistic predicate logic. The journal of symbolic logic, vol. 27 no. 2 , pp. 139–158.Joan Rand Moschovakis - 1969 - Journal of Symbolic Logic 34 (1):119-120.

Analytics

Added to PP
2017-02-21

Downloads
9 (#1,532,902)

6 months
4 (#1,272,377)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Incompleteness Via Paradox and Completeness.Walter Dean - 2020 - Review of Symbolic Logic 13 (3):541-592.
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
Bernays and the Completeness Theorem.Walter Dean - 2017 - Annals of the Japan Association for Philosophy of Science 25:45-55.

Add more citations

References found in this work

No references found.

Add more references