Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
1952.
Sentences Undecidable in Formalized Arithmetic - An Exposition of the Theory of Kurt gödel.
Vol. 10,
Issue. ,
p.
116.
1953.
Undecidable Theories.
Vol. 13,
Issue. ,
p.
89.
Härtig, Klaus
1956.
Explizite Definitionen einiger Eigenschaften von Zeichenreihen.
Mathematical Logic Quarterly,
Vol. 2,
Issue. 10-15,
p.
177.
Ritchie, Robert W.
1963.
Classes of predictably computable functions.
Transactions of the American Mathematical Society,
Vol. 106,
Issue. 1,
p.
139.
ARIKAWA, Setsuo
1970.
ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS.
Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics,
Vol. 24,
Issue. 1,
p.
47.
Niemi, Gunnar
1972.
On the existence of a modal antinomy.
Synthese,
Vol. 23,
Issue. 4,
p.
463.
1973.
Computability Theory.
p.
149.
Ottmann, Th.
1974.
Arithmetische Prädikate über einem Bereich endlicher Automaten.
Archiv für Mathematische Logik und Grundlagenforschung,
Vol. 16,
Issue. 3-4,
p.
159.
Deutsch, Michael
1975.
Zur Darstellung koaufzählbarer Prädikate bei Verwendung eines einzigen unbeschränkten Quantors.
Mathematical Logic Quarterly,
Vol. 21,
Issue. 1,
p.
443.
Deutsch, Michael
1975.
Zur Benutzung der Verkettung als Basis für die Arithmetik.
Mathematical Logic Quarterly,
Vol. 21,
Issue. 1,
p.
145.
Deutsch, Michael
1977.
Zum Begriff der Wortmischung ALS Basis Für Die Arithmetik.
Mathematical Logic Quarterly,
Vol. 23,
Issue. 16-17,
p.
241.
1977.
Logic Colloquium 76, Proceedings of a conference.
Vol. 87,
Issue. ,
p.
471.
Deutsch, Michael
1980.
Zur Gödelisierungsfreien Darstellung der Rekursiven und Primitiv‐Rekursiven Funktionen und Rekursiv Aufzählbaren Prädikate Über Quotiententermmengen.
Mathematical Logic Quarterly,
Vol. 26,
Issue. 1-6,
p.
1.
1981.
Fundamentals of Generalized Recursion Theory.
Vol. 105,
Issue. ,
p.
297.
Harnik, Victor
1987.
Set existence axioms for general (not necessarily countable) stability theory.
Annals of Pure and Applied Logic,
Vol. 34,
Issue. 3,
p.
231.
Perlis, Donald
1988.
Languages with self-reference II.
Artificial Intelligence,
Vol. 34,
Issue. 2,
p.
179.
Idziak, Pawe? M.
1988.
Undecidability of relatively free Hilbert algebras.
Algebra Universalis,
Vol. 25,
Issue. 1,
p.
17.
Thomas, Wolfgang
1989.
Formal Properties of Finite Automata and Applications.
Vol. 386,
Issue. ,
p.
104.
Treinen, Ralf
1990.
Foundations of Software Technology and Theoretical Computer Science.
Vol. 472,
Issue. ,
p.
48.
Quine, Willard van Orman
1991.
Immanence and Validity.
Dialectica,
Vol. 45,
Issue. 2/3,
p.
219.