Well-formed Formula: Formal Language, Mathematical Logic, Computer Science, Abstraction, Formation Rule, Formal Grammar, Type-token Distinction, Proposition, Propositional Calculus, Syntax (logic) - Couverture souple

Couverture souple

ISBN 10 : 6130365020 ISBN 13 : 9786130365028

Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the formal languages used in mathematical logic and computer science, a well-formed formula or simply formula (often abbreviated wff, pronounced wiff" or "wuff") is an idea, abstraction or concept which is expressed using the symbols and formation rules (also called the formal grammar) of a particular formal language. To say that a string of symbols S is a wff with respect to a given formal grammar G is equivalent to saying that S belongs to the language generated by G. A formal language can be identified with the set of its wffs. Although the term "well-formed formula" is commonly used to refer to the written marks, for instance, on a piece of paper or chalkboard which are being used to express an idea it is more precisely understood as the idea being expressed and the marks as a token instance of the well formed formula. Two different strings of marks may be tokens of the same well-formed formula. This is to say that there may be many different formulations of the same the idea."

Détails de l'édition

• Éditeur: Betascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6130365020
• ISBN 13: 9786130365028
• Reliure: Broché
• Nombre de pages: 96
• Éditeur: Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible