A \(\lambda\)-unifiability test for set theory (Q751644): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00244943 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1551807233 / rank | |||
Normal rank | |||
Latest revision as of 08:29, 30 July 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
