机读格式显示(MARC)

• 000 01444cam 2200361 a 4500

• 001 0000590962

• 003 CAL

• 005 20061116073200.0

• 007 cr un---------

• 008 061116s2001 gw a b 101 0 eng

• 010 __ |a 2001049476

• 020 __ |a 354042525X (pbk. : alk. paper)

• 040 __ |a DLC |c DLC |d C$Q |d SCT

• 042 __ |a pcc

• 050 00 |a QA76.9.A96 |b T655 2001

• 082 00 |a 004/.01/51 |2 21

• 090 __ |a TP18-532/T396

• 093 __ |a TP18-532 |2 4

• 099 __ |a CAL 022001458537

• 111 2_ |a TPHOLs 2001 |d (2001 : |c Edinburgh, Scotland)

• 245 10 |a Theorem proving in higher order logics : |b 14th international conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001 : proceedings / |c Richard J. Boulton, Paul B. Jackson (eds.).

• 246 30 |a TPHOLs 2001

• 260 __ |a Berlin ; |a New York : |b Springer, |c c2001.

• 300 __ |a x, 393 p. : |b ill. ; |c 24 cm.

• 440 _0 |a Lecture notes in computer science, |x 0302-9743 ; |v 2152

• 504 __ |a Includes bibliographical references and index.

• 530 __ |a Available also through SpringerLink via the World Wide Web. Adobe Acrobat Reader required.

• 650 _0 |a Automatic theorem proving |v Congresses.

• 700 1_ |a Boulton, Richard J., |d 1967-

• 700 1_ |a Jackson, Paul B., |d 1962-

• 710 2_ |a LINK (Online service)

• 856 41 |u http://springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=2152&issue=preprint |z Springer LINK version

• 950 __ |a JHUL |b TP18-532 |c T396