Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms-Reference-Cited by-同舟云学术

Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms

Published:2010-03 Issue:3 Volume:208 Page:230-258
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Gabbay Murdoch J.,Mulligan Dominic P.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference45 articles.

1. Andrea Asperti, Claudo Sacerdoti Coen, Enrico Tassi, Stefano Zacchiroli, in: Crafting a Proof Assistant, Lecture Notes in Computer Science, Springer, 2007, pp. 18–32.

2. The Lambda Calculus: Its Syntax and Nemantics;Barendregt,2007

3. Jan M. Smith Bengt Nordstrom, Kent Petersson, in: Programming in Martin-Löf’s Type Theory, International Series of Monographs on Computer Science, vol. 7, Clarendon Press, Oxford, 1990. Available from: .

4. Mirna Bognar, Contexts in Lambda Calculus, Ph.D. thesis, Vrije Universiteit Amsterdam, 2002.

5. 75 years of independence proofs by Fraenkel–Mostowski permutation models;Brunner;Mathematica Japonica,1996

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantifiers in logic and proof-search using permissive-nominal terms and sets;Journal of Logic and Computation;2013-02-23

2. Corrigendum to “Curry–Howard for incomplete first-order logic derivations using one-and-a-half level terms” [Inform. and Comput. 208 (3) (2010) 230–258];Information and Computation;2012-03

3. Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques;Logic Journal of the IGPL;2010-05-25