Can somebody help to understand whether SAT as the set of satisfiable formulas of first-order classical logic. Is SAT recursive, r.e. or none of them?
Thank you so much
Can somebody help to understand whether SAT as the set of satisfiable formulas of first-order classical logic. Is SAT recursive, r.e. or none of them?
Thank you so much
Copyright © 2021 JogjaFile Inc.