A unary representation result for system \(T\)
From MaRDI portal
Publication:1817075
DOI10.1007/BF02127804zbMath0860.68044OpenAlexW2074640713MaRDI QIDQ1817075
Publication date: 1 December 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02127804
Related Items
Decidability results for primitive recursive algorithms ⋮ Unnamed Item ⋮ On the asymptotic behaviour of primitive recursive algorithms
Cites Work
- On list primitive recursion and the complexity of computing inf
- LCF considered as a programming language
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- The Expressiveness of Simple and Second-Order Type Structures
- Intensional interpretations of functionals of finite type I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A unary representation result for system \(T\)