Here's a good list: https://en.wikipedia.org/wiki/Completeness_(logic)#Forms_of_...

The existence of a proof within the logic system for every well-formed formula or its negation is "syntactical completeness".