activity
20172026
most citedNotes on bounded induction for the compositional truth predicate

35 citations · 52 across the 14 of their papers we have counts for

collaborators

15 papers

math.LO2026

Corrigendum & Addendum to "Categoricity-like Properties in the First Order Realm"

Ali Enayat, Mateusz Łełyk

This note complements our paper "Categoricity-like properties in the first order realm" (Journal for the Philosophy of Mathematics, 2024).

math.LO2025

Descending sequences in reflection hierarchies

Mateusz Łełyk, James Walsh

There is no recursively enumerable sequence of sufficiently strong 2-consistent r.e. theories such that each proves the -consistency of the next. Montalbán and Shavrukov indepen…

math.LO2025

Tightness and solidity in fragments of Peano Arithmetic

Piotr Gruza, Leszek Aleksander Kołodziejczyk, Mateusz Łełyk

It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this…

math.LO2025

Definiteness properties of first-order schemes

Piotr Gruza, Mateusz Łełyk

The paper aims to establish a convenient formal framework for investigating the phenomenon of scheme definiteness, exemplified by first-order internal categoricity as studied by Vä…

math.LO2025

Classifying the complexity of models of arithmetic

David Gonzalez, Mateusz Łełyk, Dino Rossegger +1

We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored line…

math.LO2023

Varieties of truth definitions

Piotr Gruza, Mateusz Łełyk

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 sent…