论文信息 - Proof-finding Algorithms for Classical and Subclassical Propositional Logics - 字舞流文

Proof-finding Algorithms for Classical and Subclassical Propositional Logics

Martin W. Bunder | R. M. Rizkalla

[1] Dov M. Gabbay,et al. Extending the Curry-Howard interpretation to linear, relevant and other resource logics , 1992, Journal of Symbolic Logic.

[2] Martin W. Bunder,et al. Lambda Terms Definable as Combinators , 1996, Theor. Comput. Sci..

[3] K. R. Popper,et al. I.—NEW FOUNDATIONS FOR LOGIC , 1947 .

[4] Martin W. Bunder. Proof finding algorithms for implicational logics , 2000, Theor. Comput. Sci..