Programs are like constructive proofs of their specifications. This analogy is a precise equivalence for certain classes of programs. The connection between formal logic and programs is a foundation for programming methodology superior to that usually adopted. Moreover, this equivalence suggests programming languages which are far richer than all others currently in use. These claims are established in this paper introducing parts of the PL/CV programming logics as a source of precision and examples. Key Words and Phrases: Algorithmic logic, automated logic, axiomatic semantics, constructive mathematics, program correctness, PL/CV, programming logic, programming methodology, realizability, while rule.