6 citations · 16 across the 5 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2021★ 1 cited
The theory of hereditarily bounded sets
Emil Jeřábek
We show that for any , the structure of sets that are hereditarily of size at most is decidable. We provide a transparent complete axiomatization of its theo…
math.LO2018★ 5 cited
Induction rules in bounded arithmetic
Emil Jeřábek
We study variants of Buss's theories of bounded arithmetic axiomatized by induction schemes disallowing the use of parameters, and closely related induction inference rules. We put…
math.LO2016★ 6 cited
Galois connection for multiple-output operations
Emil Jeřábek
It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary op…