scientific article; zbMATH DE number 1984520
From MaRDI portal
Publication:4428885
zbMath1031.03020MaRDI QIDQ4428885
Publication date: 22 September 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Undecidability and degrees of sets of sentences (03D35) Word problems, etc. in computability and recursion theory (03D40) Combinatory logic and lambda calculus (03B40) Thue and Post systems, etc. (03D03)
Related Items (9)
Full abstraction for the second order subset of an Algol-like language ⋮ Full abstraction for the second order subset of an ALGOL-like language ⋮ An alternate proof of Statman's finite completeness theorem ⋮ Asymptotic densities in logic and type theory ⋮ The variable containment problem ⋮ Decidability of all minimal models ⋮ On the membership problem for non-linear abstract categorial grammars ⋮ Recognizability in the Simply Typed Lambda-Calculus ⋮ The IO and OI hierarchies revisited
This page was built for publication:
