scientific article; zbMATH DE number 3885886

zbMATH Open0556.03034MaRDI QIDQ3220573FDOQ3220573

Authors: Max Kanovich 

Publication date: 1984

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

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^†

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)

Cited In (3)

• Independent axiomatizability of sets of sentences
• Title not available (Why is that?)
• 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)