scientific article; zbMATH DE number 3954903

zbMATH Open0594.03038MaRDI QIDQ3724329FDOQ3724329

Authors: A. A. Chubaryan 

Publication date: 1982

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

Recommendations

• scientific article; zbMATH DE number 4059392
• Complexity of deductions in a system of classical propositional calculus
• scientific article; zbMATH DE number 4087630
• scientific article; zbMATH DE number 15882
• scientific article; zbMATH DE number 1390276

zbMATH Keywords

Shannon functionscomparative complexities

Mathematics Subject Classification ID

Classical first-order logic (03B10) Complexity of proofs (03F20)

Cited In (15)

• How derivation modes and halting conditions may influence the computational power of P systems
• On complexity of statements and meaningful complexity of an axiomatic theory
• On derivability
• Complexity of deductions in a system of classical propositional calculus
• Title not available (Why is that?)
• Putnam's theorem on the complexity of models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rabin style speed-up of proofs. More generalized speed-up in the systems of first order logic
• Essential structure of proofs as a measure of complexity
• Title not available (Why is that?)
• Title not available (Why is that?)

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 Q3724329)