Formalized Proof, Computation, and the Construction Problem in Algebraic Geometry

@inproceedings{Werner2005FormalizedPC,
  title={Formalized Proof, Computation, and the Construction Problem in Algebraic Geometry},
  author={Benjamin Werner and M. S. Narasimhan and A. Magid},
  year={2005}
}
It has become a classical technique to turn to theoretical computer science to provide computational tools for algebraic geometry. A more recent transformation is that now we also get logical tools, and these too should be useful in the study of algebraic varieties. The purpose of this note is to consider a very small part of this picture, and try to motivate the study of computer theorem-proving techniques by looking at how they might be relevant to a particular class of problems in algebraic… CONTINUE READING

From This Paper

Topics from this paper.
3 Citations
114 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 114 references

Braid group technique in complex geometry

  • B. Moishezon, M. Teicher
  • I. Line arrangements in CP2. Braids (Santa Cruz…
  • 1988
Highly Influential
4 Excerpts

IO and Coq

  • S. Karrmann
  • Message on the coq-club mailing list, Aug. 30
  • 2004
1 Excerpt

The geometry of profinite graphs with applications to free groups and finite monoids Trans

  • K. Auinger, B. Steinberg
  • Amer. Math. Soc. 356
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…