CookLevin.seqCompose_machine_core_child_reduction_child
DisprovedReduction child lemma for CookLevin.seqCompose_machine_core_child
Formal statement
import Definitions.Def_CookLevin_Basic
import Definitions.Def_CookLevin_Satisfiability
import Definitions.Def_CookLevin_Complexity
import Definitions.Def_CookLevin_Reduction
open CookLevin
theorem CookLevin.seqCompose_machine_core_child_reduction_child
(M1 M2 : Machine) (k1 k2 G1 G2 : Nat) (k G : Nat)
(hk : 2 ≤ k ∧ k ≥ max k1 k2) (hG : 4 ≤ G ∧ G ≥ max G1 G2) :
∃ (M : Machine),
(∀ cmd ∈ M, TuringCommand k M.length G cmd) ∧
(∀ (xs ws : List Symbol) (t1 : Nat),
DecidesIn M1 k1 xs ws t1 false →
DecidesIn M k xs ws t1 false) ∧
(∀ (xs ws : List Symbol) (t1 t2 : Nat) (b2 : Bool),
DecidesIn M1 k1 xs ws t1 true →
DecidesIn M2 k2 xs ws t2 b2 →
DecidesIn M k xs ws (t1 + t2) b2) := by sorry