(**************************************************************)
(*   Copyright Dominique Larchey-Wendling [*]                 *)
(*                                                            *)
(*                             [*] Affiliation LORIA -- CNRS  *)
(**************************************************************)
(*      This file is distributed under the terms of the       *)
(*         CeCILL v2 FREE SOFTWARE LICENSE AGREEMENT          *)
(**************************************************************)
(* ** FRACTRAN reduces to Diophantine logic *)
From Undecidability.Synthetic Require Import Undecidability.
From Undecidability.Shared.Libs.DLW
From Undecidability.FRACTRAN
From Undecidability.H10.Fractran Require Import fractran_dio.
From Undecidability.H10.Dio      Require Import dio_elem dio_single dio_logic.
Set Implicit Arguments.
(* A diophantine logic satisfiability question is given a diophantine logic formula f and a valuation for the parameters. Is the formula valid ? *)
Definition DIO_LOGIC_PROBLEM :=
(dio_formula * (nat -> nat))%type.
Definition DIO_LOGIC_SAT (p : DIO_LOGIC_PROBLEM) :=
let (f,ν) := p in df_pred f ν.
(* An elementary diophantine problem is a list of elementary diophantine constraints and a valuation for the parameters. The question is whether there exists a valuation for the variables that satisfies all the constraints simultaneously *)
Definition DIO_ELEM_PROBLEM :=
(list dio_constraint * (nat -> nat))%type.
Definition DIO_ELEM_SAT (p : DIO_ELEM_PROBLEM) :=
let (l,v) := p in exists φ, Forall (dc_eval φ v) l.

Theorem DIO_LOGIC_ELEM_SAT : DIO_LOGIC_SAT ⪯  DIO_ELEM_SAT.