Propositional logic

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions. Unlike first-order logic, propositional logic does not deal with non-logical objects, predicates about them, or quantifiers. However, all the machinery of propositional logic is included in first-order logic and higher-order logics. In this sense, propositional logic is the foundation of first-order logic and higher-order logic. Logical connectives are found in natural languages. In English for example, some examples are "and" (conjunction), "or" (disjunction), "not" (negation) and "if" (but only when used to denote material conditional). The following is an example of a very simple inference within the scope of propositional logic: Premise 1: If it's raining then it's cloudy. Premise 2: It's raining. Conclusion: It's cloudy. Both premises and the conclusion are propositions. The premises are taken for granted, and with the application of modus ponens (an inference rule), the conclusion follows. As propositional logic is not concerned with the structure of propositions beyond the point where they can't be decomposed any more by logical connectives, this inference can be restated replacing those atomic statements with statement letters, which are interpreted as variables representing statements: Premise 1: Premise 2: Conclusion: The same can be stated succinctly in the following way: When P is interpreted as "It's raining" and Q as "it's cloudy" the above symbolic expressions can be seen to correspond exactly with the original expression in natural language. Not only that, but they will also correspond with any other inference of this form, which will be valid on the same basis this inference is.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Summary

Categories

Official source

https://en.wikipedia.org/wiki/Propositional_calculus

About this result

Related categories (9)

Related concepts (7)

Related courses (1)

Related lectures (30)

Related publications (4)

Law of noncontradiction

In logic, the law of non-contradiction (LNC) (also known as the law of contradiction, principle of non-contradiction (PNC), or the principle of contradiction) states that contradictory propositions cannot both be true in the same sense at the same time, e. g. the two propositions "p is the case" and "p is not the case" are mutually exclusive. Formally, this is expressed as the tautology ¬(p ∧ ¬p). The law is not to be confused with the law of excluded middle which states that at least one, "p is the case" or "p is not the case" holds.

Hypothetical syllogism

In classical logic, a hypothetical syllogism is a valid argument form, a syllogism with a conditional statement for one or both of its premises. An example in English: If I do not wake up, then I cannot go to work. If I cannot go to work, then I will not get paid. Therefore, if I do not wake up, then I will not get paid. The term originated with Theophrastus. A pure hypothetical syllogism is a syllogism in which both premises and conclusions are conditionals.

Modus ponens

In propositional logic, modus ponens (ˈmoʊdəs_ˈpoʊnɛnz; MP), also known as modus ponendo ponens (Latin for "method of putting by placing"), implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "P implies Q. P is true. Therefore Q must also be true." Modus ponens is closely related to another valid form of argument, modus tollens. Both have apparently similar but invalid forms such as affirming the consequent, denying the antecedent, and evidence of absence.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a

Métropole, un concept récent pour un débat centenaire

Marc Antoine Messer

Métropoles et métropolisation semblent être les maîtres mots pour comprendre les phénomènes d’urbanisation du XXIème siècle globalisé. Mais, si on les considère sous l’angle de la planification territoriale et qu’on s’en saisit comme un objet d’urbanisme, ...

2018

Although the Modus Ponens inference is one of the most basic logical rules, decades of conditional reasoning research show that it is often rejected when people consider stored background knowledge about potential disabling conditions. In the present study ...

Pergamon-Elsevier Science Ltd2014

Modélisation, Simulation et Optimisation des chambres de compression/détente hydropneumatique du système HyPES

Nicolas Fromont

Ce projet consiste en la modélisation, la simulation et l’optimisation de l’échangeur de chaleur interne à la chambre de compression/détente pour le stockage d’énergie. Au cours de l’étude deux types d’analyses vont être présentées : une analyse numérique ...

2013

First-order 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 quantified variables over non-logical objects, and allows the use of sentences that contain variables, so that rather than propositions such as "Socrates is a man", one can have expressions in the form "there exists x such that x is Socrates and x is a man", where "there exists" is a quantifier, while x is a variable.

Reason

Reason is the capacity of applying logic consciously by drawing conclusions from new or existing information, with the aim of seeking the truth. It is closely associated with such characteristically human activities as philosophy, science, language, mathematics, and art, and is normally considered to be a distinguishing ability possessed by humans. Reason is sometimes referred to as rationality. Reasoning is associated with the acts of thinking and cognition, and involves the use of one's intellect.

Classical logic

Classical logic (or standard logic or Frege-Russell logic) is the intensively studied and most widely used class of deductive logic. Classical logic has had much influence on analytic philosophy. Each logical system in this class shares characteristic properties: Law of excluded middle and double negation elimination Law of noncontradiction, and the principle of explosion Monotonicity of entailment and idempotency of entailment Commutativity of conjunction De Morgan duality: every logical operator is dual to another While not entailed by the preceding conditions, contemporary discussions of classical logic normally only include propositional and first-order logics.

Proofs and Logic: Introduction

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Proofs: Logic, Mathematics & Algorithms CS-101: Advanced information, computation, communication I

Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.

Propositional Logic: Equivalence and Normal Forms

Covers propositional logic, equivalence proofs, and normal forms using truth tables.