scientific article; zbMATH DE number 3328152
From MaRDI portal
Publication:5606582
zbMath0206.28202MaRDI QIDQ5606582
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Gentzen's consistency proof without heightlines, Combinatory logic with polymorphic types, Size-based termination of higher-order rewriting, Combinatory weak reduction in lambda calculus, Normalization proof for Peano arithmetic, How to assign ordinal numbers to combinatory terms with polymorphic types, Well-Partial Orderings and their Maximal Order Types, The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II., Unnamed Item, Unnamed Item, LCF considered as a programming language, Normalization by Evaluation for Typed Weak lambda-Reduction, The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type, Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\), Gödel and Intuitionism, A Glimpse of $$ \sum_{3} $$-elementarity