The usual focus of recursion-theoretic inductive inference is to infer a program (resp.
grammar) for a function f (resp. language A) from observations and/or queries about f (resp.
A). We propose a new line of research which examines the question of inferring the answers
to querzes. For a given class of recursive funct, ions, we consider t, he learning (in the limit)
of propwtzes of these funct, ions that can be captured by queries formulated in a logical lan-
guage L. We st, udy t, he inference types that arise in this context, and we present�…

One focus of inductive inference is to infer a program for a function f from observations or
queries about f. We propose a new line of research which examines the question of inferring
the answers to queries. For a given class of computable functions, we consider the learning
(in the limit) of properties of these functions that can be captured by queries formulated in a
logical language L. We study the inference types that arise in this context. Of particular
interest is a comparison between the learning of properties and the learning of programs�…