HOME
*





Obversion
In traditional logic, obversion is a "type of immediate inference in which from a given proposition another proposition is inferred whose subject is the same as the original subject, whose predicate is the contradictory of the original predicate, and whose quality is affirmative if the original proposition's quality was negative and vice versa". The quality of the inferred categorical proposition is changed but the truth value is the same to the original proposition. The immediately inferred proposition is termed the "obverse" of the original proposition, and is a valid form of inference for all types (A, E, I, O) of categorical propositions. In a universal affirmative and a universal negative proposition the subject term and the predicate term are both replaced by their negated counterparts: The universal affirmative ("A" proposition) is obverted to a universal negative ("E" proposition). :''"All S are P"'' and ''"No S are non-P"'' :''"All cats are animals"'' and ''"No ca ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Transposition (logic)
In propositional logic, transposition is a valid rule of replacement that permits one to switch the antecedent with the consequent of a conditional statement in a logical proof if they are also both negated. It is the inference from the truth of "''A'' implies ''B''" to the truth of "Not-''B'' implies not-''A''", and conversely. It is very closely related to the rule of inference modus tollens. It is the rule that (P \to Q) \Leftrightarrow (\neg Q \to \neg P) where "\Leftrightarrow" is a metalogical symbol representing "can be replaced in a proof with". Formal notation The ''transposition'' rule may be expressed as a sequent: :(P \to Q) \vdash (\neg Q \to \neg P) where \vdash is a metalogical symbol meaning that (\neg Q \to \neg P) is a syntactic consequence of (P \to Q) in some logical system; or as a rule of inference: :\frac where the rule is that wherever an instance of "P \to Q" appears on a line of a proof, it can be replaced with "\neg Q \to \neg P"; or a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Categorical Proposition
In logic, a categorical proposition, or categorical statement, is a proposition that asserts or denies that all or some of the members of one category (the ''subject term'') are included in another (the ''predicate term''). The study of arguments using categorical statements (i.e., syllogisms) forms an important branch of deductive reasoning that began with the Ancient Greeks. The Ancient Greeks such as Aristotle identified four primary distinct types of categorical proposition and gave them standard forms (now often called ''A'', ''E'', ''I'', and ''O''). If, abstractly, the subject category is named ''S'' and the predicate category is named ''P'', the four standard forms are: *All ''S'' are ''P''. (''A'' form, \forall _\rightarrow P_xequiv \forall neg S_\lor P_x/math>) *No ''S'' are ''P''. (''E'' form, \forall _\rightarrow \neg P_xequiv \forall neg S_\lor \neg P_x/math>) *Some ''S'' are ''P''. (''I'' form, \exists _\land P_x/math>) *Some ''S'' are not ''P''. (''O'' form, \ex ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Categorical Proposition
In logic, a categorical proposition, or categorical statement, is a proposition that asserts or denies that all or some of the members of one category (the ''subject term'') are included in another (the ''predicate term''). The study of arguments using categorical statements (i.e., syllogisms) forms an important branch of deductive reasoning that began with the Ancient Greeks. The Ancient Greeks such as Aristotle identified four primary distinct types of categorical proposition and gave them standard forms (now often called ''A'', ''E'', ''I'', and ''O''). If, abstractly, the subject category is named ''S'' and the predicate category is named ''P'', the four standard forms are: *All ''S'' are ''P''. (''A'' form, \forall _\rightarrow P_xequiv \forall neg S_\lor P_x/math>) *No ''S'' are ''P''. (''E'' form, \forall _\rightarrow \neg P_xequiv \forall neg S_\lor \neg P_x/math>) *Some ''S'' are ''P''. (''I'' form, \exists _\land P_x/math>) *Some ''S'' are not ''P''. (''O'' form, \ex ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Square Of Opposition
In term logic (a branch of philosophical logic), the square of opposition is a diagram representing the relations between the four basic categorical propositions. The origin of the square can be traced back to Aristotle's tractate '' On Interpretation'' and its distinction between two oppositions: contradiction and contrariety. However, Aristotle did not draw any diagram. This was done several centuries later by Apuleius and Boethius. Summary In traditional logic, a proposition (Latin: ''propositio'') is a spoken assertion (''oratio enunciativa''), not the meaning of an assertion, as in modern philosophy of language and logic. A '' categorical proposition'' is a simple proposition containing two terms, subject () and predicate (), in which the predicate is either asserted or denied of the subject. Every categorical proposition can be reduced to one of four logical forms, named , , , and based on the Latin ' (I affirm), for the affirmative propositions and , and ' (I de ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Logical Equivalence
In logic and mathematics, statements p and q are said to be logically equivalent if they have the same truth value in every model. The logical equivalence of p and q is sometimes expressed as p \equiv q, p :: q, \textsfpq, or p \iff q, depending on the notation being used. However, these symbols are also used for material equivalence, so proper interpretation would depend on the context. Logical equivalence is different from material equivalence, although the two concepts are intrinsically related. Logical equivalences In logic, many common logical equivalences exist and are often listed as laws or properties. The following tables illustrate some of these. General logical equivalences Logical equivalences involving conditional statements :#p \implies q \equiv \neg p \vee q :#p \implies q \equiv \neg q \implies \neg p :#p \vee q \equiv \neg p \implies q :#p \wedge q \equiv \neg (p \implies \neg q) :#\neg (p \implies q) \equiv p \wedge \neg q :#(p \implies q) \wedge (p \impli ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Syllogism
A syllogism ( grc-gre, συλλογισμός, ''syllogismos'', 'conclusion, inference') is a kind of logical argument that applies deductive reasoning to arrive at a conclusion based on two propositions that are asserted or assumed to be true. In its earliest form (defined by Aristotle in his 350 BCE book '' Prior Analytics''), a syllogism arises when two true premises (propositions or statements) validly imply a conclusion, or the main point that the argument aims to get across. For example, knowing that all men are mortal (major premise) and that Socrates is a man (minor premise), we may validly conclude that Socrates is mortal. Syllogistic arguments are usually represented in a three-line form: All men are mortal. Socrates is a man. Therefore, Socrates is mortal.In antiquity, two rival syllogistic theories existed: Aristotelian syllogism and Stoic syllogism. From the Middle Ages onwards, ''categorical syllogism'' and ''syllogism'' were usually used interchangeably. Thi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Inference
Inferences are steps in reasoning, moving from premises to logical consequences; etymologically, the word ''wikt:infer, infer'' means to "carry forward". Inference is theoretically traditionally divided into deductive reasoning, deduction and inductive reasoning, induction, a distinction that in Europe dates at least to Aristotle (300s BCE). Deduction is inference Formal proof, deriving Logical consequence, logical conclusions from premises known or assumed to be truth, true, with the Rule of inference, laws of valid inference being studied in logic. Induction is inference from particular evidence to a Universal (metaphysics), universal conclusion. A third type of inference is sometimes distinguished, notably by Charles Sanders Peirce, contradistinguishing Abductive reasoning, abduction from induction. Various fields study how inference is done in practice. Human inference (i.e. how humans draw conclusions) is traditionally studied within the fields of logic, argumentation stud ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Conversion (logic)
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition ''All S are P'', the converse is ''All P are S''. Either way, the truth of the converse is generally independent from that of the original statement.Robert Audi, ed. (1999), ''The Cambridge Dictionary of Philosophy'', 2nd ed., Cambridge University Press: "converse". Implicational converse Let ''S'' be a statement of the form ''P implies Q'' (''P'' → ''Q''). Then the converse of ''S'' is the statement ''Q implies P'' (''Q'' → ''P''). In general, the truth of ''S'' says nothing about the truth of its converse, unless the antecedent ''P'' and the consequent ''Q'' are logically equivalent. For example, consider the true statement "If I am a human, then I am mortal." The converse of that statement is "If I am mortal, then I am ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Contraposition
In logic and mathematics, contraposition refers to the inference of going from a conditional statement into its logically equivalent contrapositive, and an associated proof method known as proof by contraposition. The contrapositive of a statement has its antecedent and consequent inverted and flipped. Conditional statement P \rightarrow Q. In formulas: the contrapositive of P \rightarrow Q is \neg Q \rightarrow \neg P . If ''P'', Then ''Q''. — If not ''Q'', Then not ''P''. ''"''If ''it is raining,'' then ''I wear my coat" —'' "If ''I don't wear my coat,'' then ''it isn't raining."'' The law of contraposition says that a conditional statement is true if, and only if, its contrapositive is true. The contrapositive ( \neg Q \rightarrow \neg P ) can be compared with three other statements: ;Inversion (the inverse), \neg P \rightarrow \neg Q:"If ''it is not raining,'' then ''I don't wear my coat''." Unlike the contrapositive, the inverse's truth value is not at all de ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Aristotle
Aristotle (; grc-gre, Ἀριστοτέλης ''Aristotélēs'', ; 384–322 BC) was a Greek philosopher and polymath during the Classical period in Ancient Greece. Taught by Plato, he was the founder of the Peripatetic school of philosophy within the Lyceum and the wider Aristotelian tradition. His writings cover many subjects including physics, biology, zoology, metaphysics, logic, ethics, aesthetics, poetry, theatre, music, rhetoric, psychology, linguistics, economics, politics, meteorology, geology, and government. Aristotle provided a complex synthesis of the various philosophies existing prior to him. It was above all from his teachings that the West inherited its intellectual lexicon, as well as problems and methods of inquiry. As a result, his philosophy has exerted a unique influence on almost every form of knowledge in the West and it continues to be a subject of contemporary philosophical discussion. Little is known about his life. Aristotle was ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Traditional Logic
In philosophy, term logic, also known as traditional logic, syllogistic logic or Aristotelian logic, is a loose name for an approach to formal logic that began with Aristotle and was developed further in ancient history mostly by his followers, the Peripatetics. It was revived after the third century CE by Porphyry's Isagoge. Term logic revived in medieval times, first in Islamic logic by Alpharabius in the tenth century, and later in Christian Europe in the twelfth century with the advent of new logic, remaining dominant until the advent of predicate logic in the late nineteenth century. However, even if eclipsed by newer logical systems, term logic still plays a significant role in the study of logic. Rather than radically breaking with term logic, modern logics typically expand it, so to understand the newer systems, one must be acquainted with the earlier one. Aristotle's system Aristotle's logical work is collected in the six texts that are collectively known as th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Immediate Inference
An immediate inference is an inference which can be made from only one statement or proposition. For instance, from the statement "All toads are green", the immediate inference can be made that "no toads are not green" or "no toads are non-green" (Obverse). There are a number of ''immediate inferences'' which can validly be made using logical operations, the result of which is a logically equivalent statement form to the given statement. There are also invalid immediate inferences which are syllogistic fallacies. Valid immediate inferences Converse *Given a type E statement, "No ''S'' are ''P''.", one can make the ''immediate inference'' that "No ''P'' are ''S''" which is the converse of the given statement. *Given a type I statement, "Some ''S'' are ''P''.", one can make the ''immediate inference'' that "Some ''P'' are ''S''" which is the converse of the given statement. Obverse *Given a type A statement, "All ''S'' are ''P''.", one can make the ''immediate inference'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]