On 17 Dec 2012, at 22:02, meekerdb wrote:
I would think it was incompleteness. Consistency means not being able to prove every proposition. But in a consistent system there can be propositions that are neither provable nor disprovable. Are those true?
Some are, some are not, for system having standard model, that makes sense. It is the case for arithmetic, and most of computer science.
Bruno http://iridia.ulb.ac.be/~marchal/ -- You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to everything-list@googlegroups.com. To unsubscribe from this group, send email to everything-list+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/everything-list?hl=en.
