Reference18 articles.
1. Calude, Cristian, et al., 1995, “Strong Determinism vs. Computability”, in W. DePauli-Schimanovich et al., editors, The Foundational Debate, Kluwer Academic, Dordrecht, pp. 115–131.
2. Church, Alonzo, 1936, “An Unsolvable Problem in Elementary Number Theory”, American Journal of Mathematics vol. 58, pp. 345–363.
3. Davis, Martin, editor, 1965, The Undecidable,Raven Press, Hewlett, N.Y. Hintikka, Jaakko, 1996, The Principles of Mathematics Revisited. Cambridge U.P., xii + 288 pp.
4. Hintikka, Jaakko, 1995, “What Is Elementary Logic?” in K. Gavroglu et al., editors, Physics, Philosophy, and the Scientific Community, Kluwer Academic, Dordrecht, pp. 301–326.
5. Hintikka, Jaakko, 1956, “Identity, Variables and Impredicative Definitions”, Journal of Symbolic Logic vol. 21, pp. 225–245.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Inductive Turing Machines;Unconventional Computing;2018
2. Hypercomputation: philosophical issues;Theoretical Computer Science;2004-06
3. On the Epistemology of Game-Theoretical Semantics;Philosophy and Logic in Search of the Polish Tradition;2003