Kozen and Parikh's 1981 completeness result for PDL is standardly cited in the literature as a genuine completeness theorem without qualification, undermining the rhetorical force of 'only'.

?Rate how convincing each reason is below to see the overall strength.

No one has weighed in yet. Be the first to share reasons for or against this statement.

Completeness result(what the statement questions): When a formal logical system successfully captures everything true about its subject—like a perfect instruction manual that covers every possible case.
Completeness theorem(as a mathematical result about logical systems): A result showing that for a certain type of logic (first-order logic), everything that is true can be proven using the logical rules—there's no gap between what's true and what can be demonstrated.
Kozen and Parikh(as the creators of a significant completeness theorem): Two computer scientists (Dexter Kozen and Rohit Parikh) who proved an important mathematical result about logic systems in 1981.
PDL(as used in logic and computer science): Short for Propositional Dynamic Logic, a system for reasoning about what happens when programs run and what states they reach.

Based on where you are in your exploration