Publisher
Springer International Publishing
Reference55 articles.
1. Bauer, A.: First steps in synthetic computability theory. Electron. Notes Theor. Comput. Sci. 155, 5–31 (2006). Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI)
2. Berardi, S.: Intuitionistic completeness for first order classical logic. J. Symbolic Logic 64(1), 304–312 (1999)
3. Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed lambda-calculus. In: 1991 Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 203–211. IEEE (1991)
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);JC Blanchette,2014
5. Braselmann, P., Koepke, P.: Gödel’s completeness theorem. Formalized Math. 13(1), 49–53 (2005)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separating Markov's Principles;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A Formalization of Core Why3 in Coq;Proceedings of the ACM on Programming Languages;2024-01-05
3. Material dialogues for first-order logic in constructive type theory: extended version;Mathematical Structures in Computer Science;2023-11-03
4. Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens;Logical Methods in Computer Science;2022-06-14
5. Material Dialogues for First-Order Logic in Constructive Type Theory;Logic, Language, Information, and Computation;2022