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
Sitemap
To content Read more about how we use cookies on gu.se

Contact form








 


Note! If you want an answer on a question you must specify your email address




Truth and feasible reducibility

Working paper
Authors Ali Enayat
Mateusz Łełyk
Bartosz Wcisło
Publication year 2019
Published at Department of Philosophy, Linguistics and Theory of Science
Language en
Links de.arxiv.org/pdf/1902.00392.pdf
Keywords Axiomatic truth, feasible reduction, conservativity, speed-up
Subject categories Logic, Algebra and Logic

Abstract

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
Share:

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?