most citedThe $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages

1 citations

researchers with a paper here
collaborating institutions

9 papers

cs.LO2026

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic

Jean Christoph Jung, Jędrzej Kołodziejski, Jędrzej Kołodziejski

Modal separability for modal fixpoint formulae is the problem to decide for two given modal fixpoint formulae whether there is a modal formula that separates them, in th…

math.GR2026

The group identification problem for -groups of small order

Bettina Eick, Henrik Schanze

We investigate which group-theoretic invariants are powerful in distinguishing among non-isomorphic p-groups. Based on this, we devise an effective algorithm to solve the group ide…

cs.FL2026★ 1 cited

The -Complexity Of Visibly Pushdown Languages

Stefan Göller, Stefan Göller, Nathan Grosshans

We study the question of which visibly pushdown languages (VPLs) are in the complexity class and how to effectively decide this question. Our contribution is to int…

cs.LO2026

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth

Isolde Adler, Eva Fluck, Tim Seppelt +1

We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…

math.LO2026

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory

Hakon Robbestad Gylterud, Elisabeth Stenholm, Niccolò Veltri

Non-well-founded material sets have been modelled in Martin-Löf type theory by Lindström using setoids. In this paper we construct models of non-wellfounded material sets in Homo…

cs.LO2026

Computation by infinite descent made explicit

Sebastian Enqvist

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotate…