I understand how in propositional logic, every proposition is a statement that is either TRUE or FALSE, and we can make use of logical connectors to turn separate propositions into fromulas which intern are more complex propositions.
My question is, just to see if i get this right: Is any proposition (be it a compound of predicates with quantors or just the basic well-formed formula), that's written down without any indication of its truth value, assumed to be true?
This would clarify why in higher level math topics (depending on formal logic and axiomatic set theory, like real analysis, linear algebra, etc..), when we state a theorem, we only write down a proposition without specifying truth values.