The Computation model for Kernal Andorra is Presented, and some logical aspects treated. In particular a soundness theorem relative to a modified completion involving a logical interpretation of cut procedures is proved, together with a completeness theorem for wait-clauses.