Assertion: order predicate logic | /r/HasProperty | consistent
Facets:
Source sentences:
text: As an example, Kurt Gödel's incompleteness theorems show that sufficiently complex formal systems of arithmetic cannot be consistent and complete; however, first-order predicate logics not extended by specific axioms to be arithmetic formal systems with equality can be complete and consistent.