scientific article; zbMATH DE number 3366917

zbMath0232.02034MaRDI QIDQ5639707

Stål Aanderaa

Publication date: 1971

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

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (9)

Satisfiability of the smallest binary program ⋮ On the complexity of single-rule datalog queries. ⋮ The reachability problem for Petri nets and decision problems for Skolem arithmetic ⋮ The equivalence of Horn and network complexity for Boolean functions ⋮ Diem-Grade Logischer Entscheidungsprobleme ⋮ Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen ⋮ Path constraints in semistructured databases ⋮ The complexity of the satisfiability problem for Krom formulas ⋮ Prefix classes of krom formulae with identity

This page was built for publication: