from Wiktionary, Creative Commons Attribution/Share-Alike License.

  • adjective Of a function, taking a finite number of arguments to produce an output.


Sorry, no etymologies found.


Help support Wordnik (and make this page ad-free) by adopting the word finitary.


  • Fully spelled out it means that for an entity to be a proposition there must exist a dialogue game associated with this entity, i.e., the proposition A, such that an individual play of the game where A occupies the initial position, i.e., a dialogue D (A) about A, reaches a final position with either win or loss after a finite number of moves according to definite rules: the dialogue game is defined as a finitary open two-person zero-sum game.

    Dialogical Logic Keiff, Laurent 2009

  • This result is still not fully "finitary" because it deals with a sequence of finite structures, rather than with a single finite structure.

    What's new 2009

  • By Gödel's and Gentzen's result, already intuitionistic arithmetic contained principles that went beyond finitary reasoning.

    Chores 2009

  • The algebraic strength of GEM, and of its weaker finitary and infinitary variants, is worth emphasizing, but it also reflects substantive mereological postulates whose philosophical underpinnings leave room for controversy.

    Wild Dreams Of Reality, 3 2009

  • For Hilbert, the aims were a complete clarification of the foundational problems through finitary proofs of consistency, etc, aims in which proof theory failed.

    Chores 2009

  • It can be checked that all these generalized formulations include the corresponding finitary principles as special cases, taking ˜Ï†w™ to be the formula ˜w = x

    Wild Dreams Of Reality, 3 2009

  • Gödel had, it seems, not thought of giving a consistency proof of arithmetic through the use of non-finitary but still constructive principles.

    Chores 2009

  • So when intuitionists deny that the Law of Excluded Middle holds in non-finitary contexts, they are actually taking truth as provability; and when paraconsistentists claim that some formula can be true (in some weird circumstances) together with its negation, they are not talking of negation anymore (see e.g. Berto 2006).

    Impossible Worlds Berto, Francesco 2009

  • Then, of course, the unexpected happened when Gödel proved the impossibility of a complete formalization of elementary arithmetic, and, as it was soon interpreted, the impossibility of proving the consistency of arithmetic by finitary means, the only ones judged “absolutely reliable” by Hilbert.

    Chores 2009

  • An initial and rough answer to this last question is contained in our discussion so far: Dedekind's approach is set-theoretic and infinitary, while Kronecker's is constructivist and finitary.

    Dedekind's Contributions to the Foundations of Mathematics Reck, Erich 2008


Log in or sign up to get involved in the conversation. It's quick and easy.