After reading Gödel's incompleteness theorem, I wonder if there are any systems whose axioms are sound and complete. I realize that Gödel's arguments (at least from my sources) only apply to arithmetic logic. So, I wonder if it applies to propositional logic as well.
If propositional logic is not sound and complete, are there any systems of axioms which are? I find it strange because then the system would almost become circular in a way. I hope I made some sense, I apologize if I misrepresented some theorems or terms.