Formal Systems Flashcards

1
Q

Investigation of a formal system:

A

(1) Find limitations and (2) conditions uder which they are obtained

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

Difference between syntax and semantics:

A

Syntax: formal structure, grammer
Semantics: meaning and contect

Ordinary language there two are tightly connected and we do not precieve the distiction.

To be explicit, put word in quotation marks when mentioned, not when we use it.
Ex:
(a) Bruce is eating
(b) “Bruce” has two vowels

Interpretation: Both syntax and semantics. (“Connects”) Gives semantics to syntax

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

Parts of a formal system:

A
  1. Alphabet (from which we form well-formed strings)
  2. Axoims
  3. Inference Rules

Theorems are the product of a formal system.

Derivations are non-empty, well-formed sequences contructed from the axoims or inference rules of the formal system.

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

Define a meta-variable:

A

Use in a recursive definition about the variables (Syntax)

Used to specify inference rules. Not part of the alphabet

Like x and y in the MIU system

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

What are well-formed strings?

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

What is a derivation?

A

Non-empty sequence of well-formed strings, each of which either an axiom or derived from applying the inference rules to items occuring earlier in the derivation (Recursive Definition)

Explicitly: Derivation is a non-empty sequence of strings, such that each string is either an axoim or obtained from strings that are earlier in the sequences by one of the inference rules

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

What is a theorem?

A

A theorem is the last string in a derivation

Other definitions:
(1) “Last line in a proof”
(2) “Theorems: strings can be derived from axioms and inference rules”

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

What aspects of theorems and rules in a formal system are inductive and deductive?

A
  1. Derive a few theorems: induction
  2. Reason about rules of system: deductive
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the difference between inside and outside the system?

A

M-Mode: Mechanical mode (inside)
Reasoning within the formal system

I-Mode: Intellegent mode (outside)
Reasoning about formal system

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

Difference between object and meta-language:

A

Object language (strings in M-Mode) and meta-language (strings in I-Mode)

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

What is a decision procedure?

A

Procedure that:
1. Guarantees a yes-answer or a no-answer to a question (bivalence)
2. After a finite amount of time

If a question has a decision procedure, it is decidable

Axoims of a formal system must be determined by a decision procedure.

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

When is a set decidable?

A

If the question is ‘Is x an element of the set?’ then it is decidable for all elements x

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