Formal system

Formal system

In formal logic, a formal system (also called a logical system,Audi, Robert (Editor). "The Cambridge Dictionary of Philosophy". Second edition, Cambridge University Press, 1999. ISBN 978-0521631365 (hardcover) and ISBN 978-0521637220 (paperback).] a logistic system, a logical calculus, [Rudolf Carnap. "Introduction to Symbolic Logic and its Applications",Dover, 1958. p. 101.] or simply a logic) consists of a formal language together with a deductive system (also called a "deductive apparatus") which consists of a set of inference rules and/or axioms. A formal system is used to derive one expression from one or more other expressions antecedently expressed in the system. These expressions are called axioms, in the case of those previously supposed to be true, or theorems, in the case of those derived. A formal system may be formulated and studied for its intrinsic properties, or it may be intended as a description (i.e. a model) of external phenomena.


Each formal system has a formal language, which is composed by primitive symbols. These symbols act on certain rules of formation and are developed by inference from a set of axioms. The system thus consists of any number of formulas built up through finite combinations of the primitive symbols—combinations that are formed from the axioms in accordance with the stated rules. [ Encyclopædia Britannica, [ Formal system] definition, 2007.]

Formal systems in mathematics consist of the following elements:
# A finite set of symbols (i.e. the alphabet), that can be used for constructing formulas (i.e. finite strings of symbols).
# A grammar, which tells how well-formed formulas (abbreviated "wff") are constructed out of the symbols in the alphabet. It is usually required that there be a decision procedure for deciding whether a formula is well formed or not.
# A set of axioms or axiom schemata: each axiom must be a wff.
# A set of inference rules.

A formal system is said to be recursive (i.e. effective) if the set of axioms and the set of inference rules are decidable sets or semidecidable sets, according to context.

Some theorists use the term "formalism" as a rough synonym for "formal system", but the term is also used to refer to a particular style of "notation", for example, Paul Dirac's bra-ket notation.

Related subjects

Formal language

A formal language is a set "A" of strings (finite sequences) on a fixed alphabet α.

Formal grammar

In computer science and linguistics a formal grammar is a precise description of a formal language: a set of strings. The two main categories of formal grammar are that of generative grammars, which are sets of rules for how strings in a language can be generated, and that of analytic grammars, which are sets of rules for how a string can be analyzed to determine whether it is a member of the language. In short, an analytic grammar describes how to "recognize" when strings are members in the set, whereas a generative grammar describes how to "write" only those strings in the set.

Formal proofs

Formal proofs are sequences of wffs. For a wff to qualify as part of a proof, it might either be an axiom or be the product of applying an inference rule on previous wffs in the proof sequence. The last wff in the sequence is recognized as a theorem.

The point of view that generating formal proofs is all there is to mathematics is often called "formalism". David Hilbert founded metamathematics as a discipline for discussing formal systems. Any language that one uses to talk about a formal system is called a "metalanguage". The metalanguage may be nothing more than ordinary natural language, or it may be partially formalized itself, but it is generally less completely formalized than the formal language component of the formal system under examination, which is then called the "object language", that is, the object of the discussion in question.

Once a formal system is given, one can define the set of theorems which can be proved inside the formal system. This set consists of all wffs for which there is a proof. Thus all axioms are considered theorems. Unlike the grammar for wffs, there is no guarantee that there will be a decision procedure for deciding whether a given wff is a theorem or not. The notion of "theorem" just defined should not be confused with "theorems about the formal system", which, in order to avoid confusion, are usually called metatheorems.

Formal interpretations

A "formal interpretation" of a formal system is the assignment of meanings, to the symbols, and truth-values to the sentences of the formal system. The study of formal interpretations is called Formal semantics. "Giving an interpretation" is synonymous with "constructing a model.

