Portal:Logic

From Wikipedia, the free encyclopedia
Jump to: navigation, search
The Logic Portal
a portal for Wikipedia's Logic resources.
Article · Category · List · Outline · WikiProject

Logic

Logic portal.svg

Logic (from Classical Greek λόγος logos; meaning 'speech/word') is the study of the principles and criteria of valid inference and demonstration. The term "logos" was also believed by the Greeks to be the universal power by which all reality was sustained and made coherent and consistent.

As a formal science, logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and through the study of arguments in natural language. The field of logic ranges from core topics such as the study of fallacies and paradoxes, to specialized analysis of reasoning using probability and to arguments involving causality. Logic is also commonly used today in argumentation theory. [1]

Traditionally, logic is studied as a branch of philosophy, one part of the classical trivium, which consisted of grammar, logic, and rhetoric. Since the mid-nineteenth century formal logic has been studied in the context of the foundations of mathematics. In 1903 Bertrand Russell and Alfred North Whitehead attempted to establish logic as the cornerstone of mathematics formally with the publication of Principia Mathematica. However, the system of Principia is no longer much used, having been largely supplanted by set theory. The development of formal logic and its implementation in computing machinery is the foundation of computer science.

Show new selections below (purge)

Selected article

This diagram shows the syntactic entities which may be constructed from formal languages. The symbols and strings of symbols may be broadly divided into nonsense and well-formed formulas. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems. However, quite often, a formal system will simply define all of its well-formed formula as theorems.[2]
In the formal languages used in mathematical logic and computer science, a well-formed formula or simply formula[3] (often abbreviated wff, pronounced "wiff" or "wuff") is an idea, abstraction or concept which is expressed using the symbols and formation rules (also called the formal grammar) of a particular formal language. To say that a string of symbols \ S is a wff with respect to a given formal grammar \ G is equivalent to saying that \ S belongs to the language generated by \ G. A formal language can be identified with the set of its wffs.

Selected biography

Honourable Bertrand Russell.jpg
Bertrand Arthur William Russell, 3rd Earl Russell OM FRS (18 May 1872 – 2 February 1970), was a British philosopher, logician, mathematician and advocate for social reform.

A prolific writer, he was also a populariser of philosophy and a commentator on a large variety of topics, ranging from very serious issues to those much less so. Continuing a family tradition in political affairs, he was a prominent anti-war activist, championing free trade between nations and anti-imperialism.

Did you know?

Categories

Topics

Related portals

WikiProjects

Things to do


Here are some tasks you can do:

References

  1. ^ J. Robert Cox and Charles Arthur Willard, eds. Advances in Argumentation Theory and Research, Southern Illinois University Press, 1983 ISBN 0809310503, ISBN-13 978-0809310500
  2. ^ Godel, Escher, Bach: An Eternal Golden Braid, Douglas Hofstadter
  3. ^ Because non-well-formed formulas are rarely considered, some authors ignore them altogether. For these authors, "formula" and "well-formed formula" are synonyms. Other authors use the term "formula" for any string of symbols in the language; certain of these strings are then singled out as the well-formed formulas.

Purge server cache