propositional and predicate logic Flashcards

1
Q

logic

A

the study of reasoning; rational ways of drawing conclusions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

proposition

A

claim about how things are; either true or false but not both
represented by letters

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

atomic propositions

A

where the truth or falsity of this proposition doesn’t depend on the truth or falsity of another proposition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

compound propositons

A

a proposition created by combining atomic propositions through fundamental connectives

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what are the 6 fundamental connectives

A

and
or
xor
not
conditional/implication
biconditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A

and; forms a third proposition from two other propositions called a conjunction
conjunction is true when both initial propositions are true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

A

or; forms a third proposition from two other propositions called a disjunction
disjunction is true when at least one of the other propositions are true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A

xor; forms a third proposition called an exclusive disjunction which is true when only one of the propositions are true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

¬ ~

A

not; forms a second proposition called a negation which is the opposite of the propostion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q


what are the 2 parts
what makes them true

A

conditional; if.. then
has an antecedent (if) and a consequent (then)
if a is true then c is true
if both are false then the implication is true
if only the consequent is false then the implication is true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A

biconditonal; if and only if
combines two propositions into a biconditional which is true if both propositions have the same truth value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

what are the 4 types of logical properties

A

tautologies
contradictions
contingencies
equivalents

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

tautologies

A

propositions that are always true regardless of their atomic propostions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

contradictions

A

propositions that are always false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

contingencies

A

propositions that are neither tautologies or contradictions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

equivalents

A

two propositions are logically equivalent if they have the exact same truth values under all circumstances

17
Q

inference rules

A

templates/shortcuts for building valid arguments

18
Q

replacement rules

A

rules for replacing parts of propositions with logically equivalent expressions

19
Q

what is predicate logic

A

an extension of propositional logic that deals with parts of propostions

20
Q

what are the three main limitations of propositional logic

A

doesn’t describe or link between parts of propositions
doesn’t have quantifiers

21
Q

terms

A

objects that are expressed through nouns and pronouns

22
Q

predicates

A

relations amongst terms expressed through verbs

23
Q

operators

A

connectives and quantifiers

24
Q

atomic formulae

A

functions that take in one or more arguments and returns a boolean value
made of a predicate and one or more terms

25
Q

closed/ground formulae

A

predicate arguments have only constants and no variables
propositions that have truth tables

26
Q

open/unground formulae

A

arguments have at least one variable and can have constants
these are not propositions and therefore have no truth values

27
Q

compound formulae

A

formulae created by applying logical connectives to atomic formulae

28
Q

atomic formulae arity

A

the number of variables taken as an argument
unary; 1 variable, arity 0
binary; 2 variables, arity 1
n-ary; n variables, arity more than 1

29
Q

quantifiers

A

operators showing the quantity of values from the universe of discourse for which an open formulae is true
combines with terms and variables in open formulae to create quantified formulae

30
Q

A

universal quantifier; every/for all

31
Q

~∀

A

not all
there is at least one

32
Q

A

existential quantifier; at least one/ there exists

33
Q

~∃

A

it is not the case that

34
Q

restricted quantifiers

A

some elements in the universe of discourse

35
Q

unrestricted quantifiers

A

all elements in the universe of discourse

36
Q

interpretation

A

used to identify the truth value of each formulae
includes: identifying the universe of discourse; assigning each value from the universe of discourse to the variable

37
Q

satisfiable formulae

A

there is at least one value from the universe of discourse that makes the formulae true