scientific article; zbMATH DE number 2038749
From MaRDI portal
Publication:4449214
zbMath1039.03005MaRDI QIDQ4449214
Tatiana Rybina, Andrei Voronkov
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190714.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (3)
The Complexity of One-Agent Refinement Modal Logic ⋮ The complexity of one-agent refinement modal logic ⋮ Automatic Structures of Bounded Degree Revisited
This page was built for publication:
