Journal
STUDIA LOGICA
Volume 106, Issue 6, Pages 1181-1196Publisher
SPRINGER
DOI: 10.1007/s11225-017-9782-4
Keywords
Provability logic; Sacchetti's logics; Arithmetical completeness theorem; Formalized arithmetic; Numerations
Categories
Funding
- JSPS KAKENHI [16K17653]
- Grants-in-Aid for Scientific Research [17H02263, 16K17653] Funding Source: KAKEN
Ask authors/readers for more resources
We prove that for each recursively axiomatized consistent extension T of Peano Arithmetic and This settles Sacchetti's problem affirmatively.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
