Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Wcisło, Bartosz"'
Autor:
Wcisło, Bartosz
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 question, we show that the induction-free variant of that theory is conserv
Externí odkaz:
http://arxiv.org/abs/2408.01198
Autor:
Wcisło, Bartosz
It is an open question whether compositional truth with the principle of propositional soundness ,,all arithmetical sentences which are propositional tautologies are true'' is conservative over its arithmetical base theory. In this article, we show t
Externí odkaz:
http://arxiv.org/abs/2405.13942
Autor:
Wcisło, Bartosz
Answering a question of Kaye, we show that the compositional truth theory with a full collection scheme is conservative over Peano Arithmetic. We demonstrate it by showing that countable models of compositional truth which satisfy the internal induct
Externí odkaz:
http://arxiv.org/abs/2403.19367
Autor:
Łełyk, Mateusz, Wcisło, Bartosz
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 which cases those properties in fact ensure the definability of the re
Externí odkaz:
http://arxiv.org/abs/2304.00370
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 the principle "every true disjunction has a true disjunct" is equivale
Externí odkaz:
http://arxiv.org/abs/2108.13718
Autor:
Wcisło, Bartosz
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 that $A$ is definable in $(M,S_A)$ without parametres. It follows tha
Externí odkaz:
http://arxiv.org/abs/2104.09969
Autor:
Wcisło, Bartosz
Cie\'sli\'nski asked whether compositional truth theory with the additional axiom that all propositional tautologies are true is conservative over Peano Arithmetic. We provide a partial answer to this question, showing that if we additionally assume
Externí odkaz:
http://arxiv.org/abs/2011.06940
Autor:
Łełyk, Mateusz, Wcisło, Bartosz
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 arithmetical setting. This axiom states that upon restriction to formulae of an
Externí odkaz:
http://arxiv.org/abs/2006.11124
Publikováno v:
J. symb. log. 85 (2020) 367-421
Let $\mathcal{T}$ be any of the three canonical truth theories $\textsf{CT}^-$ (Compositional truth without extra induction), $\textsf{FS}^-$ (Friedman--Sheard truth without extra induction), and $\textsf{KF}^-$ (Kripke--Feferman truth without extra
Externí odkaz:
http://arxiv.org/abs/1902.00392