A formal language is a set of strings that are formed from an alphabet such that the elements conform to a grammar or set of formation rules (also known as syntax). Elements of the formal language are called well-formed formulas. Formal languages may have a Deductive system put on top of them to to create a formal system.

Formal definitionEdit

Let \Sigma be an alphabet.

Then a formal language \mathcal{L} is a subset of \Sigma^*, where * is the kleene star operator. 

This article is a stub, please help Philosophy Wiki by improving it. If its finished, please remove this template.

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.