Editing Free object (section)

===General case===
In the general case, the algebraic relations need not be associative, in which case the starting point is not the set of all words, but rather, strings punctuated with parentheses, which are used to indicate the non-associative groupings of letters. Such a string may equivalently be represented by a [[binary tree]] or a [[free magma]]; the leaves of the tree are the letters from the alphabet.

The algebraic relations may then be general [[arity|arities]] or [[finitary relation]]s on the leaves of the tree. Rather than starting with the collection of all possible parenthesized strings, it can be more convenient to start with the [[Herbrand universe]]. Properly describing or enumerating the contents of a free object can be easy or difficult, depending on the particular algebraic object in question. For example, the free group in two generators is easily described. By contrast, little or nothing is known about the structure of [[free Heyting algebra]]s in more than one generator.<ref>Peter T. Johnstone, ''Stone Spaces'', (1982) Cambridge University Press, {{ISBN|0-521-23893-5}}. ''(A treatment of the one-generator free Heyting algebra is given in chapter 1, section 4.11)''</ref> The problem of determining if two different strings belong to the same equivalence class is known as the [[word problem (mathematics)|word problem]].

As the examples suggest, free objects look like constructions from [[syntax]]; one may reverse that to some extent by saying that major uses of syntax can be explained and characterised as free objects, in a way that makes apparently heavy 'punctuation' explicable (and more memorable).{{Clarify|date=May 2017}}