Motivated by many practical applications, in this paper we study budget feasible mechanisms with the goal of procuring an independent set of a matroid. More specifically, we are given a matroid $${\mathcal {M}}=(E,{\mathcal {I}})$$M = ( E , I ) . Each element of the ground set E is controlled by a selfish agent and the cost of the element is private information of the agent itself. A budget limited buyer has additive valuations over the elements of E. The goal is to design an incentive compatible budget feasible mechanism which procures an independent set of the matroid of largest possible value. We also consider the more general case of the pair $${\mathcal {M}}=(E,{\mathcal {I}})$$M = ( E , I ) satisfying only the hereditary property. This includes matroids as well as matroid intersection. We show that, given a polynomial time deterministic algorithm that returns an $$\alpha $$α -approximation to the problem of finding a maximum-value independent set in $${\mathcal {M}}$$M , there exists an individually rational, truthful and budget feasible mechanism which is $$(3\alpha +1)$$( 3 α + 1 ) -approximated and runs in polynomial time, thus yielding also a 4-approximation for the special case of matroids.