Search results

Jump to navigation Jump to search
  • ...is aphasia which affects all language functions. It is caused by damage to all of the langauge processing components which are situated in the frontal and
    250 bytes (36 words) - 17:29, 29 June 2014
  • ..., or because there is another quantifier already binding the variable (cf. All(x) in (i)b). (i) a All(x) [ P(j) ] & Q(x)
    677 bytes (105 words) - 08:51, 30 August 2014
  • ...redicate logic]], written ''All'', which makes it possible to express that all entities in the [[universe of discourse]] have a particular property. In (i (i) All(x) [ P(x) ]
    740 bytes (106 words) - 16:46, 24 August 2014
  • (i) for all X,Y subset E: (X in Q and Y in Q) <=> intersection(X,Y) in Q ''All'' N, ''both'' N and ''the'' N are examples of filters, but ''some'' N and '
    1 KB (188 words) - 16:20, 29 June 2014
  • ...term that is used to refer the relation obtaining between a [[quantifier]] All(''v'') or Exists(''v'') and the occurrences of the [[variable]] ''v'' in it (i) All(''v'')[ ... ''v'' ... ]
    1 KB (191 words) - 00:25, 5 August 2021
  • ''all, both'' (e.g. ''all the children'', ''both these houses'')
    450 bytes (56 words) - 19:13, 20 July 2014
  • ...of being right [[upward monotonicity|upward monotone]] if and only if for all subsets X and Y of the domain of entities E condition (i) holds. Right upward monotonicity can be tested as in (ii): ''all'' N is right upward monotone, ''at most two'' N is not.
    1 KB (188 words) - 18:28, 28 September 2014
  • ...a P(x) -> Q(y) is the scope of All(x), but R(x) is outside the scope of All(x). (i) All(x) [ P(x) -> Q(y) ] & R(x)
    2 KB (276 words) - 15:55, 5 October 2014
  • (i) [ All(x) : P(x) ] Q(x) (ii) All(x) [ P(x) -> Q(x) ]
    1 KB (166 words) - 17:32, 28 September 2014
  • ...mmediately became mutable, as exemplified by the expression "the mother of all meteors", which was used by the ''New York Times'' when reporting a spectac ...of possible clauses, exemplifying a broad sort of variable that is not at all uncommon.
    2 KB (275 words) - 19:07, 28 January 2018
  • ...entences in <glref name="first" /> are thematic paraphrases of each other. All contain the same [[agent]] (''the shopkeeper''), the same [[theme]] (''a to
    780 bytes (122 words) - 16:52, 27 July 2014
  • ...o includes writing and reading, as well as thinking; not all thinking, but all that which is linguistically based, that which uses inner speech, the inter
    803 bytes (111 words) - 06:07, 8 October 2017
  • ''scalar implicature''<nowiki>: John did not eat all of the chocolates ...ty, the speaker will only use ''some'' if he is not in a position to use ''all''. Hence, his use of ''some'' implicates that there were chocolates not eat
    2 KB (269 words) - 03:39, 18 May 2009
  • ...fference equations, fuzzy logics and set theory, function theory etc.), on all levels of linguistic analysis.</li> All articles in this journal have undergone rigorous peer review, based on init
    2 KB (224 words) - 07:02, 12 July 2014
  • ...fier]] that is not immediately near the NP it quantifies. French ''tous'' (all) is the exemplary case: All the students have read that book
    894 bytes (131 words) - 08:26, 20 August 2019
  • All complex [[waveform]]s can be described as a number of sine waves. These sep
    349 bytes (47 words) - 16:45, 29 June 2014
  • ...stress''' refers to the one [[stress]] within a word that stands out among all others (the [[secondary stress]]es).
    293 bytes (36 words) - 19:28, 20 July 2014
  • ...s ''improper'' only if it is not proper. If there are no dogs in E, then ''all dogs'', for instance denotes the power set of E, and hence is an improper N
    1 KB (170 words) - 19:13, 27 September 2014
  • All the cavities above the [[larynx]] used as a variable [[resonator]]; include
    509 bytes (71 words) - 15:01, 10 June 2009
  • In a '''paradicmatic relationship''' can all the members of the sets of semantically-related terms occur in the same [[c
    359 bytes (39 words) - 08:13, 20 July 2014

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)