On the complexity of the theories of weak direct powers

DOI10.2307/2272034zbMath0383.03011OpenAlexW4236014186MaRDI QIDQ4163506

Charles W. Rackoff

Publication date: 1976

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272034

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25)

Related Items

A uniform method for proving lower bounds on the computational complexity of logical theories, Complexity of logical theories involving coprimality