Mateusz Łełyk

Mateusz Łełyk
  • Doctor of Philosophy
  • University of Warsaw

About

28
Publications
1,870
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
110
Citations
Current institution
University of Warsaw

Publications

Publications (28)
Article
Full-text available
By definition, the implicit commitment of a formal theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{Th}$$\end{document} consists of sentences that are ind...
Article
In this paper, we investigate abstract model-theoretic properties which hold for models in which a truth or satisfaction predicate for a sublanguage of the signature is definable. We analyze in which cases those properties in fact ensure the definability of the respective truth predicate. In some cases, we formulate different axiomatic theories whi...
Article
Full-text available
We study the structure of the partial order induced by the definability relation on definitions of truth for the language of arithmetic. Formally, a definition of truth is any sentence α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepac...
Preprint
Full-text available
By classical results of Dedekind and Zermelo, second order logic imposes categoricity features on Peano Arithmetic and Zermelo-Fraenkel set theory. However, we have known since Skolem's anti-categoricity theorems that the first order formulations of Peano Arithmetic and Zermelo-Fraenkel set theory (i.e., PA and ZF) are not categorical. Here we inve...
Article
Gödel’s Incompleteness Theorems suggest that no single formal system can capture the entirety of one’s mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit those implicit assumptions. This notion of implicit commitment motivates directly or indirectly several research pr...
Preprint
Full-text available
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 respective truth predicate. In some cases, we formulate different axiomatic theories which are indispe...
Preprint
Full-text available
We study subsets of countable recursively saturated models of $\mathsf{PA}$ which can be defined using pathologies in satisfaction classes. More precisely, we characterize those subsets $X$ such that there is a satisfaction class $S$ where $S$ behaves correctly on an idempotent disjunction of length $c$ if and only if $c \in X$. We generalize this...
Preprint
G\"odel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit those \emph{implicit} assumptions. This notion of \emph{implicit commitment} motivates directly or indirectly sev...
Article
Full-text available
We employ the lens provided by formal truth theory to study axiomatizations of Peano Arithmetic ${\textsf {(PA)}}$ . More specifically, let Elementary Arithmetic ${\textsf {(EA)}}$ be the fragment $\mathsf {I}\Delta _0 + \mathsf {Exp}$ of ${\textsf {PA}}$ , and let ${\textsf {CT}}^-[{\textsf {EA}}]$ be the extension of ${\textsf {EA}}$ by the commo...
Article
Ali Enayat had asked whether two halves of Disjunctive Correctness (DC) for the compositional truth predicate are conservative over Peano Arithmetic (PA). In this paper, we show that the principle “every true disjunction has a true disjunct” is equivalent to bounded induction for the compositional truth predicate and thus it is not conservative. On...
Article
Full-text available
The notion of implicit commitment has played a prominent role in recent works in logic and philosophy of mathematics. Although implicit commitment is often associated with highly technical studies, it remains an elusive notion. In particular, it is often claimed that the acceptance of a mathematical theory implicitly commits one to the acceptance o...
Article
Full-text available
The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of $\mathrm {Th}$ are true,” where $\mathrm {Th}$ is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kot...
Preprint
Full-text available
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 equivalent to bounded induction for the compositional truth predicate and thus it is not conservative. On th...
Preprint
Full-text available
We employ the lens provided by formal truth theory to study axiomatizations of PA (Peano Arithmetic). More specifically, let EA (Elementary Arithmetic) be the fragment I∆0 + Exp of PA, and CT − [EA] be the extension of EA by the commonly studied axioms of compositional truth CT −. We investigate both local and global properties of the family of fir...
Preprint
Full-text available
The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion "All theorems of Th are true", where Th is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski's proof from [15]...
Article
We introduce a principle of local collection for compositional truth predicates and show that it is arithmetically conservative over the classically compositional theory of truth. This axiom states that upon restriction to formulae of any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments using collect...
Preprint
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 any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments...
Article
Let ${\cal T}$ be any of the three canonical truth theories CT ⁻ (compositional truth without extra induction), FS ⁻ (Friedman–Sheard truth without extra induction), or KF ⁻ (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA (Peano arithmetic). We establish the following theorem, which implies that ${\cal T}$...
Preprint
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 induction), where the base theory of $\mathcal{T}$ is $\textsf{PA}$ (Peano arithmetic). We show that...
Article
This paper is a follow-up to [4], in which a mistake in [6] (which spread also to [9]) was corrected. We give a strenghtening of the main result on the semantical nonconservativity of the theory of PT ⁻ with internal induction for total formulae ${(\rm{P}}{{\rm{T}}^ - } + {\rm{INT}}\left( {{\rm{tot}}} \right)$ , denoted by PT ⁻ in [9]). We show tha...
Article
Full-text available
We study an extension of modal mu-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show expressive limitations of atom-enriched mu-calculi, and explain how their expressive...
Article
Full-text available
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 theory of PT${}^-$ with internal induction for total formulae (PT${}^- +$ INT(tot)). We show that if to PT${}^-$ the axiom of internal induction for all arithmetical for...
Preprint
In the following paper we propose a model-theoretical way of comparing the "strength" of various truth theories which are conservative over PA. Let $\mathfrak{Th}$ denote the class of models of PA which admit an expansion to a model of theory Th. We show (combining some well known results and original ideas) that $$\mathfrak{PA}\supset \mathfrak{TB...
Preprint
We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with $\Delta_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 pr...
Article
Full-text available
In the following paper we propose a model-theoretical way of comparing the “strength” of various truth theories which are conservative over \( PA \). Let \({\mathfrak {Th}}\) denote the class of models of \( PA \) which admit an expansion to a model of theory \({ Th}\). We show (combining some well known results and original ideas) that $$\begin{al...
Article
Full-text available
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 principl...
Article
We show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PT tot ) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PT tot contains every recursively saturated model of arithmetic. Our results point to a gap...

Network

Cited By