Which of the following statements are correct

Axioms require proofs of their statements.

A language is in NP if it is decided by some Nondeterministic Polynomial$-$Time Turing Machine, as well as in other cases.

A fixed point of a function is a value that is left unchanged by repeated applications of the function.

The P complexity class is either a subset of the PSPACE class or both classes are the same.