Finite satisfiability for guarded fixpoint logic
From MaRDI portal
Publication:436331
DOI10.1016/j.ipl.2012.02.005zbMath1243.68191arXiv1104.2262OpenAlexW1749183653MaRDI QIDQ436331
Mikołaj Bojańczyk, Vince Bárány
Publication date: 20 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2262
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)
Related Items
Cites Work