In this paper, we start by defining the basic predicate systems used by Gödel in his logical constructions for the creation of a system of computable mathematics. We demonstrate how each of these predicates and the primitive recursive functions can be mapped directly into bitcoin script operations. This is then extended to explore the dual stack 2PDA construction within bitcoin.