
The problem of the existence of a unifying substitution between two terms is considered in type theory. This problem is shown to be undecidable, even if we restrict the objects of the language to third order. This means that we are not able to recognize whether two terms have a common instance or not. This result has important implications for the mechanization of higher order logic.
Decidability of theories and sets of sentences, Higher-order logic; type theory, Engineering(all), Theorem proving (deduction, resolution, etc.)
Decidability of theories and sets of sentences, Higher-order logic; type theory, Engineering(all), Theorem proving (deduction, resolution, etc.)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 83 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
