Unary negation fragment with equivalence relations has the finite model property

DOI10.1145/3209108.3209205zbMath1452.03027arXiv1802.01318OpenAlexW2963661828MaRDI QIDQ5145301

Emanuel Kieroński, Daniel Danielski

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.01318

zbMATH Keywords

equivalence relationsfinite model propertysatisfiabilityfinite satisfiabilityunary negation fragment

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

Unnamed Item ⋮ Propositional epistemic logics with quantification over agents of knowledge (an alternative approach)

This page was built for publication: Unary negation fragment with equivalence relations has the finite model property