Characterizing Definability in Decidable Fixpoint Logics
From MaRDI portal
Publication:5111439
DOI10.4230/LIPIcs.ICALP.2017.107zbMath1442.03012OpenAlexW2964052308MaRDI QIDQ5111439
Michael Benedikt, Michael Vanden Boom, Pierre Bourhis
Publication date: 27 May 2020
Full work available at URL: https://hal.inria.fr/hal-01639015
Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (1)
This page was built for publication: Characterizing Definability in Decidable Fixpoint Logics