8 citations · 8 across the 3 of their papers we have counts for
3 papers
math.LO2024
A note on the theory of well orders
Emil Jeřábek
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
math.LO2024
On the theory of exponential integer parts
Emil Jeřábek
We axiomatize the first-order theories of exponential integer parts of real-closed exponential fields in a language with , in a language with a predicate for powers of 2, and…
cs.LO2011★ 8 cited
The complexity of admissible rules of Łukasiewicz logic
Emil Jeřábek
We investigate the computational complexity of admissibility of inference rules in infinite-valued Łukasiewicz propositional logic (Ł). It was shown in [13] that admissibility in Ł…