<!-- Please do not remove or change this AfD message until the discussion has been closed. -->
{{R from merge}}
{{Article for deletion/dated|page=Subclass reachability|timestamp=20211125003159|year=2021|month=November|day=25|substed=yes|help=off}}
<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Subclass reachability|date=25 November 2021|result='''keep'''}} -->
<!-- End of AfD message, feel free to edit beyond this point -->
{{Multiple issues|
{{unreferenced|date=January 2009}}
{{orphan|date=November 2011}}
{{context|date=February 2011}}
}}
In [[computational learning theory]] in [[mathematics]], given a [[Concept class|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).
