(**************************************************************)
(* Copyright Dominique Larchey-Wendling * *)
(* *)
(* * Affiliation LORIA -- CNRS *)
(**************************************************************)
(* This file is distributed under the terms of the *)
(* CeCILL v2 FREE SOFTWARE LICENSE AGREEMENT *)
(**************************************************************)
Require Import List.
Import ListNotations.
Require Import Undecidability.Synthetic.Undecidability.
From Undecidability.Shared.Libs.DLW
Require Import utils.
From Undecidability.PCP
Require Import PCP.
From Undecidability.StackMachines
Require Import BSM iPCPb_to_BSM_HALTING.
From Undecidability.MinskyMachines
Require Import MM BSM_MM.
Import ReductionChainNotations UndecidabilityNotations.
Lemma iBPCP_chain_MM : ⎩iPCPb ⪯ₘ BSM_HALTING ⪯ₘ MM_HALTS_ON_ZERO⎭.
Proof.
msplit 1.
+ apply iPCPb_to_BSM_HALTING.
+ apply BSM_MM_HALTS_ON_ZERO.
Qed.
Lemma iBPCP_to_MM : iPCPb ⪯ MM_HALTS_ON_ZERO.
Proof.
reduce with chain iBPCP_chain_MM.
Qed.
(* Copyright Dominique Larchey-Wendling * *)
(* *)
(* * Affiliation LORIA -- CNRS *)
(**************************************************************)
(* This file is distributed under the terms of the *)
(* CeCILL v2 FREE SOFTWARE LICENSE AGREEMENT *)
(**************************************************************)
Require Import List.
Import ListNotations.
Require Import Undecidability.Synthetic.Undecidability.
From Undecidability.Shared.Libs.DLW
Require Import utils.
From Undecidability.PCP
Require Import PCP.
From Undecidability.StackMachines
Require Import BSM iPCPb_to_BSM_HALTING.
From Undecidability.MinskyMachines
Require Import MM BSM_MM.
Import ReductionChainNotations UndecidabilityNotations.
Lemma iBPCP_chain_MM : ⎩iPCPb ⪯ₘ BSM_HALTING ⪯ₘ MM_HALTS_ON_ZERO⎭.
Proof.
msplit 1.
+ apply iPCPb_to_BSM_HALTING.
+ apply BSM_MM_HALTS_ON_ZERO.
Qed.
Lemma iBPCP_to_MM : iPCPb ⪯ MM_HALTS_ON_ZERO.
Proof.
reduce with chain iBPCP_chain_MM.
Qed.