A \(\lambda\)-unifiability test for set theory (Q751644)

From MaRDI portal
Revision as of 08:29, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references