Syntactic translations and provably recursive functions (Q3722497)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3952750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Syntactic translations and provably recursive functions |
scientific article; zbMATH DE number 3952750 |
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
0.89409125
0 references
0.8706418
0 references
0 references
0.86252946
0 references
0.86010873
0 references
0.8599958
0 references
0.8599958
0 references
