Volume 232,
Numbers 1-2,
6 February 2000
- Didier Galmiche, David J. Pym:
Proof-search in type-theoretic languages: an introduction.
5-53
Electronic Edition (link) BibTeX
- James L. Caldwell, Ian P. Gent, Judith L. Underwood:
Search algorithms in type theory.
55-90
Electronic Edition (link) BibTeX
- Raymond McDowell, Dale Miller:
Cut-elimination for a logic with definitions and induction.
91-119
Electronic Edition (link) BibTeX
- Toshiyasu Arai, Grigori Mints:
Extended normal form theorems for logical proofs from axioms.
121-132
Electronic Edition (link) BibTeX
- Iliano Cervesato, Joshua S. Hodas, Frank Pfenning:
Efficient resource management for linear logic proof search.
133-163
Electronic Edition (link) BibTeX
- Martin W. Bunder:
Proof finding algorithms for implicational logics.
165-186
Electronic Edition (link) BibTeX
- Amy P. Felty:
The calculus of constructions as a framework for proof search with set variable instantiation.
187-229
Electronic Edition (link) BibTeX
- Didier Galmiche:
Connection methods in linear logic and proof nets construction.
231-272
Electronic Edition (link) BibTeX
- Gopalan Nadathur:
Correspondences between classical, intuitionistic and uniform provability.
273-298
Electronic Edition (link) BibTeX
- Eike Ritter, David J. Pym, Lincoln A. Wallen:
On the intuitionistic force of classical search.
299-333
Electronic Edition (link) BibTeX
Copyright © Tue Nov 18 20:47:38 2008
by Michael Ley (ley@uni-trier.de)
