A formal quantier elimination for algebraically closed elds
暂无分享,去创建一个
[1] H. Cartan,et al. Schémas normaux ; morphismes ; ensembles constructibles , 1956 .
[2] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .
[3] Herman Geuvers,et al. A Constructive Algebraic Hierarchy in Coq , 2002, J. Symb. Comput..
[4] Stefano Berardi,et al. Krivine's intuitionistic proof of classical completeness (for countable languages) , 2004, Ann. Pure Appl. Log..
[5] R.S.S. O'Connor,et al. Incompleteness & completeness : formalizing logic and analysis in type theory , 2005 .
[6] S. Basu,et al. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .
[7] Ioana Pasca,et al. Canonical Big Operators , 2008, TPHOLs.
[8] Bruno Barras,et al. Sets in Coq, Coq in Sets , 2010, J. Formaliz. Reason..
[9] Yves Bertot,et al. Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .