Paulson, L. C. (2015). A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle. Journal of automated reasoning, 55(1), 1-37. https://doi.org/10.1007/s10817-015-9322-8
Citace podle Chicago (17th ed.)Paulson, Lawrence C. "A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle." Journal of Automated Reasoning 55, no. 1 (2015): 1-37. https://doi.org/10.1007/s10817-015-9322-8.
Citace podle MLA (9th ed.)Paulson, Lawrence C. "A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle." Journal of Automated Reasoning, vol. 55, no. 1, 2015, pp. 1-37, https://doi.org/10.1007/s10817-015-9322-8.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..