Abstract
Game-theoretical semantics of the Hintikka type might be seen as offering a new paradigm for truth-conditional semantics, that is, for defining the concept of truth-in-a-model. The familiar Tarskian approach is to proceed "inside out' by first defining truth-in-a-model for the atomic sentences of a language and then extending the definition to the language as a whole by adding a number of recursive clauses. In the case of formal languages like those of predicate logic the number of recursive clauses will coincide with the number of logical constants; but for more comprehensive languages there may also be recursive clauses of certain non-logical expressions. In general the truth conditions of a complex sentence will always be defined recursively on the basis of the truth conditions of its atomic subformulas.