scientific article; zbMATH DE number 3790418

MaRDI QIDQ3967528zbMATH OpenFDO

Authors Martin Fürer

Publication date 1982

zbMATH Keywords

computational complexitysatisfiabilityTuring machinepredicate calculusdeterministic Turing machineAckermann prefix classmonadic class

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

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