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
Asked
Active
Viewed 137 times
0
-
1See Satisfiability in first-order logic. – Mauro ALLEGRANZA Jan 05 '19 at 11:51
-
@MauroALLEGRANZA Thank you :) – Norman Jan 05 '19 at 11:55