scientific article; zbMATH DE number 4174914

MaRDI QIDQ3199407zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 1990

zbMATH Keywords

arithmetical hierarchypolynomial equationspredicates over words

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• An arithmetical hierarchy in propositional dynamic logic
• A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
• scientific article; zbMATH DE number 1567841
• scientific article; zbMATH DE number 1555183
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Foundations of Information and Knowledge Systems
• Arity and alternation: a proper hierarchy in higher order logics
• Predicate Logics of Constructive Arithmetical Theories
• scientific article; zbMATH DE number 1086669
• The arity hierarchy in the polyadic \(\mu\)-calculus

Cited in

(6)

• scientific article; zbMATH DE number 1542840 (Why is no real title available?)
• A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
• Complexity of the search for the least solution to a system of dictionary equations of exponential type
• Diophantine hierarchy
• scientific article; zbMATH DE number 3961590 (Why is no real title available?)
• scientific article; zbMATH DE number 1811326 (Why is no real title available?)

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