scientific article; zbMATH DE number 3885886

MaRDI QIDQ3220573zbMATH OpenFDO

Authors Max Kanovich

Publication date 1984

zbMATH Keywords

machinesprogramsinvariant representationinvariant predicateindependent formulasubrecursive level

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• scientific article; zbMATH DE number 3928984
• How to prove representation-independent independence results
• scientific article; zbMATH DE number 4072945
• scientific article; zbMATH DE number 1342210
• Some independence results in complexity theory^†

Cited in

(3)

• Independent axiomatizability of sets of sentences
• scientific article; zbMATH DE number 3928984 (Why is no real title available?)
• How to prove representation-independent independence results

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