Theoretical Computer ScienceVolume 13, Issue 2, 1981, Pages 225-230NoteThe undecidability of the second-order unification problemAuthor links open overlay panelWarren D. GoldfarbShow moreShareCitehttps://doi.org/10.1016/0304-3975(81)90040-2Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIt is shown that there is no effective procedure for determining whether or not two terms of the language of second-order logic have a common instance.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1981 Published by Elsevier B.V.