Two-variable first-order logic with counting in forests

DOI10.29007/24FMMaRDI QIDQ5222957zbMATH OpenOpenAlexFDO

Authors Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/24fm

zbMATH Keywords

decision proceduresfinite satisfiabilitytwo-variable logic with counting quantifiersgeneral satisfiabilitylogic and computational complexityunranked trees/forests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70)

Recommendations

• Two-variable logic with counting and trees
• Two-variable logic with counting and trees
• Extending two-variable logic on trees
• Logics with counting and equivalence
• The two-variable fragment with counting and equivalence

Cited in

(6)

• Complexity Results for First-Order Two-Variable Logic with Counting
• A Note on C² Interpreted over Finite Data-Words
• Logics with counting and equivalence
• Extending two-variable logic on trees
• Two-variable logic with counting and trees
• Two-variable logic with counting and trees

This page was built for publication: Two-variable first-order logic with counting in forests

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