in 1974, statman received his ph.d. from stanford university for his ph.d dissertation, supervised by georg kreisel, entitled "structural complexity of proofs". his achievements include the proof that type inhabitation problem in simply typed lambda calculus is pspace-complete.