scientific article; zbMATH DE number 4114609

MaRDI QIDQ4729773zbMATH OpenFDO

Authors A. N. Degtev

Publication date 1986

zbMATH Keywords

Gödel numberingm-degrees of hereditary setsm-degrees of theoriesnonrecursive complete extensionrecursive theoryreducibilitiestautological closure

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• scientific article; zbMATH DE number 3995647
• scientific article; zbMATH DE number 65760
• The Complexity of Propositional Proofs
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1860672
• scientific article; zbMATH DE number 1156870
• scientific article; zbMATH DE number 1390276
• Complexity of Propositional Independence and Inclusion Logic
• Propositional logics complexity and the sub-formula property
• The complexity of propositional implication

Cited in

(8)

• The complexity of Gentzen systems for propositional logic
• Possibilistic logic: Complexity and algorithms
• Complexity Classifications for Logic-Based Argumentation
• scientific article; zbMATH DE number 5599076 (Why is no real title available?)
• The metatheory of the classical propositional calculus is not axiomatizable
• scientific article; zbMATH DE number 2063839 (Why is no real title available?)
• A note on the complexity of propositional Hoare logic
• Complexity of hyperconcepts

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