A feasible theory of truth over combinatory algebra. - Sebastian Eberhard (Ann. Pure Appl. Log., 2014)

Compressibility of Finite Languages by Grammars. - Sebastian Eberhard; Stefan Hetzl (DCFS, 2015)

Inductive theorem proving based on tree grammars. - Sebastian Eberhard; Stefan Hetzl (Ann. Pure Appl. Log., 2015)

Applicative theories for logarithmic complexity classes. - Sebastian Eberhard (Theor. Comput. Sci., 2015)

Boolean unification with predicates. - Sebastian Eberhard; Stefan Hetzl; Daniel Weller 001 (J. Log. Comput., 2017)

Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. - Sebastian Eberhard; Gabriel Ebner; Stefan Hetzl (ACM Trans. Comput. Log., 2017)

Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. - Sebastian Eberhard; Gabriel Ebner; Stefan Hetzl (DLT, 2018)

On the compressibility of finite languages and formal proofs. - Sebastian Eberhard; Stefan Hetzl (Inf. Comput., 2018)