Sentences of TFL

Deciding whether strings count as sentences of TFL, strictly or under relaxed bracketing conventions, and identifying the scope of each connective.

forall x: Calgary, Sentences of TFL

Status

FlagsLoading your progress…

3 exercises

Exercise A

For each of the following: (a) Is it a sentence of TFL, strictly speaking? (b) Is it a sentence of TFL, allowing for our relaxed bracketing conventions?

$(A)$
$J_{374}\vee\neg J_{374}$
$\neg\neg\neg\neg F$
$\neg\wedge S$
$(G\wedge\neg G)$
$(A\rightarrow(A\wedge\neg F))\vee(D\leftrightarrow E)$
$[(Z\leftrightarrow S)\rightarrow W]\wedge[J\vee X]$
$(F\leftrightarrow\neg D\rightarrow J)\vee(C\wedge D)$

3.0

Exercise B

Are there any sentences of TFL that contain no atomic sentences? Explain your answer.

3.0

Exercise C

What is the scope of each connective in the sentence

3.0