scientific article

zbMath0636.03033MaRDI QIDQ3775538

Elias Dahlhaus

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

least fixpointsSkolem normal formsecond order formula

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items

Dependence logic with generalized quantifiers: axiomatizations ⋮ Stratified least fixpoint logic ⋮ Generalized hex and logical characterizations of polynomial space ⋮ Parameterized Complexity Classes under Logical Reductions ⋮ Non-determinism in logic-based languages ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ Datalog extensions for database queries and updates ⋮ Why not negation by fixpoint? ⋮ Capturing complexity classes by fragments of second-order logic ⋮ Games for Inclusion Logic and Fixed-Point Logic ⋮ Positive versions of polynomial time ⋮ Unnamed Item ⋮ The expressive power of stratified logic programs