A verifier for a language A is an algorithm V, where $$A = \{w \mid V\text{ accepts $\langle w,c \rangle$ for some string $c$}\}$$ ($c$ is called a certificate or  proof)What's the definition of $\langle , \rangle$ here?
Meaning of _ in the context of verifiers
complexity theory;notation