Recursively Enumerable vs. Recursive Sets Flashcards

1
Q

Theorems:

A

Theorems: Strings can be derived from the axoims and inference ruels of the system

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

Non-Theorems:

A

Well-formed strings that are not theorems

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

Recursively Enumerable (sets):

A

Can be generated as theorems of a formal system

The Figure

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

Recursive (sets):

A

Both theorems and non-theorems (wff that are not theorems) can be generated by a formal system

Both the set and its complement are r.e.

the Figure and Ground

Every recursive set is r.e.
If it is recursive then it has a decision procesure - decidable
There are r.e. sets that are not recursive

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

Relation between Recursive and R.E. sets:

A
  • Every recursive set is r.e.
  • If it is recursive then it has a decision procesure - decidable
  • There are r.e. sets that are not recursive
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Why must a recursive set be decidable?

A

Generate the theorems and the non-theorems.

Any well-formed string will appear in one or the list after a finite amount of time

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

How to build a formal system for multiplication:

A

x * 1 = x
x * (n + 1) = (x * n) + x

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

What is a composite number?

A

A number is composite, if it is obtained by multiplying two numbers each of which is greater than 1 (denoted at C)

Ex: C-System

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

Relation between composite and prime numbers:

A

Numbers that are not composite are prime

Therefore - Recursive

Ex: in the C-System, all strings of the form Cx are divided into the C-System into composite (theorems) and primes (non-theorems)

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

Quiz 2

Is a set of prime numbers recursive? if yes, say why; if not, say why not.

A

Yes. Using the C-system (of composite numbers), both theorems and non-theorems (primes) can be derived.

Meaning, it is recursive - the figure (composite numbers) and the ground (primes)

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

Quiz 2

What is the name of the relation between syntactic and semantic consequence if set of formulas entails x then the set of formulas proves x?

A

Completeness

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

Quiz 2

⊢_(AX) A

What does this mean?

A

In the axiomatic calculus system, the cconclusion A is proven from no open assumptions

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

Quiz 2

(a) Tautology, (b) Logical theorem, (c) Derivation, (d) Truth table, and (e) inference rule

Say whether the following notions are syntactic or semantic:

A

(a) Semantic
(b) Syntactical
(c) Syntactic
(d) Semantic
(e) Syntactic

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

Quiz 2

What are the cardinalities of the following sets?

(1) The wffs of propositional logic,
(2) The tautologies of propositional logic, and
(3) the wffs of propositional logic that are not tautologies.

A

ℵ0

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