# Portal:Logic/Selected article

## Usage

The layout design for these subpages is at Portal:Logic/Selected article/Layout.

1. Add a new Selected article to the next available subpage.
2. Update "max=" to new total for its {{Random portal component}} on the main page.

## Selected articles list

Portal:Logic/Selected article/1

In logic and mathematics, or, also known as logical disjunction or inclusive disjunction is a logical operator that results in true whenever one or more of its operands are true. In grammar, or is a coordinating conjunction.

Logical disjunction is an operation on two logical values, typically the values of two propositions, that produces a value of false if and only if both of its operands are false. More generally a disjunction is a logical formula that can have one or more literals separated only by ORs. A single literal is often considered to be a degenerate disjunction.

Portal:Logic/Selected article/2

The history of logic is the study of the development of the science of valid inference (logic). While many cultures have employed intricate systems of reasoning, and logical methods are evident in all human thought, an explicit analysis of the principles of reasoning was developed only in three traditions: those of China, India, and Greece. Of these, only the treatment of logic descending from the Greek tradition, particularly Aristotelian logic, found wide application and acceptance in science and mathematics. The Greek tradition was further developed by Islamic logicians and then medieval European logicians. Not until the 19th century does the next great advance in logic arise, with the development of symbolic logic by George Boole and its subsequent development into formal calculable logical systems by Gottlob Frege and set theorists such as Georg Cantor and Giuseppe Peano, ushering in the Information Age.

Logic was known as 'dialectic' or 'analytic' in Ancient Greece. The word 'logic' (from the Greek logos, meaning discourse or sentence) does not appear in the modern sense until the commentaries of Alexander of Aphrodisias, writing in the third century A.D.

Portal:Logic/Selected article/3

In the formal languages used in mathematical logic and computer science, a well-formed formula or simply formula[2] (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 ${\displaystyle \ S}$ is a wff with respect to a given formal grammar ${\displaystyle \ G}$ is equivalent to saying that ${\displaystyle \ S}$ belongs to the language generated by ${\displaystyle \ G}$. A formal language can be identified with the set of its wffs.

Portal:Logic/Selected article/4

Portal:Logic/Selected article/5

Portal:Logic/Selected article/6

Portal:Logic/Selected article/7

Portal:Logic/Selected article/8

Portal:Logic/Selected article/9

Portal:Logic/Selected article/10

Portal:Logic/Selected article/11

Portal:Logic/Selected article/12

Portal:Logic/Selected article/13

Portal:Logic/Selected article/14

Portal:Logic/Selected article/15

Portal:Logic/Selected article/16

Portal:Logic/Selected article/17

Portal:Logic/Selected article/18

Portal:Logic/Selected article/19