| changeset 52457 | c3b4b74a54fd |
| parent 35762 | af3ff2ba4c54 |
| child 58963 | 26bf09b95dda |
--- a/src/FOLP/intprover.ML Wed Jun 26 11:54:45 2013 +0200 +++ b/src/FOLP/intprover.ML Wed Jun 26 18:38:03 2013 +0200 @@ -9,7 +9,7 @@ Completeness (for propositional logic) is proved in Roy Dyckhoff. -Contraction-Free Sequent Calculi for IntPruitionistic Logic. +Contraction-Free Sequent Calculi for Intuitionistic Logic. J. Symbolic Logic (in press) *)