formal language (thing) by pfft

Some examples of formal languages:

The set of binary strings that are the binary representation of a number divisible by 3. This language is regular.
The set of well-formed arithmetic formulas (i.e. with matching parentheses etc). This language is context-free.
The set of tautological (i.e. true) formulas in boolean algebra. This language is recursive.
The set of provable arithmetic formulas (which can contain variables and logical quantifiers.) This language is recursively enumerable.
The set of true arithmetic formulas. This language is undecidable. (hi Gödel!)

Chomsky hierarchy	formal language theory	Semiotics	Searle's Chinese room
NSA: What's a language?	NSA: What's a model?	context-free grammar	formal grammar
On Formally Undecidable Propositions of Principia Mathematica and Related Systems	No rexen for the wildcard	Language	Blow me Sideways on Thursdays: Male Psyche in the Era of Feminism
God made the integers, all else is the work of man	Kleene Closure	context-free language	Boolean algebra
regular language	Prenex and Skolem normal forms	arithmetically definable	Chomsky Normal Form
relational structure	Chas.	recursively enumerable	properly matched string

formal language (thing)

Login
Password