  We prove that the first-order logic of CZF is intuitionistic first-order
logic. To do so, we introduce a new model of transfinite computation (Set
Register Machines) and combine the resulting notion of realisability with Beth
semantics. On the way, we also show that the propositional admissible rules of
CZF are exactly those of intuitionistic propositional logic.
