Language for the disjunction definitions

The models for LogMIP have the following general formulation (Generalized Disjunctive Programming –GDP):

abt1
abt2

e3 are continuous variables,
e4 are binary variables (0-1),
 e5 are Boolean variables, to establish whether a disjunction term is true or false
 e6 logic relationships between Boolean variables,
 e7 objective function, which can be linear or non-linear,
 e8 linear or non-linear inequalities independent of the discrete choices,
 e9 mixed-integer inequalities that can contain linear or non-linear continuous terms,
e10 linear integer inequalities/equalities
 e11 fixed cost terms.