There have been several different and even opposed conceptions of the problem of logical constants, i.e., of the requirements that a good theory of logical constants ought to satisfy. This paper is in the first place a survey of these conceptions and a critique of the theories they have given rise to. A second aim of the paper is to sketch some ideas about what a good theory would look like. A. Third aim is to draw from these ideas and from the preceding survey the conclusion that most conceptions of the problem of logical constants involve requirements of a philosophically demanding nature which are probably not satisfiable by any minimally adequate theory.

In 1941, Tarski published an abstract, finitely axiomatized version of the theory of binary relations, called the theory of relation algebras, He asked whether every model of his abstract theory could be represented as a concrete algebra of binary relations. He and Jonsson obtained some initial, positive results for special classes of abstract relation algebras. But Lyndon showed, in 1950, that in general the answer to Tarski's question is negative. Monk proved later that the answer remains negative even if one adjoins finitely many new axioms to Tarski's system. In this paper we describe a far-reaching generalization of the positive results of Jonsson and Tarski, as well as of some later, related results of Maddux. We construct a class of concrete models of Tarski's axioms-called coset relation algebras-that are very close in spirit to algebras of binary relations, but are built using systems of groups and cosets instead of elements of a base set. The models include all algebras of binary relations, and many non-representable relation algebras as well, We prove that every atomic relation algebra satisfying a certain measurability condition-a condition generalizing the conditions imposed by Jonsson and Tarski-is essentially isomorphic to a coset relation algebra. The theorem raises the possibility of providing a positive solution to Tarski's problem by using coset relation algebras instead of the standard algebras of binary relations.

We consider fixed point logics, i.e., extensions of first order predicate logic with operators defining fixed points. A number of such operators, generalizing inductive definitions, have been studied in the context of finite model theory, including nondeterministic and alternating operators. We review results established in finite model theory, and also consider the expressive power of the resulting logics on infinite structures. In particular, we establish the relationship between inflationary and nondeterministic fixed point logics and second order logic, and we consider questions related to the determinacy of games associated with alternating fixed points