A simple proof of a theorem of Statman
type: Item
instance of: scholarly article
title: A simple proof of a theorem of Statman
zbMATH Open document ID: 0762.03007
DOI: 10.1016/0304-3975(92)90020-G
author: Harry G. Mairson
published in: Theoretical Computer Science
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 94466
zbMATH Keywords: \(\beta\eta\)-equality of first-order typeable \(\lambda\)-terms
MaRDI profile type: Publication
cites work: The complexity of theorem-proving procedures
cites work: Q4198056
cites work: A theory of prepositional types
cites work: Q4722037
cites work: Q4133967
cites work: The typed lambda-calculus is not elementary recursive
cites work: Completeness, invariance and λ-definability
cites work: The polynomial-time hierarchy
full work available at URL: 0304-3975(92)90020-g
OpenAlex ID: W2016065322
description: scientific article; zbMATH DE number 94466