Metalanguage

Last updated

In logic and linguistics, a metalanguage is a language used to describe another language, often called the object language. [1] Expressions in a metalanguage are often distinguished from those in the object language by the use of italics, quotation marks, or writing on a separate line.[ citation needed ] The structure of sentences and phrases in a metalanguage can be described by a metasyntax. [2] For example, to say that the word "noun" can be used as a noun in a sentence, one could write "noun" is a <noun>.

Contents

Types of metalanguage

There are a variety of recognized types of metalanguage, including embedded, ordered, and nested (or hierarchical) metalanguages.

Embedded

An embedded metalanguage is a language formally, naturally and firmly fixed in an object language. This idea is found in Douglas Hofstadter's book, Gödel, Escher, Bach , in a discussion of the relationship between formal languages and number theory: "... it is in the nature of any formalization of number theory that its metalanguage is embedded within it." [3]

It occurs in natural, or informal, languages, as well—such as in English, where words such as noun, verb, or even word describe features and concepts pertaining to the English language itself.

Ordered

An ordered metalanguage is analogous to an ordered logic. An example of an ordered metalanguage is the construction of one metalanguage to discuss an object language, followed by the creation of another metalanguage to discuss the first, etc.

Nested

A nested (or hierarchical) metalanguage is similar to an ordered metalanguage in that each level represents a greater degree of abstraction. However, a nested metalanguage differs from an ordered one in that each level includes the one below.

The paradigmatic example of a nested metalanguage comes from the Linnean taxonomic system in biology. Each level in the system incorporates the one below it. The language used to discuss genus is also used to discuss species; the one used to discuss orders is also used to discuss genera, etc., up to kingdoms.

In natural language

Natural language combines nested and ordered metalanguages. In a natural language there is an infinite regress of metalanguages, each with more specialized vocabulary and simpler syntax.

Designating the language now as , the grammar of the language is a discourse in the metalanguage , which is a sublanguage [4] nested within .

Since all of these metalanguages are sublanguages of , is a nested metalanguage, but and sequel are ordered metalanguages. [5] Since all these metalanguages are sublanguages of they are all embedded languages with respect to the language as a whole.

Metalanguages of formal systems all resolve ultimately to natural language, the 'common parlance' in which mathematicians and logicians converse to define their terms and operations and 'read out' their formulae. [6]

Types of expressions

There are several entities commonly expressed in a metalanguage. In logic usually the object language that the metalanguage is discussing is a formal language, and very often the metalanguage as well.

Deductive systems

A deductive system (or, deductive apparatus of a formal system) consists of the axioms (or axiom schemata) and rules of inference that can be used to derive the theorems of the system. [7]

Metavariables

A metavariable (or metalinguistic or metasyntactic variable) is a symbol or set of symbols in a metalanguage which stands for a symbol or set of symbols in some object language. For instance, in the sentence:

Let A and B be arbitrary formulas of a formal language .

The symbols A and B are not symbols of the object language , they are metavariables in the metalanguage (in this case, English) that is discussing the object language .

Metatheories and metatheorems

A metatheory is a theory whose subject matter is some other theory (a theory about a theory). Statements made in the metatheory about the theory are called metatheorems. A metatheorem is a true statement about a formal system expressed in a metalanguage. Unlike theorems proved within a given formal system, a metatheorem is proved within a metatheory, and may reference concepts that are present in the metatheory but not the object theory. [8]

Interpretations

An interpretation is an assignment of meanings to the symbols and words of a language.

Role in metaphor

Michael J. Reddy (1979) argues that much of the language we use to talk about language is conceptualized and structured by what he refers to as the conduit metaphor. [9] This paradigm operates through two distinct, related frameworks.

The major framework views language as a sealed pipeline between people:

Major framework
StageDescriptionExample
1Language transfers people's thoughts and feelings (mental content) to othersTry to get your thoughts across better
2Speakers and writers insert their mental content into wordsYou have to put each concept into words more carefully
3Words are containersThat sentence was filled with emotion
4Listeners and readers extract mental content from wordsLet me know if you find any new sensations in the poem

The minor framework views language as an open pipe spilling mental content into the void:

Minor framework
StageDescriptionExample
1Speakers and writers eject mental content into an external spaceGet those ideas out where they can do some good
2Mental content is reified (viewed as concrete) in this spaceThat concept has been floating around for decades
3Listeners and readers extract mental content from this spaceLet me know if you find any good concepts in the essay

Metaprogramming

Computers follow programs, sets of instructions in a formal language. The development of a programming language involves the use of a metalanguage. The act of working with metalanguages in programming is known as metaprogramming .

Backus–Naur form, developed in the 1960s by John Backus and Peter Naur, is one of the earliest metalanguages used in computing. Examples of modern-day programming languages which commonly find use in metaprogramming include ML, Lisp, m4, and Yacc.

See also

Dictionaries

Related Research Articles

<span class="mw-page-title-main">Formal language</span> Sequence of words formed by specific rules

In logic, mathematics, computer science, and linguistics, a formal language consists of words whose letters are taken from an alphabet and are well-formed according to a specific set of rules called a formal grammar.

First-order logic—also called predicate logic, predicate calculus, quantificational logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantified variables over non-logical objects, and allows the use of sentences that contain variables. Rather than propositions such as "all men are mortal", in first-order logic one can have expressions in the form "for all x, if x is a man, then x is mortal"; where "for all x" is a quantifier, x is a variable, and "... is a man" and "... is mortal" are predicates. This distinguishes it from propositional logic, which does not use quantifiers or relations; in this sense, propositional logic is the foundation of first-order logic.

In computer science, Backus–Naur form is a notation used to describe the syntax of programming languages or other formal languages. It was developed by John Backus and Peter Naur. BNF can be described as a metasyntax notation for context-free grammars. Backus–Naur form is applied wherever exact descriptions of languages are needed, such as in official language specifications, in manuals, and in textbooks on programming language theory. BNF can be used to describe document formats, instruction sets, and communication protocols.

<span class="mw-page-title-main">Zellig Harris</span> American linguist

Zellig Sabbettai Harris was an influential American linguist, mathematical syntactician, and methodologist of science. Originally a Semiticist, he is best known for his work in structural linguistics and discourse analysis and for the discovery of transformational structure in language. These developments from the first 10 years of his career were published within the first 25. His contributions in the subsequent 35 years of his career include transfer grammar, string analysis, elementary sentence-differences, algebraic structures in language, operator grammar, sublanguage grammar, a theory of linguistic information, and a principled account of the nature and origin of language.

Metalogic is the metatheory of logic. Whereas logic studies how logical systems can be used to construct valid and sound arguments, metalogic studies the properties of logical systems. Logic concerns the truths that may be derived using a logical system; metalogic concerns the truths that may be derived about the languages and systems that are used to express truths.

A formal system is an abstract structure and formalization of an axiomatic system used for deducing, using rules of inference, theorems from axioms by a set of inference rules.

<span class="mw-page-title-main">Syntax (logic)</span> Rules used for constructing, or transforming the symbols and words of a language

In logic, syntax is anything having to do with formal languages or formal systems without regard to any interpretation or 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 semantics of a language which is concerned with its meaning.

Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic".

Meta is an adjective meaning 'more comprehensive' or 'transcending'.

The term predicate is used in two ways in linguistics and its subfields. The first defines a predicate as everything in a standard declarative sentence except the subject, and the other defines it as only the main content verb or associated predicative expression of a clause. Thus, by the first definition, the predicate of the sentence Frank likes cake is likes cake, while by the second definition, it is only the content verb likes, and Frank and cake are the arguments of this predicate. The conflict between these two definitions can lead to confusion.

Metalinguistics is the branch of linguistics that studies language and its relationship to other cultural behaviors. It is the study of how different parts of speech and communication interact with each other and reflect the way people live and communicate together. Jacob L. Mey in his book, Trends in Linguistics, describes Mikhail Bakhtin's interpretation of metalinguistics as "encompassing the life history of a speech community, with an orientation toward a study of large events in the speech life of people and embody changes in various cultures and ages."

A metatheory or meta-theory is a theory on a subject matter that is a theory in itself. Analyses or descriptions of an existing theory would be considered meta-theories. If the subject matter of a theoretical statement consists of one or multiple theories, it would also be called a meta-theory. For mathematics and mathematical logic, a metatheory is a mathematical theory about another mathematical theory. Meta-theoretical investigations are part of the philosophy of science. The topic of metascience is an attempt to use scientific knowledge to improve the practice of science itself.

In logic, a metatheorem is a statement about a formal system proven in a metalanguage. Unlike theorems proved within a given formal system, a metatheorem is proved within a metatheory, and may reference concepts that are present in the metatheory but not the object theory.

Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language. The scope of logic can therefore be very large, ranging from core topics such as the study of fallacies and paradoxes, to specialized analyses of reasoning such as probability, correct reasoning, and arguments involving causality. One of the aims of logic is to identify the correct and incorrect inferences. Logicians study the criteria for the evaluation of arguments.

Philosophy of language investigates the nature of language and the relations between language, language users, and the world. Investigations may include inquiry into the nature of meaning, intentionality, reference, the constitution of sentences, concepts, learning, and thought.

Merge is one of the basic operations in the Minimalist Program, a leading approach to generative syntax, when two syntactic objects are combined to form a new syntactic unit. Merge also has the property of recursion in that it may be applied to its own output: the objects combined by Merge are either lexical items or sets that were themselves formed by Merge. This recursive property of Merge has been claimed to be a fundamental characteristic that distinguishes language from other cognitive faculties. As Noam Chomsky (1999) puts it, Merge is "an indispensable operation of a recursive system ... which takes two syntactic objects A and B and forms the new object G={A,B}" (p. 2).

An interpretation is an assignment of meaning to the symbols of a formal language. Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any meaning until they are given some interpretation. The general study of interpretations of formal languages is called formal semantics.

In mathematical logic, a judgment or assertion is a statement or enunciation in a metalanguage. For example, typical judgments in first-order logic would be that a string is a well-formed formula, or that a proposition is true. Similarly, a judgment may assert the occurrence of a free variable in an expression of the object language, or the provability of a proposition. In general, a judgment may be any inductively definable assertion in the metatheory.

In semantics, a donkey sentence is a sentence containing a pronoun which is semantically bound but syntactically free. They are a classic puzzle in formal semantics and philosophy of language because they are fully grammatical and yet defy straightforward attempts to generate their formal language equivalents. In order to explain how speakers are able to understand them, semanticists have proposed a variety of formalisms including systems of dynamic semantics such as Discourse representation theory. Their name comes from the example sentence "Every farmer who owns a donkey beats it", in which "it" acts as a donkey pronoun because it is semantically but not syntactically bound by the indefinite noun phrase "a donkey". The phenomenon is known as donkey anaphora.

In logic, a metavariable is a symbol or symbol string which belongs to a metalanguage and stands for elements of some object language. For instance, in the sentence

References

  1. 2010. Cambridge Advanced Learner's Dictionary. Cambridge: Cambridge University Press. Dictionary online. Available from http://dictionary.cambridge.org/dictionary/british/metalanguage Internet. Retrieved 20 November 2010
  2. van Wijngaarden, A., et al. "Language and metalanguage." Revised Report on the Algorithmic Language Algol 68. Springer, Berlin, Heidelberg, 1976. 17-35.
  3. Hofstadter, Douglas. 1980. Gödel, Escher, Bach: An Eternal Golden Braid. New York: Vintage Books ISBN   0-14-017997-6
  4. Harris, Zellig S. (1991). A theory of language and information: A mathematical approach . Oxford: Clarendon Press. pp.  272–318. ISBN   978-0-19-824224-6.
  5. Ibid. p. 277.
  6. Borel, Félix Édouard Justin Émile (1928). Leçons sur la theorie des fonctions (in French) (3 ed.). Paris: Gauthier-Villars & Cie. p. 160.
  7. Hunter, Geoffrey (1996) [1971]. Metalogic: An Introduction to the Metatheory of Standard First-Order Logic. University of California Press (published 1973). p. 7. ISBN   9780520023567. OCLC   36312727. ( accessible to patrons with print disabilities )
  8. Ritzer, George. 1991. Metatheorizing in Sociology. New York: Simon Schuster ISBN   0-669-25008-2
  9. Reddy, Michael J. 1979. The conduit metaphor: A case of frame conflict in our language about language. In Andrew Ortony (ed.), Metaphor and Thought. Cambridge: Cambridge University Press