English translation: the formal language of calculus
Login or register (free and only takes a few minutes) to participate in this question.
You will also have access to many other tools and opportunities designed for those who have language-related jobs (or are passionate about them). Participation is free and the site has a strict confidentiality policy.
Explanation: In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is built. Some of the symbols in an alphabet may have a special meaning. The formation rules specify which strings of symbols count as well-formed. The well-formed strings of symbols are also called words, expressions, formulas, or terms. The formation rules are usually recursive. Some rules postulate that such and such expressions belong to the language in question. Some other rules establish how to build well-formed expressions from other expressions belonging to the language. It is assumed that nothing else is a well-formed expression.
For example, the language of propositional calculus could be defined as follows. The alphabet of this language is comprised of English letters with optional indexes and the following special symbols: ¬ (NOT), ^ (AND), v (OR), => (implies), and () (grouping). The formation rules are then that every English letter and every letter with an index is a formula, and if A and B are formulas, then so are ¬A, A v B, A ^ B, A=>B, and (A). http://mathworld.wolfram.com/FormalLanguage.html
Algèbre
Analyse
Informatique
Langage de Calcul Formel
Méthodologie Informatiaque
...etc...
Automatic update in 00:
Answers
3 mins confidence: peer agreement (net): +5
the formal language of calculus
Explanation: In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is built. Some of the symbols in an alphabet may have a special meaning. The formation rules specify which strings of symbols count as well-formed. The well-formed strings of symbols are also called words, expressions, formulas, or terms. The formation rules are usually recursive. Some rules postulate that such and such expressions belong to the language in question. Some other rules establish how to build well-formed expressions from other expressions belonging to the language. It is assumed that nothing else is a well-formed expression.
For example, the language of propositional calculus could be defined as follows. The alphabet of this language is comprised of English letters with optional indexes and the following special symbols: ¬ (NOT), ^ (AND), v (OR), => (implies), and () (grouping). The formation rules are then that every English letter and every letter with an index is a formula, and if A and B are formulas, then so are ¬A, A v B, A ^ B, A=>B, and (A). http://mathworld.wolfram.com/FormalLanguage.html
silviantonia Local time: 15:39 Specializes in field Native speaker of: English, Spanish PRO pts in category: 4
The translation workplace 
peer agreement (net): +5