| http://www.w3.org/ns/prov#value | - To be precise, G??del showed that given any system of axioms that are powerful enough to express integer arithmetic, there will be statements that cannot be proven either true or false (unless the system is inconsistent, i.e. there is a statement that can be proven both true and false).
|
