The University of Manchester · FACULTY OF MATHEMATICS

MATH11121 Chap.1 Propositions, Predicates and Connectives

- one subject, every graph, every model, every mark
6 Chapters3-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
Chapter 1 of 10 · MATH11121

Propositions, Predicates and Connectives

Propositions, Predicates and Connectives establishes the basic objects of mathematical logic. A proposition has a fixed truth value, while a predicate still contains a free variable. OR is inclusive, AND requires both inputs, and NOT reverses truth. Complete truth tables expose logical equivalence and show exactly which assignment makes a compound statement fail.

In this chapter

What this chapter covers

  • 01

    Propositions and truth values

  • 02

    Predicates and free variables

  • 03

    Inclusive OR

  • 04

    AND and negation

  • 05

    Truth-table equivalence

  • 06

    Statement classification

Worked example · free

Compare two connective forms

Q [4 marks]. Use a truth table to compare NOT(P AND Q) with (NOT P) OR (NOT Q). The displayed marks are an AskSia-authored practice allocation, not a University marking scheme.
The map separates fixed propositions from variable predicates, then shows how four input states generate the connective columns used in logical comparison.The map separates fixed propositions from variable predicates, then shows how four input states generate the connective columns used in logical comparison.P, Q inputsevaluate rowsTT, TF, FT, FFderived columnsOR, AND, NOTpropositionfixed truth valuepredicatefree variableassign a value
The map separates fixed propositions from variable predicates, then shows how four input states generate the connective columns used in logical comparison.
  • 2List the four input rows and evaluate the conjunction before negating it.
  • 2Evaluate the two negations and their OR, then compare final columns in every row.
Both final columns are false only on TT and true on the other rows, so the forms are logically equivalent. The practice weighting is not an official scheme.
Sia tip — An equivalence claim needs every row, while one differing row is enough to refute it.
Glossary

Key terms

Truth value
The classification of a proposition as true or false.
Free variable
A variable whose value has not been assigned or bound by a quantifier.
Connective
An operator that combines or negates complete mathematical statements.
FAQ

Propositions, Predicates and Connectives FAQ

Can an unknown statement be a proposition?

Yes. A proposition needs a definite truth value, but that value need not be easy or currently known. The issue is whether the sentence asserts something mathematically true or false, not whether the reader can decide it immediately.

Why is mathematical OR inclusive?

The connective OR is true when either input is true and also when both inputs are true. This convention is encoded in its truth table and differs from everyday contexts where speakers sometimes intend exactly one alternative.

How do I prove two forms are equivalent?

Construct their truth tables using the same input rows and compare the final columns. Matching values in every row establish equivalence; a single row with different values proves that the forms are not equivalent.

What should I do with a free variable?

State its domain and recognise that the expression is a predicate until the variable is assigned or quantified. Test several substitutions only to understand its behaviour; do not label the unbound predicate itself true or false as though one value controlled every case.

Which truth-table column should I calculate first?

Calculate the innermost connective or negation first and keep each intermediate column visible. A fixed row order makes later comparison reliable, while jumping directly to the final column hides the source of an error and makes equivalence harder to audit.

How can I check that a two-variable truth table is complete?

Use four rows and make each ordered pair of truth values appear exactly once. Keeping the same row order across related tables makes final-column comparisons dependable and exposes duplicated or omitted cases immediately.

Study strategy

Exam move

Begin each logic problem by deciding whether the expression is a proposition, predicate or neither. Name every free variable and its domain. For compound statements, assign short labels to complete components before applying connectives. Build truth tables in a consistent row order and include intermediate columns so an error can be located.

Practise translating mathematical OR, AND and NOT into ordinary sentences, then reverse the translation. When checking equivalence, compare all final rows and state the conclusion explicitly. Keep a small error log for incomplete rows, misplaced negation scope, exclusive readings of OR and attempts to assign truth to a free predicate.

Use fresh examples from integer parity, inequalities and set membership so the same logical form is recognised in different notation. Finish each session by explaining aloud why one row refutes an equivalence but one matching row cannot prove it. The aim is to make classification and row order automatic before later chapters add implications and quantifiers.

Add a sorting drill with three columns headed proposition, predicate and neither. Put equations with assigned values, formulas with unbound variables, questions, commands and bare mathematical objects into the table, then justify every placement in one sentence. Next, choose two simple propositions and build separate truth tables for OR, AND and each negation before combining them into longer forms.

Read each row aloud so the inclusive meaning of OR becomes familiar. Use colour only to mark the final columns being compared, not to replace the intermediate work. For each claimed equivalence, write a companion non-equivalence and locate the first differing row. This sharpens the distinction between evidence that proves equivalence and evidence that refutes it.

Revisit mathematical language in ordinary prose, especially words such as or, but and not, and translate the grammatical sentence into complete logical components. If a connective appears between fragments rather than statements, repair the expression before evaluating it.

Create one example in which the same predicate becomes true and false under different substitutions; this reinforces why a free variable prevents a fixed truth value. When reviewing solutions, check that row headings remain aligned and that no value from one expression has been copied into another column. A weekly retrieval set should contain classification, one full table, one translation and one equivalence decision.

Delay checking the answer until the table and conclusion are written. Then correct the earliest wrong column rather than only replacing the final truth value, because later errors often inherit from that first mistake.

Working through Propositions, Predicates and Connectives in MATH11121? Sia is AskSia’s AI Mathematics tutor — ask any MATH11121 Propositions, Predicates and Connectives question and get a clear, step-by-step explanation grounded in how MATH11121 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.

A+Everything unlocked
Unlocks this Bible + all 41 of your subjects at The University of Manchester, plus 1,000+ more Bibles across the AskSia library.
Sia - your MATH11121 tutor, unlimited, worked the way the exam marks it
The full 3-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works