Frederik Harwath

Image of Frederik Harwath I am a doctoral candidate in computer science at Humboldt University of Berlin. My doctoral advisor is Prof. Dr. Nicole Schweikardt.

My research interests include finite and algorithmic model theory (e.g. extensions of first-order logic with numerical predicates, notions of locality, succinctness questions, preservation theorems) and its relations to complexity theory (e.g. circuit complexity).

Contact

E-Mail: MyFirstName@harwath.name
pgp public key

Selected Publications

A list of my publications can also be found at DBLP.

If the published version is freely accessible, I provide just a link to the paper. Otherwise, my draft version of the paper is provided as soon as possible.

If there is a journal version of a conference paper, it is advisable to use this version. Usually this will contain further results and an improved presentation.

Preprints

Succinctness of Order-Invariant Logics on Depth-Bounded Structures
with K. Eickmeyer , M. Elberfeld, Accepted for publication in ACM Transactions on Computational Logic
(arXiv)

Conference and Journal Papers

On the locality of arb-invariant first-order formulas with modulo counting quantifiers
with N. Schweikardt, Logical Methods in Computer Science 12(4), 2016
(URL)

Order-Invariance of Two-Variable Logic is Decidable
with T. Zeume , Proceedings of LICS 2016
(DOI)

A note on the size of prenex normal forms
Information Processing Letters 116(7), 2016
(PDF|DOI)

Preservation and decomposition theorems for bounded degree structures
with L. Heimberg , N. Schweikardt, Logical Methods in Computer Science 11(4), 2015
(DOI)

Preservation and decomposition theorems for bounded degree structures
with L. Heimberg , N. Schweikardt, Proceedings of CSL-LICS, 2014
(PDF|DOI)

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
with K. Eickmeyer , M. Elberfeld , Proceedings of MFCS, 2014
(PDF|DOI)

On the locality of arb-invariant first-order logic with modulo counting quantifiers
with N. Schweikardt, Proceedings of CSL, 2013
(PDF|DOI)

Regular tree languages, cardinality predicates, and addition-invariant FO
with N. Schweikardt, Proceedings of STACS, 2012
(DOI)