A \(\lambda\)-unifiability test for set theory (Q751644)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A -unifiability test for set theory |
scientific article; zbMATH DE number 4177033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(\lambda\)-unifiability test for set theory |
scientific article; zbMATH DE number 4177033 |
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
