Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
One suggestion : the proof assistant Mizar works in a variant of ZFC. And its library of certified proofs is already very huge. You could investigate in this direction. Unlike many people, I don't think that coq is appropriate for formalizing math: because the axiom of choice and the law of excluded middle cannot live together in coq. The situation seems to be different with HoTT, as far as I understand the theory.
I don't understand the last part of your question. What is the translation of your question for the more general setting of a simplicial proper model category ?
What is a presentable category ? And what is a cocontinuous functor ? I don't understand (i). If you mean a colimit-preserving functor between locally presentable categories, indeed it has a right adjoint by the dual of the Special Adjoint Functor theorem (take the opposite categories and apply SAFT). And an accessible limit-preserving functor between locally presentable categories is always a right adjoint indeed. This is explained in the book you mention.
About Computer science: "It is known that quantum computers can solve NP complete problems in polynomial time." A wrong believe is rather that quantum computers can calculate more things than classic computers; which is false. quantum calculability is equivalent to classic calculability.
I did not use commas and periods in my display-mode formulae until an editor one day added periods and commas almost everywhere before publishing the paper. Now I use them... most of the time. :-).
The trick is to use as many Grothendieck universes as you need : $\mathcal{U_1}\subset \mathcal{U_2}\subset \dots$ and to see where your objects are in this hierarchy of universes. If the final object you are interested in belongs to $\mathcal{U}_1$, you win because it is an ordinary set.