Regular tree languages, cardinality predicates, and addition-invariant FO

DOI10.4230/LIPICS.STACS.2012.489zbMATH Open1245.68124MaRDI QIDQ2904787FDOQ2904787

Authors: Frederik Harwath, Nicole Schweikardt 

Publication date: 23 August 2012

Recommendations

• Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
• STACS 2005
• First-order logic on finite trees
• Modulo-counting quantifiers over finite trees
• Cardinality logics. Part II: Definability in languages based on ‘exactly’

zbMATH Keywords

regular tree languagesaddition-invariant first-order logicalgebraic closure propertiesdecidable characterisationslogical interpretations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Logic in computer science (03B70)

Cited In (2)

• Title not available (Why is that?)
• Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)

This page was built for publication: Regular tree languages, cardinality predicates, and addition-invariant FO

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