ModRing

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additiveGroup: Group with Abelian with SymbolicTimes

Addition gives rise to an Abelian group

final def asInstanceOf[T0]: T0

def clone(): AnyRef

val dom: ModSort

Domain of the ring

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def geq(s: ITerm, t: ITerm): IFormula

Greater-than-or-equal operator

final def getClass(): Class[_]

def gt(s: ITerm, t: ITerm): IFormula

Greater-than operator

def hashCode(): Int

def int2ring(s: ITerm): ITerm

Conversion of an integer term to a ring term

final def isInstanceOf[T0]: Boolean

def isInt(s: ITerm): IFormula

Test whether a ring element represents an integer number.

def leq(s: ITerm, t: ITerm): IFormula

Less-than-or-equal operator

val lower: IdealInt

def lt(s: ITerm, t: ITerm): IFormula

Less-than operator

def minus(s: ITerm): ITerm

Additive inverses

def minus(s: ITerm, t: ITerm): ITerm

Difference between two terms

def mul(s: ITerm, t: ITerm): ITerm

Ring multiplication

def multiplicativeMonoid: Monoid with Abelian

Multiplication gives rise to an Abelian monoid

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val one: ITerm

The one element of this ring

def plus(s: ITerm, t: ITerm): ITerm

Ring addition

def product(terms: ITerm*): ITerm

N-ary sums

def ring2int(s: ITerm): ITerm

Conversion of a ring term to an integer term.

def summation(terms: ITerm*): ITerm

N-ary sums

final def synchronized[T0](arg0: ⇒ T0): T0

def times(num: IdealInt, s: ITerm): ITerm

num * s

def toString(): String

val upper: IdealInt

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

val zero: ITerm

The zero element of this ring

def finalize(): Unit