Logics with counting and equivalence

DOI10.1145/2603088.2603117zbMATH Open1394.03012OpenAlexW1982412713WikidataQ130892449 ScholiaQ130892449MaRDI QIDQ4635661FDOQ4635661

Ian Pratt-Hartmann

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603117

zbMATH Keywords

complexitysatisfiabilityequivalence relation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25)

Cited In (7)

• Modal Logics with Counting
• A logical characterization of the counting hierarchy
• Graphs Identified by Logics with Counting
• On fixed-point logic with counting
• Equivalence in finite-variable logics is complete for polynomial time
• On logical and concurrent equivalences
• Arrow logic and infinite counting

This page was built for publication: Logics with counting and equivalence

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