{"version":"1.0","type":"link","title":"Consistency proof - Newikis","description":"In mathematics, a theory is called consistent, if does not contain any contradictions. In the context of predicate logic it is impossible to deduce both as well as from","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}