Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Well-formed Formula
CHF 43.15
Auf Lager
SKU
AEVSPK33EGE
1 Verfügbar 
Geliefert zwischen Mi., 28.01.2026 und Do., 29.01.2026
Details
High Quality Content by WIKIPEDIA articles! 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.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130365028
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T6mm
- Jahr 2010
- EAN 9786130365028
- Format Fachbuch
- ISBN 978-613-0-36502-8
- Titel Well-formed Formula
- Untertitel Formal Language, Mathematical Logic, Computer Science, Abstraction, Formation Rule, Formal Grammar, Type-token Distinction, Proposition, Propositional Calculus, Syntax (logic)
- Gewicht 161g
- Herausgeber VDM Verlag Dr. Müller e.K.
- Anzahl Seiten 96
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
