scientific article; zbMATH DE number 4195902

MaRDI QIDQ5202633zbMATH OpenFDO

Authors Max Kanovich

Publication date 1989

zbMATH Keywords

algorithmscomplexityrefutation of unprovable formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 966896
• On decision procedures for sentential logics
• Refutation systems in modal logic
• scientific article; zbMATH DE number 4004179
• On arithmetic complexity of some constructive logics

Cited in

(8)

• On decision procedures for sentential logics
• Linear logic as a logic of computations
• Syntactic refutations against finite models in modal logic
• On refutation rules
• On the complexity of the reflected logic of proofs
• scientific article; zbMATH DE number 1471985 (Why is no real title available?)
• scientific article; zbMATH DE number 1765669 (Why is no real title available?)
• Refutation systems in the finite

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202633)