László Kalmár. Another proof of the Gödel-Rosser incompletability theorem. Acta scientiarum mathetnaticarum , Bd. 12A , S. 38–43 [Book Review]

Journal of Symbolic Logic 30 (3):386 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269661

Links

PhilArchive



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

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, Another Proof of the Godel-Rosser Incompletability Theorem. [REVIEW]Gunter Asser - 1965 - Journal of Symbolic Logic 30 (3):386-386.
Kalmár László. Another proof of the Markov-Post theorem. English with Russian summary. Acta mathematica Academiae Scientiarum Hungaricae, vol. 3 , pp. 1–27. [REVIEW]William W. Boone - 1958 - Journal of Symbolic Logic 23 (4):447-448.
Review: Laszlo Kalmar, Une Forme du Theoreme de Godel Sous des Hypotheses Minimales; Laszlo Kalmar, Quelques Formes Generales du Theoreme de Godel. [REVIEW]Leon Henkin - 1950 - Journal of Symbolic Logic 15 (3):230-230.
Review: Laszlo Kalmar, Recent Results Concerning the Foundations of Mathematics; Alfred Renyi, Gyorgy Alexits, Janos Aczel, Remarks Concerning the Lecture of Laszlo Kalmar; Laszlo Kalmar, Laszlo Kalmar's Reply. [REVIEW]John G. Kemeny - 1959 - Journal of Symbolic Logic 24 (2):174-174.
Can Gödel's Incompleteness Theorem be a Ground for Dialetheism?Seungrak Choi - 2017 - Korean Journal of Logic 20 (2):241-271.
How to Say Things with Formalisms.David Auerbach - 1992 - In Michael Detlefsen (ed.), Proof, Logic and Formalization. London, England: Routledge. pp. 77--93.
Review: Laszlo Kalmar, Another Proof of the Markov-Post Theorem. [REVIEW]William W. Boone - 1958 - Journal of Symbolic Logic 23 (4):447-448.
A Simplified Proof of the Church–Rosser Theorem.Yuichi Komori, Naosuke Matsuda & Fumika Yamakawa - 2014 - Studia Logica 102 (1):175-183.
Kalmár László. Contributions to the reduction theory of the decision problem. Third paper. Prefix … , a single binary predicate. English with Russian abstract. Acta mathematica Academiae Scientiarum Hungaricae, vol. 2, pp. 19–38. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (3):264-264.
Kalmár Lászlô. Contributions to the reduction theory of the decision problem. First paper. Prefix … , a single binary predicate. English with Russian abstract. Acta mathematica Academiae Scientiarum Hungaricae , vol. 1 no. 1 , pp. 64–73. [REVIEW]Alonzo Church - 1952 - Journal of Symbolic Logic 17 (1):73-73.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.
Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.
Hajnal András and Kalmár László. An elementary combinatorial theorem with an application to axiomatic set theory. Publicationes mathematlcae , vol. 4 , pp. 431–449.Burger E.. Eine Bemerkung zur Bernays-Godel-Mengenlehre. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 178–179. [REVIEW]Azriel Levy - 1960 - Journal of Symbolic Logic 25 (4):354-354.
Wittgenstein as his own worst enemy: The case of gödel's theorem.Mark Steiner - 2001 - Philosophia Mathematica 9 (3):257-279.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.

Analytics

Added to PP
2016-06-30

Downloads
27 (#584,441)

6 months
4 (#779,417)

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