[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

*To*: <pvs-help@csl.sri.com>*Subject*: PVS help needed*From*: "Rob Urlings" <r.g.l.h.urlings@student.tue.nl>*Date*: Mon, 8 Apr 2002 15:56:14 +0200*Sender*: pvs-help-owner@csl.sri.com

Dear Sir,
We are students at the computer science department of
the university of Eindhoven in The Netherlands. Because of a schoolproject we
are trying to prove serveral lemma's in theorem prover PVS. On the internet we
found some published work of in PVS, and therefor we hope you would like to
help us.
We use PVS for the following prove:
Let V be a set, A and B a subset of V,
f:A->B and g:B->A.
If f and g are both surjective then there is a
bijection h:A->B.
Hopefully you could make some recommendations for
us.
yours faithfully,
Rob Urlings and Loek Simons |

- Prev by Date:
**Re: Proofing problem** - Next by Date:
**A question** - Prev by thread:
**Does PVS support temporal logic?** - Next by thread:
**Proofing problem** - Index(es):