public MonaSuccessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Succ) { }
public MonaIsSuccessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Succ)
{
}
public MonaBelongs(MonaPos p, MonaSet S)
{
this.pos = p;
this.set = S;
}
public MonaPosGeq(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Geq)
{
}
public MonaIsPredecessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Pred)
{
}
public MonaPosLe(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Le) { }
public MonaPosLe(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Le)
{
}
public MonaPredecessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Pred)
{
}
public MonaPosUnary(MonaPos p, MonaPosUnaryConstructor op)
{
this.pos = p;
this.op = op;
}
public MonaBelongs(MonaPos p, MonaSet S)
{
this.pos = p;
this.set = S;
}
public MonaSuccessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Succ)
{
}
public MonaIsSuccessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Succ) { }
public MonaIsPredecessor(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Pred) { }
public MonaPosGeq(MonaPos p1, MonaPos p2) : base(p1, p2, MonaPosComparisonOperator.Geq) { }
public MonaPredecessor(MonaPos p) : base(p, MonaPosUnaryConstructor.Pred) { }
public MonaBinaryPosFormula(MonaPos p1, MonaPos p2, MonaPosComparisonOperator op)
{
this.pos1 = p1;
this.pos2 = p2;
this.op = op;
}
public MonaPosUnary(MonaPos p, MonaPosUnaryConstructor op)
{
this.pos = p;
this.op = op;
}
public MonaBinaryPosFormula(MonaPos p1, MonaPos p2, MonaPosComparisonOperator op)
{
this.pos1 = p1;
this.pos2 = p2;
this.op = op;
}