Skip to main content
×
Home
    • Aa
    • Aa

NOTES ON BOUNDED INDUCTION FOR THE COMPOSITIONAL TRUTH PREDICATE

  • BARTOSZ WCISŁO (a1) and MATEUSZ ŁEŁYK (a1)
Abstract
Abstract

We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with Δ0-induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano Arithmetic. In addition, we show that a slightly modified theory of truth actually proves the global reflection principle over the base theory.

Copyright
Corresponding author
*INSTITUTE OF PHILOSOPHY UNIVERSITY OF WARSAW WARSAW, POLAND E-mail: b.wcislo@mimuw.edu.pl
INSTITUTE OF PHILOSOPHY UNIVERSITY OF WARSAW WARSAW, POLAND E-mail: mlelyk@student.uw.edu.pl
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

K Fujimoto . (2010). Relative truth definability in axiomatic truth theories. Bulletin of Symbolic Logic, 16, 305344.

H Kotlarski . (1986). Bounded induction and satisfaction classes. Zeitschrift für matematische Logik und Grundlagen der Mathematik, 32, 531544.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 45 *
Loading metrics...

* Views captured on Cambridge Core between 30th March 2017 - 26th April 2017. This data will be updated every 24 hours.