An alternate proof of Statman's finite completeness theorem (Q436624): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Completeness in the theory of types / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4428885 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizability in the Simply Typed Lambda-Calculus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the membership problem for non-linear abstract categorial grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Completeness, invariance and <i>λ</i>-definability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Clausal Theory of Types / rank | |||
Normal rank |
Latest revision as of 12:37, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An alternate proof of Statman's finite completeness theorem |
scientific article |
Statements
An alternate proof of Statman's finite completeness theorem (English)
0 references
25 July 2012
0 references
simply typed lambda calculus
0 references
formal semantics
0 references
theory of computation
0 references