A constructive proof of the fundamental theorem of algebra without using the rationals

J.H. Geuvers, F. Wiedijk, J. Zwanenburg

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

Original language	English
Title of host publication	Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers)
Editors	P. Callaghan, Z. Luo, J. McKinna, R. Pollack
Publisher	Springer
Pages	96-111
ISBN (Print)	3-540-43287-6
Publication status	Published - 2002

Name	Lecture Notes in Computer Science
Volume	2277
ISSN (Print)	0302-9743

Cite this

Geuvers, J. H., Wiedijk, F., & Zwanenburg, J. (2002). A constructive proof of the fundamental theorem of algebra without using the rationals. In P. Callaghan, Z. Luo, J. McKinna, & R. Pollack (Eds.), Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers) (pp. 96-111). (Lecture Notes in Computer Science; Vol. 2277). Springer.

Geuvers, J.H. ; Wiedijk, F. ; Zwanenburg, J. / A constructive proof of the fundamental theorem of algebra without using the rationals. Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers). editor / P. Callaghan ; Z. Luo ; J. McKinna ; R. Pollack. Springer, 2002. pp. 96-111 (Lecture Notes in Computer Science).

@inproceedings{928672ecaee84284be4653f0343ee5c4,

title = "A constructive proof of the fundamental theorem of algebra without using the rationals",

author = "J.H. Geuvers and F. Wiedijk and J. Zwanenburg",

year = "2002",

language = "English",

isbn = "3-540-43287-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "96--111",

editor = "P. Callaghan and Z. Luo and J. McKinna and R. Pollack",

booktitle = "Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers)",

}

Geuvers, JH, Wiedijk, F & Zwanenburg, J 2002, A constructive proof of the fundamental theorem of algebra without using the rationals. in P Callaghan, Z Luo, J McKinna & R Pollack (eds), Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers). Lecture Notes in Computer Science, vol. 2277, Springer, pp. 96-111.

A constructive proof of the fundamental theorem of algebra without using the rationals. / Geuvers, J.H.; Wiedijk, F.; Zwanenburg, J.
Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers). ed. / P. Callaghan; Z. Luo; J. McKinna; R. Pollack. Springer, 2002. p. 96-111 (Lecture Notes in Computer Science; Vol. 2277).

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

TY - GEN

T1 - A constructive proof of the fundamental theorem of algebra without using the rationals

AU - Geuvers, J.H.

AU - Wiedijk, F.

AU - Zwanenburg, J.

PY - 2002

Y1 - 2002

M3 - Conference contribution

SN - 3-540-43287-6

T3 - Lecture Notes in Computer Science

SP - 96

EP - 111

BT - Types for Proofs and Programs (International Workshop, TYPES 2000, Durham, UK, December 8-12, 2000, Selected Papers)

A2 - Callaghan, P.

A2 - Luo, Z.

A2 - McKinna, J.

A2 - Pollack, R.

PB - Springer

ER -