infinitary

(redirected from Finitary)
Also found in: Wikipedia.

infinitary

(ɪnˈfɪnɪtərɪ)
(Logic) logic pertaining or involving the concept of infinity
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
References in periodicals archive ?
They cover the construction of finitary PL-homeomorphisms, generating sets, the subgroup of bounded homeomorphisms B, presentations, and isomorphisms and automorphism groups.
Szlachanyi, Finitary Galois extensions over noncommutative bases, J.
When the underlying space S is a sofic shift and d = 1, that is, the potential function is finitary real valued, there raises a natural equilibrium measure called semigroup measure proposed by Kitchens and Tuncel .
A partial order D = (D, [subset or equal to]) is called finitary if and only if [for all]p, d [member of] P(D): {d [member of] D | d [subset or equal to] p} is finite.
Further, (W, [[less than or equal to].sub.S]) is finitary meaning that every closed interval of (W, [[less than or equal to].sub.S]) is finite.
Objects that are in a certain sense of "finitary" nature are intuitively graspable, "real." That includes, for instance, finite strings of symbols that one would write down in the course of proving a theorem.
Godel's plan was to reduce the consistency of analysis to the consistency of number theory and then to prove the consistency of number theory by finitary (1) means as Hilbert recommended (Feferman, 2006a).
finitary terms." (307) Rather than relying on unconscious
75-76), Turing justifies these restrictions by reference to the finitary nature of human cognition, either in memory or in terms of the (necessarily finite) number of possible "states of mind"; (4) similarly, he supposes that we can distinguish between at most finitely many "mental states;" accordingly, it is necessary that a Turing machine can have only finitely many distinct states or operative configurations, and that its total "program" can be specified by a finite string of symbols.
"Finitary Models of Language Users," in Handbook of Mathematical Psychology.
Christophe Reutenaur gave the first five lectures, on Christoffel words, which are finitary versions of Sturmian sequences.
Site: Follow: Share:
Open / Close