scientific article; zbMATH DE number 3790418
From MaRDI portal
Publication:3967528
zbMATH Open0502.03025MaRDI QIDQ3967528FDOQ3967528
Authors: Martin Fürer 
Publication date: 1982
Title of this publication is not available (Why is that?)
computational complexitysatisfiabilityTuring machinepredicate calculusdeterministic Turing machineAckermann prefix classmonadic class
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)
