Syntactic translations and provably recursive functions (Q3722497): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The consistency of classical set theory relative to a set theory with intu1tionistic logic / rank | |||
Normal rank |
Latest revision as of 14:23, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Syntactic translations and provably recursive functions |
scientific article |
Statements
Syntactic translations and provably recursive functions (English)
0 references
1985
0 references
conservation results for classical theories over the corresponding
0 references
intuitionistic theories
0 references
double-negation translation
0 references
minimal logic
0 references
intuitionistic full arithmetic
0 references
Peano Arithmetic
0 references
functionals of higher type
0 references
classical ZF
0 references
intuitionistic ZF
0 references
intuitionistic provability
0 references
conservation results for classical theories over the corresponding intuitionistic theories
0 references