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
Some are, some are not, for system having standard model, that makes
sense. It is the case for arithmetic, and most of computer science.
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To post to this group, send email to firstname.lastname@example.org.
To unsubscribe from this group, send email to
For more options, visit this group at