In mathematics and logic, an operation is finitary if it has finite arity, i.e. if it has a finite number of input values. Similarly, an infinitary operation...

together with its homomorphisms, forms a category; these are usually called finitary algebraic categories. A covariety is the class of all coalgebraic structures...

algebraic closure is also a finitary closure operator, and in general it is different from the operator mentioned before. Finitary closure operators that generalize...

In mathematics, a finitary relation over a sequence of sets X1, ..., Xn is a subset of the Cartesian product X1 × ... × Xn; that is, it is a set of n-tuples...

considered, in which case the "usual" operations of finite arity are called finitary operations. A partial operation is defined similarly to an operation, but...

are finitary consistency proofs of strong theories is difficult to answer, mainly because there is no generally accepted definition of a "finitary proof"...

theory, an additive category is a preadditive category C admitting all finitary biproducts. There are two equivalent definitions of an additive category:...

and formal logic: Predicate (mathematical logic) Propositional function Finitary relation, or n-ary predicate Boolean-valued function Syntactic predicate...

complete. Notions of compactness and completeness that are equivalent in finitary logic sometimes are not so in infinitary logics. Therefore for infinitary...

In mathematics, a Boolean function is a function whose arguments and result assume values from a two-element set (usually {true, false}, {0,1} or {-1,1})...