I was reading a Wikipedia article on arithmetical hierarchy and came across bounded quantifiers. I didn't know what those were and so quickly went to another article to read up on them and only became more confused. Here's the definition, given by Wikipedia:
"In the study of formal theories in mathematical logic, bounded quantifiers are often added to a language in addition to the standard quantifiers "∀" and "∃". Bounded quantifiers differ from "∀" and "∃" in that bounded quantifiers restrict the range of the quantified variable."
I don't exactly understand what this means, though. Could somebody explain to me what a bounded and unbounded quantifier is (as simple as possible)? Thanks in advance.