A compositional semantics for this logic is described, which gives a compositional meaning to formulas of the ‘information-friendly’ language of Hintikka and Sandu, and proves that two formulas have the same interpretation in all structures.Expand

We give a criterion involving existence of many generic sequences of automorphisms for a countable structure to have the small index property. We use it to show that (i) any a>-stable co-categorical… Expand

A general method for building infinite mathematical structures, and its applications in algebra and model theory are introduced, and a wide variety of algebraic applications are studied.Expand

A theorem is proved stating necessary and sufficient conditions for the existence of a “canonical” compositional semantic extending a given partial semantics, after discussing what features onewould want such an extension to have.Expand

Elementary (first-order) predicate logic is a child of many parents. At least three different groups of thinkers played their part in its conception, with three quite distinct motives. Maybe the… Expand

There is no compositional semantics for the ‘independence-friendly’ logic of Hintikka and Sandu (henceforth IF) in which the interpretation in a structure A of each 1 -ary formula is a subset of the domain of A.Expand