Sebastian Eberhard
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Complexity of decision problems on totally rigid acyclic tree grammars | 2018-11-22 | Paper |
| Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars ACM Transactions on Computational Logic | 2018-03-22 | Paper |
| On the compressibility of finite languages and formal proofs Information and Computation | 2018-03-21 | Paper |
| Boolean unification with predicates Journal Of Logic And Computation | 2017-05-17 | Paper |
| Compressibility of Finite Languages by Grammars Descriptional Complexity of Formal Systems | 2015-08-07 | Paper |
| Applicative theories for logarithmic complexity classes Theoretical Computer Science | 2015-05-26 | Paper |
| Inductive theorem proving based on tree grammars Annals of Pure and Applied Logic | 2015-05-15 | Paper |
| Weak theories of truth and explicit mathematics | 2014-06-24 | Paper |
| A feasible theory of truth over combinatory algebra Annals of Pure and Applied Logic | 2014-02-14 | Paper |
Research outcomes over time
This page was built for person: Sebastian Eberhard
