nullary

In the nullary case, one can derive truth from no premises.

If a constructor does not take any data arguments, it is nullary.

A 0-ary, or nullary, quasigroup is just a constant element of Q.

This means that there can be no confusion regarding the use of nullary intersections in the definition.

Any nullary data constructor is effectively isomorphic with the unit type.

Note that in the nullary case, i.e., for falsehood, there are no introduction rules.

The case of a unary operation is similar; but one should also look at nullary operations, which pick out a constant element.

A class with a nullary constructor is subject to being instantiated in an invalid state.

This is known as "preservation of nullary unions."

Propositional variables are represented as nullary predicates in first order logic.

In mathematics, an empty product, or nullary product, is the result of multiplying no factors.

The preservation of nullary unions states that .

In the sense of universal algebra, they are structures with a single nullary operation which picks out the basepoint.

Nullary elements (of zero arity) are also called constants.

Basic types are considered nullary type constructors.

A nullary function takes no arguments.

In computer programming, a nullary constructor is a constructor that takes no arguments.

Preservation of nullary unions: The closure of the empty set is empty.

The nullary biproduct is the trivial group.

Default constructors of objects are usually nullary.

Sometimes it is useful to consider a constant to be an operation of arity 0, and hence call it nullary.

L is a monoid under binary composition (-) and nullary identity I:

In logic, false or untrue is a truth value or a nullary logical connective.

The prototype therefore has two operations taking no arguments, called zeroary or nullary operations, namely zero and one.

(A nullary function symbol is called a constant symbol.)