Scribd
Upload
40 views2 pages

Ch.6-Sentences of TFL

The document defines what counts as a sentence in Truth-Functional Logic (TFL). [1] Atomic sentences are letters like A, B, C. [2] There are 5 connectives: negation, conjunction, disjunction, conditional, biconditional. [3] Sentences are constructed inductively from atomic sentences using these connectives according to 7 rules. This inductive definition allows us to determine if any string of symbols is a well-formed sentence of TFL.

Uploaded by

jadynisara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views2 pages

Ch.6-Sentences of TFL

The document defines what counts as a sentence in Truth-Functional Logic (TFL). [1] Atomic sentences are letters like A, B, C. [2] There are 5 connectives: negation, conjunction, disjunction, conditional, biconditional. [3] Sentences are constructed inductively from atomic sentences using these connectives according to 7 rules. This inductive definition allows us to determine if any string of symbols is a well-formed sentence of TFL.

Uploaded by

jadynisara
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Ch.

6 part II: Sentences of TFL


09/10/22

Goal: To define what counts as a sentence of TFL.

6.1 Expressions

Atomic Sentences: A, B, C…, Z (with subscripts)

Connectives , , , , 

Brackets ()

Expression of TFL Any string of symbols of TFL in any order.

6.2 Sentences

Goal To determine the rules that define a sentence.

Atomic Sentences Individual sentences letters

 Sentences are constructed using atomic sentences and the five connectives.
1. Every sentence letter is a sentence.

2. If A is a sentence, then A is a sentence.

3. If A and B are sentences, then (AB) is a sentence.

4. If A and B are sentences, then (AB) is a sentence

5. If A and B are sentences, then (AB) is a sentence

6. If A and B are sentences, then (AB) is a sentence.

7. Nothing else is a sentence. (i.e. No: ABC)

 This is an inductive definition.


To see if something is a sentence of TFL, you can use inductive reasoning to deconstruct it
to base atomic sentences.

Ex. (P(QR))

1. Is (P(QR)) a sentence? (See 2)

2. Are both P and (QR) sentences? (See 3)

3. If (QR) a sentence? (2)

4. Now we know Q and R, are both sentences!

Sentential Of or relating to a sentence.

 There must be some sentential connective that was introduced last when
constructing the sentence.

 That connective is the Main Logical Operator.

 The inductive structure of sentences will be important in determining truth values.

Also allow us to determine scope of a negation (subsentence for which the negation is
main logical operator)

 The scope of a connective is the subsentence for which that connective is the main
logical operator.

6.3 Bracketing Conventions

Conjunctions and disjunctions without brackets are not sentences, but expression in TFL.

- This is a very strict definition

Conventions

1. Omit outermost brackets (put them back if you need to embed sentence)

2. Can use both square and round brackets.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy