Editing Syntax (logic) (section)

{{short description|Rules used for constructing, or transforming the symbols and words of a language}}
[[File:Formal languages.svg|thumb|300px|right|This diagram shows the syntactic entities which may be constructed from [[formal language]]s.<ref>[http://dictionary.reference.com/browse/syntax Dictionary Definition]</ref> The [[symbol (formal)|symbols]] and [[string (computer science)|strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language is identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into [[theorem]]s and non-theorems.]]
{{Formal languages}}
In [[logic]], '''syntax''' is anything having to do with [[formal language]]s or [[formal system]]s without regard to any [[interpretation (logic)|interpretation]] or [[meaning (linguistics)|meaning]] given to them. Syntax is concerned with the rules used for constructing, or transforming the symbols and words of a language, as contrasted with the [[Formal semantics (logic)|semantics]] of a language which is concerned with its meaning.

The [[symbol (formal)|symbols]], [[well-formed formula|formulas]], [[formal system|system]]s, [[theorem]]s and [[formal proof|proofs]] expressed in formal languages are syntactic entities whose properties may be studied without regard to any meaning they may be given, and, in fact, need not be given any.

Syntax is usually associated with the rules (or grammar) governing the composition of texts in a formal language that constitute the [[well-formed formula]]s of a formal system.

In [[computer science]], the term ''[[Syntax (programming languages)|syntax]]'' refers to the rules governing the composition of well-formed [[Expression (mathematics)|expressions]] in a [[programming language]]. As in mathematical logic, it is independent of semantics and interpretation.