A formal system is an
abstract structure used for inferring
theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system.
A formal system is essentially an "
axiomatic system".
In 1921,
David Hilbert proposed to use such a system as the foundation for the knowledge in
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
. A formal system may represent a well-defined
system of abstract thought.
The term ''formalism'' is sometimes a rough synonym for ''formal system'', but it also refers to a given style of
notation, for example,
Paul Dirac's
bra–ket notation.
Background
Each formal system is described by primitive
symbols (which collectively form an
alphabet
An alphabet is a standardized set of basic written graphemes (called letters) that represent the phonemes of certain spoken languages. Not all writing systems represent language in this way; in a syllabary, each character represents a syllab ...
) to finitely construct a
formal language from a set of
axioms through inferential
rules of formation.
The system thus consists of valid formulas built up through finite combinations of the primitive symbols—combinations that are formed from the axioms in accordance with the stated rules.
More formally, this can be expressed as the following:
# A finite set of symbols, known as the alphabet, which concatenate formulas, so that a formula is just a finite string of symbols taken from the alphabet.
# A
grammar
In linguistics, the grammar of a natural language is its set of structural constraints on speakers' or writers' composition of clauses, phrases, and words. The term can also refer to the study of such constraints, a field that includes doma ...
consisting of rules to form formulas from simpler formulas. A formula is said to be
well-formed if it can be formed using the rules of the formal grammar. It is often required that there be a decision procedure for deciding whether a formula is well-formed.
# A set of axioms, or
axiom schemata, consisting of well-formed formulas.
# A set of
inference rules
In the philosophy of logic, a rule of inference, inference rule or transformation rule is a logical form consisting of a function which takes premises, analyzes their syntax, and returns a conclusion (or conclusions). For example, the rule of ...
. A well-formed formula that can be inferred from the axioms is known as a theorem of the formal system.
Recursive
A formal system is said to be
recursive (i.e. effective) or recursively enumerable if the set of axioms and the set of inference rules are
decidable sets or
semidecidable sets, respectively.
Inference and entailment
The
entailment of the system by its logical foundation is what distinguishes a formal system from others which may have some basis in an abstract model. Often the formal system will be the basis for or even identified with a larger
theory
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may ...
or field (e.g.
Euclidean geometry) consistent with the usage in modern mathematics such as
model theory.
Formal language
A
formal language is a language that is defined by a formal system. Like languages in
linguistics
Linguistics is the scientific study of human language. It is called a scientific study because it entails a comprehensive, systematic, objective, and precise analysis of all aspects of language, particularly its nature and structure. Ling ...
, formal languages generally have two aspects:
* the
syntax
In linguistics, syntax () is the study of how words and morphemes combine to form larger units such as phrases and sentences. Central concerns of syntax include word order, grammatical relations, hierarchical sentence structure ( constituenc ...
of a language is what the language looks like (more formally: the set of possible expressions that are valid utterances in the language) studied in
formal language theory
* the
semantics
Semantics (from grc, σημαντικός ''sēmantikós'', "significant") is the study of reference, meaning, or truth. The term can be used to refer to subfields of several distinct disciplines, including philosophy, linguistics and comput ...
of a language are what the utterances of the language mean (which is formalized in various ways, depending on the type of language in question)
In
computer science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...
and
linguistics
Linguistics is the scientific study of human language. It is called a scientific study because it entails a comprehensive, systematic, objective, and precise analysis of all aspects of language, particularly its nature and structure. Ling ...
usually only the syntax of a formal language is considered via the notion of a
formal grammar. A formal grammar is a precise description of the syntax of a formal language: a
set
Set, The Set, SET or SETS may refer to:
Science, technology, and mathematics Mathematics
*Set (mathematics), a collection of elements
*Category of sets, the category whose objects and morphisms are sets and total functions, respectively
Electro ...
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 (or reductive grammar,) 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.
In
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a formal language is usually not described by a formal grammar but by (a) natural language, such as English. Logical systems are defined by both a deductive system and natural language. Deductive systems in turn are only defined by natural language (see below).
Deductive system
A ''deductive system'', also called a ''deductive apparatus'' or a ''logic'', consists of the
axioms (or
axiom schemata) and
rules of inference that can be used to
derive theorems of the system.
Such deductive systems preserve
deductive qualities in the
formulas that are expressed in the system. Usually the quality we are concerned with is
truth
Truth is the property of being in accord with fact or reality.Merriam-Webster's Online Dictionarytruth 2005 In everyday language, truth is typically ascribed to things that aim to represent reality or otherwise correspond to it, such as belief ...
as opposed to falsehood. However, other
modalities, such as
justification or
belief
A belief is an attitude that something is the case, or that some proposition is true. In epistemology, philosophers use the term "belief" to refer to attitudes about the world which can be either true or false. To believe something is to tak ...
may be preserved instead.
In order to sustain its deductive integrity, a ''deductive apparatus'' must be definable without reference to any
intended interpretation of the language. The aim is to ensure that each line of a
derivation is merely a
syntactic consequence of the lines that precede it. There should be no element of any
interpretation
Interpretation may refer to:
Culture
* Aesthetic interpretation, an explanation of the meaning of a work of art
* Allegorical interpretation, an approach that assumes a text should not be interpreted literally
* Dramatic Interpretation, an event ...
of the language that gets involved with the deductive nature of the system.
An example of deductive system is
first order predicate logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantif ...
.
Logical system
A ''logical system'' or ''language'' (not be confused with the kind of "formal language" discussed above which is described by a formal grammar), is a deductive system (see section above; most commonly
first order predicate logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantif ...
) together with additional (non-logical) axioms. According to
model theory, a logical system may be given one or more
semantics
Semantics (from grc, σημαντικός ''sēmantikós'', "significant") is the study of reference, meaning, or truth. The term can be used to refer to subfields of several distinct disciplines, including philosophy, linguistics and comput ...
or
interpretation
Interpretation may refer to:
Culture
* Aesthetic interpretation, an explanation of the meaning of a work of art
* Allegorical interpretation, an approach that assumes a text should not be interpreted literally
* Dramatic Interpretation, an event ...
s which describe whether a well-formed formula is satisfied by a given structure. A structure that satisfies all the axioms of the formal system is known as a
model of the logical system. A logical system is
sound
In physics, sound is a vibration that propagates as an acoustic wave, through a transmission medium such as a gas, liquid or solid.
In human physiology and psychology, sound is the ''reception'' of such waves and their ''perception'' by ...
if each well-formed formula that can be inferred from the axioms is satisfied by every model of the logical system. Conversely, a logic system is (semantically)
complete
Complete may refer to:
Logic
* Completeness (logic)
* Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable
Mathematics
* The completeness of the real numbers, which implies t ...
if each well-formed formula that is satisfied by every model of the logical system can be inferred from the axioms.
An example of a logical system is
Peano arithmetic. The standard model of arithmetic sets the
domain of discourse to be the
nonnegative integers and gives the symbols their usual meaning.
There are also
non-standard models of arithmetic.
History
Early logic systems includes Indian logic of
Pāṇini
, era = ;;6th–5th century BCE
, region = Indian philosophy
, main_interests = Grammar, linguistics
, notable_works = ' ( Classical Sanskrit)
, influenced=
, notable_ideas= Descriptive linguistics
(Devana ...
, syllogistic logic of Aristotle, propositional logic of Stoicism, and Chinese logic of
Gongsun Long (c. 325–250 BCE) . In more recent times, contributors include
George Boole,
Augustus De Morgan, and
Gottlob Frege.
Mathematical logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of forma ...
was developed in 19th century
Europe
Europe is a large peninsula conventionally considered a continent in its own right because of its great physical size and the weight of its history and traditions. Europe is also considered a Continent#Subcontinents, subcontinent of Eurasia ...
.
Formalism
Hilbert's program
David Hilbert instigated a formalist movement that was eventually tempered by
Gödel's incompleteness theorems.
QED manifesto
The QED manifesto represented a subsequent, as yet unsuccessful, effort at formalization of known mathematics.
Examples
Examples of formal systems include:
*
Lambda calculus
*
Predicate calculus
*
Propositional calculus
Variants
The following systems are variations of formal systems.
Proof system
Formal proofs are sequences of
well-formed formulas (or wff for short). 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
Formalism may refer to:
* Form (disambiguation)
* Formal (disambiguation)
* Legal formalism, legal positivist view that the substantive justice of a law is a question for the legislature rather than the judiciary
* Formalism (linguistics)
* Scien ...
''.
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 a 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
In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm wheth ...
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.
See also
*
Formal method
*
Formal science
*
Rewriting system
*
Substitution instance
*
Theory (mathematical logic)
References
Further reading
*
Raymond M. Smullyan
Raymond Merrill Smullyan (; May 25, 1919 – February 6, 2017) was an American mathematician, magician, concert pianist, logician, Taoist, and philosopher.
Born in Far Rockaway, New York, his first career was stage magic. He earned a BSc from t ...
, 1961. ''Theory of Formal Systems: Annals of Mathematics Studies'', Princeton University Press (April 1, 1961) 156 pages
*
Stephen Cole Kleene, 1967. ''Mathematical Logic'' Reprinted by Dover, 2002.
*
Douglas Hofstadter, 1979. ''
Gödel, Escher, Bach: An Eternal Golden Braid'' . 777 pages.
External links
*
* Encyclopædia Britannica
Formal systemdefinition, 2007.
Some quotes from John Haugeland's `Artificial Intelligence: The Very Idea' (1985), pp. 48–64.
* Peter Suber
, 1997.
{{DEFAULTSORT:Formal System
Metalogic
Syntax (logic)
System
A system is a group of interacting or interrelated elements that act according to a set of rules to form a unified whole. A system, surrounded and influenced by its environment, is described by its boundaries, structure and purpose and express ...
1st-millennium BC introductions
4th century BC in India