I found an algorithm book which tries to define asymptotic notations as sets and then used notations like $n=O(n^2)$. Is there a mathematically correct way to define asymptotic notations like $O(n), \Omega(n), \Theta(n), o(n)$ and $\omega(n)$? And is there an algorithm books that uses notations correctly?
I found something about http://www.artofproblemsolving.com/Forum/viewtopic.php?f=296&t=31517&start=20 but the problem is that I don't know rigorous definitions of class and set and difference of those so I can't say if it is a correct approach to formalize the $O$ notation.