The basis decision problem in λ-calculus
✍ Scribed by Benedetto Intrigila
- Publisher
- John Wiley and Sons
- Year
- 1993
- Tongue
- English
- Weight
- 135 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We show that the problem of deciding if a finite set of closed terms in normal form is a basis is recursively unsolvable. The restricted problem concerning one element sets is still recursively unsolvable. MSC: 03B40, 03D35.
📜 SIMILAR VOLUMES
Generic linkage is used to compute a prime ideal such that the radical of the initial ideal of the prime ideal is equal to the radical of a given codimension two monomial ideal that has Cohen-Macaulay quotient ring.
The book by Bolza, in fact, became so popular that the fixed-endpoint problem we stated became known as the article no. 0162
## Communicated by G. F. Roach A numerical technique for determining the solution of the brachistochrone problem is presented. The brachistochrone problem is first formulated as a non-linear optimal control problem. Using Chebyshev nodes, we construct the Mth degree polynomial interpolation to ap
It is shown that simple orthogonality constraints between some set of known approximate eigenfunctions and another set of functions which are to be determined as approximate eigensolutions need to be modified. The proposed modification introduces a measure of the approximate character of the known f