6 citations · 16 across the 5 of their papers we have counts for
5 papers
Elementary analytic functions in
Emil Jeřábek
It is known that rational approximations of elementary analytic functions (exp, log, trigonometric, and hyperbolic functions, and their inverse functions) are computable in the wea…
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…
Rules with parameters in modal logic II
Emil Jeřábek
We analyze the computational complexity of admissibility and unifiability with parameters in transitive modal logics. The class of cluster-extensible (clx) logics was introduced in…
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…
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…