Characterizing definability in decidable fixpoint logics

DOI10.4230/LIPICS.ICALP.2017.107zbMATH Open1442.03012OpenAlexW2964052308MaRDI QIDQ5111439FDOQ5111439

Authors: Michael Benedikt, Pierre Bourhis, Michael Vanden Boom 

Publication date: 27 May 2020

Full work available at URL: https://hal.inria.fr/hal-01639015

Recommendations

• scientific article; zbMATH DE number 7104937
• A Step Up in Expressiveness of Decidable Fixpoint Logics
• scientific article; zbMATH DE number 1341606
• Guarded negation
• Guarded fixed point logics and the monadic theory of countable trees.

zbMATH Keywords

automatadefinabilitybisimulationguarded logics

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Cited In (5)

• Characters and fixed points in provability logic
• Title not available (Why is that?)
• On the structural properties of the set of fixpoints for nondeterministic recursive definitions
• Semiring Provenance for Guarded Logics
• A Step Up in Expressiveness of Decidable Fixpoint Logics

This page was built for publication: Characterizing definability in decidable fixpoint logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111439)