How to formally and efficiently prove Prime(1999)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Symbolic Computation and Automated Reasoning: The Calculemus-2000 Symposium
Editors	M. Kerber, M. Kohlhase
Place of Publication	St. Andrews
Publisher	A.K. Peters
Pages	114-125
ISBN (Print)	1-56881-145-4
Publication status	Published - 2000
Event	conference; Calculemus 2000 - Duration: 1 Jan 2000 → …

Cite this

@inproceedings{a91021f2af2849558dd52c57f138bf4c,

title = "How to formally and efficiently prove Prime(1999)",

author = "O. Caprotti and M.D. Oostdijk",

year = "2000",

language = "English",

isbn = "1-56881-145-4",

pages = "114--125",

editor = "M. Kerber and M. Kohlhase",

booktitle = "Symbolic Computation and Automated Reasoning: The Calculemus-2000 Symposium",

publisher = "A.K. Peters",

address = "United States",

note = "conference; Calculemus 2000 ; Conference date: 01-01-2000",

}

TY - GEN

T1 - How to formally and efficiently prove Prime(1999)

AU - Caprotti, O.

AU - Oostdijk, M.D.

PY - 2000

Y1 - 2000

M3 - Conference contribution

SN - 1-56881-145-4

SP - 114

EP - 125

BT - Symbolic Computation and Automated Reasoning: The Calculemus-2000 Symposium

A2 - Kerber, M.

A2 - Kohlhase, M.

PB - A.K. Peters

CY - St. Andrews

T2 - conference; Calculemus 2000

Y2 - 1 January 2000

ER -