The Logic Manual, Chapter 2: Syntax and Semantics of Propositional Logic

0.0(0)
studied byStudied by 0 people
0.0(0)
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/13

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:23 PM on 1/4/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

14 Terms

1
New cards

Recursive definition of a sentence of L1:

(i) All sentence letters are sentences of L1.

(ii) If ϕ and ψ are sentences of L1, then ¬ϕ, (ϕψ), (ϕψ), (ϕ→ψ) and (ϕψ) are sentences of L1.

(iii) Nothing else is a sentence of L1.

2
New cards

Bracketing Convention 1

The outer brackets may be omitted from a sentence that is not part of another sentence

3
New cards

Bracketing Convention 2

The inner set of brackets may be omitted from a sentence of the form ((ϕψ)χ). An analogous convention applies to ∨

4
New cards

Bracketing Convention 3

Assume ϕ, ψ, and χ are sentences of L1, ● is either or , and ○ is either → or . Then, if (ϕ○(ψ ●χ))or ((ϕ●ψ)○χ) occurs as part of the sentence that is to be abbreviated, the inner set of brackets may be omitted.

5
New cards

A sentence of L1 is logically true if and only if

It is true in all L1-structures

6
New cards

A sentence of L1 is a contradiction if and only if

It is not true in any L1-structure

7
New cards

Two sentences of L1 are logically equivalent if and only if

They are true in exactly the same L1-structures

8
New cards

A sentence of L1 is logically true (truth-table) if and only if

There are only T’s in the main column of its truth-table

9
New cards

A sentence of L1 is a contradiction (truth-table) if and only if

There are only F’s in the main column of its truth-table

10
New cards

Two sentences of L1 are logically equivalent (truth table) if and only if

They agree on the truth-values in their main columns

11
New cards

Let Γ be a set of sentences of L1 and ϕ a sentence of L1. The argument with all sentences in Γ as premisses and ϕ as conclusion is valid if and only if

There is no L1-structure in which all sentences in Γ are true and ϕ is false

12
New cards

An L1-structure is a counterexample to the argument with Γ as the set of premisses and ϕ as conclusion if and only if

ψA = T for all ψ Γand ϕA =F.

13
New cards

A set Γ of L1-sentences is semantically consistent if and only if

There is an L1-structure A such that ϕA =T for all sentences ϕ of Γ.

14
New cards

A set Γ of L1-sentences is semantically inconsistent if and only if

Γ is not consistent.