Finitely-Verifiable Classes of Sentences

Logical Formalizations of Commonsense Reasoning

Volume

Papers from the 2007 AAAI Spring Symposium

Contents

This paper proposes a notion of finitely-verifiable classes of sentences. Informally, a class of sentences is finitely-verifiable if whether a sentence in this class is a theorem of a given theory can be checked with respect to a finite set of models of the theory. The usefulness of this notion is illustrated using examples from arithmetics, first-order logic, game theory, and planning.