Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM
| Authors |
Ali Enayat Mateusz Łełyk Bartosz Wcisło |
|---|---|
| Published in | Journal of Symbolic Logic |
| ISSN | 0022-4812 |
| Publication year | 2019 |
| Published at |
Department of Philosophy, Linguistics and Theory of Science |
| Language | en |
| Links |
https://doi.org/10.1017/jsl.2019.24 |
| Keywords | Axiomatic truth, feasible reduction, conservativity, speed-up |
| Subject categories | Algebra and Logic, Logic |
We show that certain theories of truth over Peano arithmetic are feasibly reducible (in the sense described in the paper) to Peano arithmetic.
© UNIVERSITY OF GOTHENBURG • Sweden • Box 100 • SE-405 30 Gothenburg
Phone: +46 31 786 0000 • Contact • Organisation number: 202100-3153
About the website
Facebook
Twitter
Instagram
Youtube
Weibo