Yes, and yes. P != NP could be independent from Peano Arithmetic (PA) or the Zermelo-Fraenkel set theory with Axiom of Choice (ZFC) models. That is a separate conjecture which is also presently open.
> At the end of the day, a polynomial-time algorithm for 3-SAT either exists or it doesn't!