scientific article; zbMATH DE number 4195902

zbMATH Open0725.03003MaRDI QIDQ5202633FDOQ5202633

Authors: Max Kanovich 

Publication date: 1989

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmscomplexityrefutation of unprovable formulas

Mathematics Subject Classification ID

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

Cited In (6)

• Linear logic as a logic of computations
• On refutation rules
• On the complexity of the reflected logic of proofs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Syntactic refutations against finite models in modal logic

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)