infix

  • 101Reduplication — in linguistics is a morphological process in which the root or stem of a word (or part of it) is repeated exactly or with a slight change. Reduplication is used in inflections to convey a grammatical function, such as plurality, intensification,… …

    Wikipedia

  • 102Expletive infixation — is a process by which an expletive or profanity is inserted into a word, usually for intensification. It is similar to tmesis, but not all instances are covered by the usual definition of tmesis because the words are not necessarily compounds.… …

    Wikipedia

  • 103Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… …

    Wikipedia

  • 104Operator (programming) — Programming languages generally support a set of operators that are similar to operations in mathematics. A language may contain a fixed number of built in operators (e.g. + * = in C and C++), or it may allow the creation of programmer defined… …

    Wikipedia

  • 105Indonesian slang — ( bahasa gaul or bahasa prokem ) is an informal language of Indonesia primarily spoken in urban areas. HistoryIndonesian slang is the informal version of Indonesian. Despite its direct origins, Indonesian slang often differs quite significantly… …

    Wikipedia

  • 106Robinson arithmetic — In mathematics, Robinson arithmetic, or Q, is a finitely axiomatized fragment of Peano arithmetic (PA), first set out in Robinson (1950). Q is essentially PA without the axiom schema of induction. Even though Q is much weaker than PA, it is still …

    Wikipedia

  • 107Whitehead's point-free geometry — In mathematics, point free geometry is a geometry whose primitive ontological notion is region rather than point. Two axiomatic systems are set out below, one grounded in mereology, the other in mereotopology and known as connection theory… …

    Wikipedia

  • 108Converse nonimplication — In logic, converse nonimplication is a logical connective which is the negation of the converse of implication. Contents 1 Definition 1.1 Truth table 1.2 Venn diagram …

    Wikipedia

  • 109CGOL — Infobox programming language name = CGOL paradigm = procedural, imperative, structured year = 1976 designer = Vaughan Pratt developer = latest release version = latest release date = latest test version = latest test date = typing =… …

    Wikipedia

  • 110Aspekthomonym — ist ein Fachbegriff aus der russischen Grammatik. Es handelt sich um Verben, bei denen der Verbstamm in der vollendeten und in der unvollendeten Form (fachsprachlich: im perfektiven und im imperfektiven Aspekt) gleich lautet, also ein Homonym ist …

    Deutsch Wikipedia