I think you and I read different articles . It seems so . I think I ' ll leave it at that . If we disregard the article I do think that whatever we move on to next will subsume it in the sense that all the theorems of ZFC will become theorems of the new system , specifically theorems of the form ZFC proves XYZ which is exactly what I said in my original comment . That ' s not really an interesting notion of subsumption for anyone but formalists , is it ? Almost all logics can deeply embed any other logic defined by finite syntax and standard derivation trees . PA would then subsume ZFC . <| sep |> Jeans and khakis mostly . Maybe look in to those fleece lined khakis for the really bad days ? <| sep |> You should try a book called Computer Systems a Programmers Perspective . If it was designed as an introduction to C but with a focus on s o f t w a r e h a r d w arecompilerstoolchainsetc . Very practical and used for a lot of introductory C courses . You might accidentally pirate it by googling the title as well .