English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Farmer's Theorem Revisited

MPS-Authors
/persons/resource/persons45662

Veanes,  Margus
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Veanes, M. (2000). Farmer's Theorem Revisited. Information Processing Letters, 74(1/2), 47-53.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-342F-E
Abstract
The main result is that there is an integer $n$, such that second-order unification is undecidable in all non-monadic second-order term languages with at least $n$ \emph{first-order} variables, and even if the arguments of all second-order variables are ground terms of size bounded by $n$ and the total number of variable occurrences is at most $n$.