 Home

Codex Wiki

Mathematics

Area of mathematics

Foundations of mathematics

Mathematical logic

Propositional logic

{title2=$S=\operatorname{Cn}(S)$}

A set $S$ of formulae is deductively closed when
$$
S\vdash\varphi\quad\Longrightarrow\quad\varphi\in S.
$$
Equivalently, $S$ equals its deductive closure $\operatorname{Cn}(S)$.


Deductively closed set of formulae

Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 1 / 16G / a / Solution

Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 1 / 16G / c / Solution

Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 120 / 1 / d / Solution

Deductively closed set of formulae ( $S = Cn (S)$ )

 Ancestors (6)

 Incoming links (3)

 Discussion (0)

 Articles by others on the same topic (0)

Deductively closed set of formulae (S=Cn(S))

 Ancestors (6)

 Incoming links (3)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (0)

Deductively closed set of formulae ( $S = Cn (S)$ )

 Discussion (0)