To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Truth and feasible reduci… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Truth and feasible reducibility

Journal article
Authors Ali Enayat
Mateusz Łełyk
Bartosz Wcisło
Published in Journal of Symbolic Logic
Volume 85
Issue 1
Pages 367-421
ISSN 0022-4812
Publication year 2020
Published at Department of Philosophy, Linguistics and Theory of Science
Pages 367-421
Language en
Keywords Axiomatic truth, feasible reduction, conservativity, speed-up
Subject categories Logic, Algebra and Logic


We show that certain theories of truth over Peano arithmetic are feasibly reducible (in the sense described in the paper) to Peano arithmetic.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?