Introduction

In naive language, a collection of statements - say in a legal contract - is called consistent if these statements fit together, in the sense that it is not the case that one of them says things contradicted by another one. In logic, therefore, a set of sentences C is called consistent if it is not the case that there is a formula v such that both v and its negation ->v are provable from the sentences in C .