A unary representation result for system T

DOI10.1007/BF02127804MaRDI QIDQ1817075zbMATH OpenOpenAlexFDO

Authors Loïc Colson

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

zbMATH Keywords

Gödel system

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1531380
• A geometry of interaction machine for Gödel's system T
• About primitive recursive algorithms
• scientific article; zbMATH DE number 3993543
• Complexity of Gödel’s T in λ-Formulation

Cites work

• scientific article; zbMATH DE number 3910392 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 55171 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Intensional interpretations of functionals of finite type I
• LCF considered as a programming language
• On list primitive recursion and the complexity of computing inf
• The Expressiveness of Simple and Second-Order Type Structures
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

Cited in

(6)

• Decidability results for primitive recursive algorithms
• A geometry of interaction machine for Gödel's system T
• How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
• scientific article; zbMATH DE number 1531380 (Why is no real title available?)
• On the asymptotic behaviour of primitive recursive algorithms
• Algorithmically expressive, always-terminating model for reversible computation

This page was built for publication: A unary representation result for system \(T\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817075)