Subclass reachability
From Infogalactic: the planetary knowledge core
Lua error in package.lua at line 80: module 'strict' not found.
In computational learning theory in mathematics, given a class of concepts C, a subclass D is reachable if there exists a partial approximation S of some concept such that D contains exactly those concepts in C that are extensions to S (i.e., D=C|S).
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
