Elementary realizability
type: Item
instance of: scholarly article
title: Elementary realizability
zbMATH Open document ID: 0874.03067
DOI: 10.1023/A:1017994504149
author: Zlatan Damnjanovic
published in: Journal of Philosophical Logic
publication date: 1997-11-05T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03F65
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 1044155
zbMATH Keywords: elementary realizability
zbMATH Keywords: Kalmar elementary functions
zbMATH Keywords: fragment of Heyting Arithmetic
zbMATH Keywords: provably recursive functions
zbMATH Keywords: strict arithmetic constructivism
MaRDI profile type: Publication
cites work: Q4052072
cites work: A Hierarchy of Primitive Recursive Functions
cites work: Q5586401
cites work: Q4035305
cites work: Q3893911
cites work: Elementary functions and loop programs
cites work: Strictly primitive recursive realizability, I
cites work: Minimal readability of intuitionistic arithmetic and elementary analysis
cites work: The bounded arithmetic hierarchy
cites work: Q5812175
cites work: Q4153600
cites work: Existence and feasibility in arithmetic
cites work: Hierarchies of Primitive Recursive Functions
cites work: Classes of Predictably Computable Functions
cites work: Q3325707
cites work: ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
cites work: Q5613940
cites work: Theory of Formal Systems. (AM-47)
cites work: Constructivism in mathematics. An introduction. Volume II
cites work: The intended interpretation of intuitionistic logic
full work available at URL: a:1017994504149
OpenAlex ID: W4238150421
description: scientific article; zbMATH DE number 1044155