A model of inductive inquiry is defined within the context of first‐order logic. The model conceives of inquiry as a game between Nature and a scientist. To begin the game, a nonlogical vocabulary is agreed upon by the two players, along with a partition of a class of countable structures for that vocabulary. Next, Nature secretly chooses one structure from some cell of the partition. She then presents the scientist with a sequence of facts about the chosen structure. With each (...) new datum the scientist announces a guess about the cell to which the chosen structure belongs. To succeed in his or her inquiry, the scientist’s successive conjectures must be correct all but finitely often, that is, the conjectures must converge in the limit to the correct cell. Different kinds of scientists can be investigated within this framework. At opposite ends of the spectrum are dumb scientists that rely on the strategy of “induction by enumeration,” and smart scientists that rely on an operator of belief revision. We report some results about the scope and limits of these two inductive strategies. (shrink)