Definitions

from The American Heritage® Dictionary of the English Language, 4th Edition

  • adj. Combinative.
  • adj. Combinatorial.

from Wiktionary, Creative Commons Attribution/Share-Alike License

  • adj. Of, relating to, or derived from a combination or combinations; combinative or combinatorial.
  • adj. Having the ability to combine; combinable, combinational or combining.

from the GNU version of the Collaborative International Dictionary of English

  • adj. same as combinatorial, 1.
  • adj. able to be combined.
  • adj. same as combinatorial, 2.

from The Century Dictionary and Cyclopedia

  • Same as combinative.

from WordNet 3.0 Copyright 2006 by Princeton University. All rights reserved.

  • adj. marked by or relating to or resulting from combination
  • adj. able to or tending to combine
  • adj. relating to or involving combinations

Etymologies

combine +‎ -atory (Wiktionary)

Examples

  • This is called the combinatory method and it is a fully accepted part of the mainstream linguist's toolkit.

    Archive 2007-03-01

  • K} is called a combinatory base, that is, these two combinators are the undefined constants of CL ‰¥.

    Combinatory Logic

  • Likewise chimps make tools, but don't make tools to make tools, and they have a fixed set of vocalizations rather than a combinatory language.

    Economics and Evolution, Arnold Kling | EconLog | Library of Economics and Liberty

  • Note 155: Mary Carruthers tempers Frances Yates's perception of hermetic practices in Lull's combinatory wheels, stating that they "were a common feature of the medieval elementary classroom, precisely for the purpose of memory training."

    Architecture and Memory: The Renaissance Studioli of Federico da Montefeltro

  • Curry had observed in his work on combinatory logic in the late 1950's the analogy between implication elimination in natural deduction and functional application.

    Chores

  • It is a hyperreal, produced from a radiating synthesis of combinatory models in a hyperspace without atmosphere.

    Archive 2008-08-01

  • The above correspondence can be modified for other implicational logics and combinatory bases.

    Combinatory Logic

  • Notice that the numbers in the present representation are terms over a more restricted combinatory base than in the former case.

    Combinatory Logic

  • If a combinatory term M is typable (with simple types) then M strongly normalizes, that is, all reduction sequences of M are finite (i.e., terminate).

    Combinatory Logic

  • The problem of inhabitation does not have a similar general solution, because the problem of the equality of combinatory terms is undecidable.

    Combinatory Logic

Comments

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