Polynomial-time Martin-Löf type theory
type: Item
instance of: scholarly article
title: Polynomial-time Martin-Löf type theory
zbMATH Open document ID: 0787.03053
DOI: 10.1007/BF01269954
author: Joseph L. Pe
published in: Archive for Mathematical Logic
publication date: 1994-05-23T00:00:00Z
Mathematics Subject Classification ID: 03F35
zbMATH DE Number: 438613
zbMATH Keywords: fragments of extensional Martin-Löf type theory without universes
zbMATH Keywords: Feferman's theory APP of operators
MaRDI profile type: Publication
cites work: Q3794177
cites work: Functional interpretations of feasibly constructive arithmetic
cites work: Q3688389
cites work: Constructivism in mathematics. An introduction. Volume II
full work available at URL: https://doi.org/10.1007/bf01269954
OpenAlex ID: W2047438528
Recommended article: Well-ordering proofs for Martin-Löf type theory
Recommended article: Q5438968
Recommended article: Categorical and algebraic aspects of Martin-Löf type theory
Recommended article: From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
Recommended article: Expressing computational complexity in constructive type theory
Recommended article: Foundations of mathematics in polymorphic type theory
Recommended article: The constructive Hilbert program and the limits of Martin-Löf type theory
Recommended article: The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory
Recommended article: Supercompilation for Martin-Lof's type theory
Recommended article: MODELS OF MARTIN-LÖF TYPE THEORY FROM ALGEBRAIC WEAK FACTORISATION SYSTEMS
description: scientific article; zbMATH DE number 438613