Formal systems
this wiki
Ad blocker interference detected!
Wikia is a freetouse 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.
Assessment 
Biopsychology 
Comparative 
Cognitive 
Developmental 
Language 
Individual differences 
Personality 
Philosophy 
Social 
Methods 
Statistics 
Clinical 
Educational 
Industrial 
Professional items 
World psychology 
Philosophy Index: Aesthetics · Epistemology · Ethics · Logic · Metaphysics · Consciousness · Philosophy of Language · Philosophy of Mind · Philosophy of Science · Social and Political philosophy · Philosophies · Philosophers · List of lists
In formal logic, a formal system (also called a logical calculus^{[citation needed]}) consists of a formal language and a set of inference rules, used to derive (to conclude) an expression from one or more other premises that are antecedently supposed (axioms) or derived (theorems). The axioms and rules may be called a deductive apparatus. 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.
Overview Edit
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.^{[1]}
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 wellformed 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 braket notation.
Related subjects Edit
Logical system Edit
A logical system or, for short, logic, is a formal system together with a form of semantics, usually in the form of modeltheoretic interpretation, which assigns truth values to sentences of the formal language, that is, formulae that contain no free variables. A logic is sound if all sentences that can be derived are true in the interpretation, and complete if, conversely, all true sentences can be derived.
Formal proofs Edit
 Main article: Proof theory
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 language Edit
 Main article: Formal language
In mathematics, logic, and computer science, a formal language is a language that is defined by precise mathematical or machine processable formulas. Like languages in linguistics, formal languages generally have two aspects:
 the syntax of a language is what the language looks like (more formally: the set of possible expressions that are valid utterances in the language)
 the semantics 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)
A special branch of mathematics and computer science exists that is devoted exclusively to the theory of language syntax: formal language theory. In formal language theory, a language is nothing more than its syntax; questions of semantics are not included in this specialty.
Formal grammar Edit
 Main article: 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.
See also Edit

ReferencesEdit
 ↑ Encyclopædia Britannica, Formal system definition, 2007.
Further reading Edit
 Raymond M. Smullyan, 1961. 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
 Douglas Hofstadter, 1979,. Gödel, Escher, Bach: An Eternal Golden Braid ISBN 9780465026562. 777 pages.
External linksEdit
Look up this page on
Wiktionary:
formalisation
 Encyclopædia Britannica, Formal system definition, 2007.
 Christer Blomqvist, an 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.
Global structure in Systems, Systems theories and Systems scientists
 

Categories  Category:Systems · Category:Conceptual systems · Physical systems 
Articles  System · Conceptual systems · Information systems · Physical systems 
Fields of theory  Catastrophe theory · Chaos theory · Complex adaptive system · Complex systems · Cybernetics ·Multiagent system ·Systems biology · Systems engineering · Systems theory 
Systems scientists  William Ross Ashby · Ludwig von Bertalanffy · Kenneth E. Boulding · C. West Churchman · Heinz von Foerster · Charles François · Jay Forrester · Niklas Luhmann · Warren McCulloch · Humberto Maturana · Talcott Parsons · Ilya Prigogine · Anatol Rapoport · Francisco Varela · Norbert Wiener 