An "interpreted formal system" is a formal language for which both syntactical rules for deduction, and semantical rules of interpretation are given. An "interpreted formal system" can be expressed as the ordered quadruple <α,mathcal{I},mathcal{D}d,mathcal{D}>. Where, in the case of extensional metalanguages, mathcal{D} is the relation of value assignment for the sentences of the language and in the case of intensional metalanguages, it is relation of designation, i.e., the relation between an expression and its intension; and where mathcal{D}d is the relation of direct derivability. This relation is understood in a comprehensive sense such that the primitive sentences of the formal system are taken as directly derivable from the empty set of sentences. Here axioms are stated, some similar to those stated for a formal system, and some like those for an interpreted formal language. Usually, we wish for mathcal{D}d to be truth-preserving (that is, any sentence which is directly derivable from true sentences is itself true), however other modalities can also preserved in such a system. We can formulate an axiom for these purposes with use of the term "true". For any mathcal{I}i1,...,mathcal{I}in, mathcal{I}j, "p"1,...,"p"n,"q" if mathcal{D}d(mathcal{I}j,{mathcal{I}i1,...,mathcal{I}in}), mathcal{D}(mathcal{I}i1,"p"1) and ... and mathcal{D}(mathcal{I}in,"p"n) and "p"1 and ... and "p"n, "q".

For "interpreted formal systems" there are also alternative, more explicit definitions which include ds, or both ds and D, analogous to those given for interpreted formal languages.


Further reading

* Raymond M. Smullyan, "Theory of Formal Systems: Annals of Mathematics Studies", Princeton University Press (April 1, 1961) 156 pages ISBN 069108047X
* S. C. Kleene, 1967. "Mathematical Logic" Reprinted by Dover, 2002. ISBN 0486425339

See also

;Examples of formal systems
* Axiomatic system
* Proof calculus
* Formal ethics
* Lambda calculus
* Propositional calculus;Other related topics
* Axiom
* Formal
* Formal language
* Formal method
* Formal science
* Gödel's incompleteness theorems
* Institution
* substitution instance

External links

* Encyclopædia Britannica, [ Formal system] definition, 2007.
* Christer Blomqvist, [ a introduction to formal systems] , webpage 1997.
* [ What is a Formal System?] : Some quotes from John Haugeland's `Artificial Intelligence: The Very Idea' (1985), pp. 48-64.
* Heinrich Herre [ Formal Language and systems] , 1997.
* Peter Suber, [ Formal Systems and Machines: An Isomorphism] , 1997.

Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • formal system — In logic, a formal language together with a deductive apparatus by which some well formed formulas can be derived from others. Each formal system has a formal language composed of primitive symbols that figure in certain rules of formation… …   Universalium

  • formal system — noun The grouping of a formal language and a set of inference rules and/or axioms. Syn: logical system, logical calculus, logic …   Wiktionary

  • formal system — (or theory) A theory whose sentences are well formed formulae of a logical calculus, and in which axioms or rules governing particular terms correspond to the principles of the theory being formalized. The theory is said to be couched or framed… …   Philosophy dictionary

  • formal systems — formal system …   Philosophy dictionary

  • Formal interpretation — A formal interpretation [ pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… …   Wikipedia

  • formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction       the abstract study of propositions, statements, or assertively used …   Universalium

  • Formal methods — In computer science and software engineering, formal methods are particular kind of mathematically based techniques for the specification, development and verification of software and hardware systems.cite web|author=R. W. Butler|title=What is… …   Wikipedia

  • Formal proof — See also: mathematical proof, proof theory, and axiomatic system A formal proof or derivation is a finite sequence of sentences (called well formed formulas in the case of a formal language) each of which is an axiom or follows from the… …   Wikipedia

  • Formal — The term formal has a number of uses, including:General*relating to formality *opposite of informalocial* Formal occasion ** Formal attire worn on such occasions ** Formals are particular meals at some British universities ** In Australian or… …   Wikipedia

  • Formal language — A formal language is a set of words , i.e. finite strings of letters , or symbols . The inventory from which these letters are taken is called the alphabet over which the language is defined. A formal language is often defined by means of a… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”