Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Veldman, W.: An intuitionistic completeness theorem for intuitionistic predicate logic. J. Symb. Log. 41(1), 159–166 (1976)
2. Studies in Logic and the Foundations of Mathematics;A.S. Troelstra,1988
3. Lecture Notes in Computer Science;C. Coquand,1994
4. Lecture Notes in Computer Science;U. Berger,1998
5. Okada, M.: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci. 281(1-2), 471–498 (2002)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Material dialogues for first-order logic in constructive type theory: extended version;Mathematical Structures in Computer Science;2023-11-03
2. Formalizing and Computing Propositional Quantifiers;Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs;2023-01-11
3. Semantic cut elimination for the logic of bunched implications, formalized in Coq;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11
4. Completeness theorems for first-order logic analysed in constructive type theory;Journal of Logic and Computation;2021-01
5. A Henkin-Style Completeness Proof for the Modal Logic S5;Lecture Notes in Computer Science;2021