35 citations · 55 across the 12 of their papers we have counts for
14 papers
A model with fragments of projective determinacy and failures of
Sandra Müller, Bartosz Wcisło
We describe a construction of a model of second order arithmetic in which (boldface) -determinacy holds, but (lightface) - fails, thus showing t…
Classical determinate truth without induction
Bartosz Wcisło
Fujimoto and Halbach had introduced a novel theory of type-free truth CD which satisfies full classical compositional clauses for connectives and quantifiers. Answering their quest…
Saturation properties for compositional truth with propositional correctness
Bartosz Wcisło
It is an open question whether compositional truth with the principle of propositional soundness ,,all arithmetical sentences which are propositional tautologies are true'' is cons…
Universal properties of truth
Mateusz Łełyk, Bartosz Wcisło
We investigate abstract model theoretic properties which holds for models in which a truth or satisfaction predicate for a sublanguage of the signature is definable. We analyse in…
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…
Full satisfaction classes, definability, and automorphisms
Bartosz Wcisło
We show that for every countable recursively saturated model of Peano Arithmetic and every subset , there exists a full satisfaction class such…
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…
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…
Truth and Feasible Reducibility
Ali Enayat, Mateusz Łełyk, Bartosz Wcisło
Let be any of the three canonical truth theories (Compositional truth without extra induction), (Friedman--Sheard truth without extra…
Disjunctions with stopping condition
Roman Kossak, Bartosz Wcisło
We introduce a tool for analysing models of , the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan's theorem that arithmetical…
Topological models of arithmetic
Ali Enayat, Joel David Hamkins, Bartosz Wcisło
Ali Enayat had asked whether there is a nonstandard model of Peano arithmetic (PA) that can be represented as , where and $\otimes…
Models of Positive Truth
Mateusz Łełyk, Bartosz Wcisło
This paper is a follow-up to "Models of PT with internal induction for total formulae." We give a strenghtening of the main result on the semantical non-conservativity of the…
Models of Weak Theories of Truth
Mateusz Łełyk, Bartosz Wcisło
In the following paper we propose a model-theoretical way of comparing the "strength" of various truth theories which are conservative over PA. Let denote the class…
Notes on bounded induction for the compositional truth predicate
Mateusz Łełyk, Bartosz Wcisło
We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with -induction scheme for the truth predicate and the full arithmetic…