*To*: Tobias Nipkow <nipkow at in.tum.de>*Subject*: Re: [isabelle] ?spam? Re: Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]*From*: Christoph LANGE <c.lange at cs.bham.ac.uk>*Date*: Thu, 22 Nov 2012 16:15:14 +0000*Cc*: cl-isabelle-users at lists.cam.ac.uk*In-reply-to*: <50AE374C.9070402@in.tum.de>*Organization*: University of Birmingham*References*: <50916DB3.4030707@cs.bham.ac.uk> <B342CF2B-EEC3-4932-A98D-193702F57A14@cam.ac.uk> <5091CE53.6020006@cs.bham.ac.uk> <C76381F2-5127-48DF-B198-DE2B3AABEAB1@cam.ac.uk> <50AE3314.8060002@cs.bham.ac.uk> <50AE374C.9070402@in.tum.de>*User-agent*: Mozilla/5.0 (X11; Linux x86_64; rv:16.0) Gecko/20121029 Thunderbird/16.0.1

2012-11-22 14:31 Tobias Nipkow:

fixes ... and i assumes "p x" shows "q x"Unless you want to give the type of i, you don't need to fix it.

"If you look at the documentation page http://isabelle.in.tum.de/documentation.html you will find that the first document is the relatively new Programming and Proving in Isabelle/HOL, which does cover structured proofs (which is why I wrote it). The Tutorial is now only second choice because of the foucus on "apply"."

That is also where you find the induction method.

Is there a single, up to date reference manual that documents all proof methods?Yes, the reference manual (more or less).

OK, thanks, I see.

Indeed, for inductions, the most convenient way is stating them as implications (with ==>). The manuals above will also tell you about the naming conventions of assumptions in each case.

OK, I'll add this to my to-do list. Cheers, Christoph -- Christoph Lange, School of Computer Science, University of Birmingham http://cs.bham.ac.uk/~langec/, Skype duke4701 → Enabling Domain Experts to use Formalised Reasoning @ AISB 2013 2–5 April 2013, Exeter, UK. Deadlines 10 Dec (stage 1), 14 Jan (st. 2) http://cs.bham.ac.uk/research/projects/formare/events/aisb2013/

**Follow-Ups**:

**References**:**[isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Christoph LANGE

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Lawrence Paulson

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Christoph LANGE

**Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]***From:*Tobias Nipkow

- Previous by Date: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Next by Date: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Previous by Thread: Re: [isabelle] Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Next by Thread: Re: [isabelle] ?spam? Re: Simpler theorem statements, and proofs for them [Re: Started auction theory toolbox; announcement, next steps, and questions]
- Cl-isabelle-users November 2012 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list