-
1 HAND-FULL
maqua (dual maquat is attested). Colloquially, the word maqua is also used for the "hand" itself (called má in formal language); maqua may refer to the "complete hand with all five fingers", and the word is therefore also used for a group of 5 similar things (just like the dual maquat may refer to a group of 10 similar things; see FIVE, TEN). –VT47:7
См. также в других словарях:
Formal Language — Formal Language, formale Sprache … Universal-Lexikon
Formal language — A formal language is a set of words , i.e. finite strings of letters , or symbols . The inventory from which these letters are taken is called the alphabet over which the language is defined. A formal language is often defined by means of a… … Wikipedia
formal language — See formal system, logical calculus … Philosophy dictionary
formal language — noun A set of finite strings (called sentences) over a specified finite alphabet … Wiktionary
List of formal language and literal string topics — This is a list of formal language and literal string topics, by Wikipedia page. Contents 1 Formal languages 2 Literal strings 3 Classical cryptography Formal languages Abstract syntax tree … Wikipedia
Language merger — Language merger, in linguistics, is a theoretical phenomenon whereby two or more distinct languages combine to form a single language. It is a controversial concept among linguists, who are divided over whether it represents an actual phenomenon … Wikipedia
Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… … Wikipedia
Formal system — In formal logic, a formal system (also called a logical system,Audi, Robert (Editor). The Cambridge Dictionary of Philosophy . Second edition, Cambridge University Press, 1999. ISBN 978 0521631365 (hardcover) and ISBN 978 0521637220 (paperback).] … Wikipedia
Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… … Wikipedia
Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… … Wikipedia
Language — This article is about the properties of language in general. For other uses, see Language (disambiguation). Cuneiform is one of the first known forms of written language, but spoken language is believed to predate writing by tens of thousands of… … Wikipedia
