Realizability interpretation of generalized inductive definitions
type: Item
instance of: scholarly article
title: Realizability interpretation of generalized inductive definitions
zbMATH Open document ID: 0801.03022
DOI: 10.1016/0304-3975(94)90092-2
author: Satoshi Kobayashi
author: Makoto Tatsuta
published in: Theoretical Computer Science
publication date: 1994-12-05T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 626274
zbMATH Keywords: proof-as-program
zbMATH Keywords: q-realizability interpretation of generalized inductive definitions
describes a project that uses: Nuprl
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90092-2
OpenAlex ID: W2051829567
cites work: Q3679172
cites work: Q3757915
cites work: Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
cites work: Q4128540
cites work: Q3882452
cites work: Constructive mathematics and computer programming
cites work: Q3999860
cites work: Program synthesis using realizability
cites work: Constructivism in mathematics. An introduction. Volume I
Wikidata QID: Q127957012
description: scientific article; zbMATH DE number 626274