Bartosz Wcisło

activity

20172021

most citedNotes on bounded induction for the compositional truth predicate

35 citations · 41 across the 5 of their papers we have counts for

collaborators

9 papers

math.LO2021

The two halves of disjunctive correctness

Cezary Cieśliński, Mateusz Łełyk, Bartosz Wcisło

Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for the compositional truth predicate are conservative over Peano Arithmetic. In this article, we show that…

math.LO2021

Full satisfaction classes, definability, and automorphisms

Bartosz Wcisło

We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$ , there exists a full satisfaction class $S_{A} \subset M^{2}$ such…

math.LO2020

Compositional truth with propositional tautologies and quantifier-free correctness

Bartosz Wcisło

Cieśliński asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partia…

math.LO2020

Local collection scheme and end-extensions of models of compositional truth

Mateusz Łełyk, Bartosz Wcisło

We introduce a principle of local collection for compositional truth predicates and show that it is conservative over the classically compositional theory of truth in the arithmeti…

math.LO2019

Truth and Feasible Reducibility

Ali Enayat, Mateusz Łełyk, Bartosz Wcisło

Let $T$ be any of the three canonical truth theories $CT^{-}$ (Compositional truth without extra induction), $FS^{-}$ (Friedman--Sheard truth without extra…

math.LO2018

Disjunctions with stopping condition

Roman Kossak, Bartosz Wcisło

We introduce a tool for analysing models of $CT^{-}$ , the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan's theorem that arithmetical…