A \(\lambda\)-unifiability test for set theory (Q751644): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:24, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(\lambda\)-unifiability test for set theory |
scientific article |
Statements
A \(\lambda\)-unifiability test for set theory (English)
0 references
1988
0 references
lambda-contraction
0 references
semi-decision algorithm for the unifiability of two set-theoretic formulas modulo \(\lambda \) -reduction
0 references
Ada-like pseudocode
0 references
\(\lambda \) -unification
0 references
