Author:
Smolka Gert,Stark Kathrin
Publisher
Springer International Publishing
Reference8 articles.
1. Ackermann, W.: Die Widerspruchsfreiheit der allgemeinen Mengenlehre. Math. Ann. 114(1), 305–315 (1937)
2. Givant, S., Tarski, A.: Peano arithmetic, the Zermelo-like theory of sets with finite ranks. Not. Am. Math. Soc. 77T–E51, A-437 (1977)
3. Kirby, L.: Finitary set theory. Notre Dame J. Formal Logic 50(3), 227–244 (2009)
4. Lecture Notes in Computer Science;LC Paulson,2015
5. Paulson, L.C.: A mechanised proof of Gödel’s incompleteness theorems using Nominal Isabelle. J. Autom. Reasoning 55(1), 1–37 (2015)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq;Journal of Automated Reasoning;2023-03
2. Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens;Logical Methods in Computer Science;2022-06-14
3. Trakhtenbrot’s Theorem in Coq;Automated Reasoning;2020
4. Finite sets in homotopy type theory;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs;2018-01-08
5. Finite sets in homotopy type theory;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018;2018