Unary

You get one guess as to what the unary influence resulting in this policy is. ❋ Unknown (2009)

For example, if a unary function is considered as a set of ordered pairs, then the domain and codomain are given by the first and second projections, respectively. ❋ Bimbó, Katalin (2008)

Three unary propositional functions are defined, one corresponding to classical negation, as well as seven binary functions, including classical disjunction, conjunction and equivalence. ❋ Glymour, Clark (2008)

Thus, without loss of generality, it is sufficient to consider unary functions. ❋ Bimbó, Katalin (2008)

There are 3 types of messages - unary, binary and keyword ❋ Bill Kerr (2007)

The language of arithmetic does not contain the unary predicate symbol T. ❋ Halbach, Volker (2007)

Graphs, of the oriented kind arising in say automata theory where multiple edges may connect the same two vertices, can be organized as algebras having two unary operations s and t satisfying s (s (x)) = ❋ Pratt, Vaughan (2007)

Peirce defines a large number of unary and binary operators on these three truth values. ❋ Hammer, Eric (2007)

The role of contraction was noticed by Fitch 1936, who observed that, in order to derive the Russell paradox one considers a function of two variables, then one diagonalizes and regards such an object as a new unary propositional function. ❋ Cantini, Andrea (2007)

Unoriented graphs are defined as for graphs with an additional unary operation g satisfying g (g (x)) = ❋ Pratt, Vaughan (2007)

In the case at hand, the class of all algebras with a constant, a unary operation, and a binary operation, satisfying all the laws satisfied by the integers, is exactly the class of abelian groups. ❋ Pratt, Vaughan (2007)

It has as individual constant only the symbol 0 for zero; its only function symbols is the unary successor symbol S; addition and multiplication are expressed by predicate symbols. ❋ Halbach, Volker (2007)

Suppose that L contains nonquote names α0, α1, α2, α3, ¦, and unary predicates G and T. ❋ Kremer, Philip (2006)

A propositional language L is a set of connectives, that is, a set of symbols each one of which has an arity n that tells us in case that n = 0 that the symbol is a propositional constant, and in case that n 0 whether the connective is unary, binary, ternary, etc. ❋ Jansana, Ramon (2006)

A DNA sequence encoding the first 1000 digits of pi in unary? ❋ Unknown (2006)

Let L be a language containing a unary connective ~ ❋ Wansing, Heinrich (2006)

Note here that in the first clause, sum (x,0) can be understood as identified with the unary projection function of ❋ Odifreddi, Piergiorgio (2005)

It follows that a completely silent source also qualifies as a unary source. ❋ Floridi, Luciano (2005)

And if silencing a source (censorship) may be a nasty way of making a source uninformative, it is well known that crying wolf is a classic case in which an informative source degrades to the role of uninformative unary device. ❋ Floridi, Luciano (2005)