A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, it is shown that the similarity between learning in higher-order logic and traditional attributevalue learning allows many results from computational learning theory to be 'ported' to the logical setting with ease. As a direct consequence, a number of non-trivial results in the higher-order setting can be establisheddoi:10.1007/11871842_71 fatcat:b2yaqxw2zbdtffe7prqperente