Formal Systems Flashcards
Investigation of a formal system:
(1) Find limitations and (2) conditions uder which they are obtained
Difference between syntax and semantics:
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
Parts of a formal system:
- Alphabet (from which we form well-formed strings)
- Axoims
- 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.
Define a meta-variable:
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
What are well-formed strings?
What is a derivation?
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
What is a theorem?
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”
What aspects of theorems and rules in a formal system are inductive and deductive?
- Derive a few theorems: induction
- Reason about rules of system: deductive
What is the difference between inside and outside the system?
M-Mode: Mechanical mode (inside)
Reasoning within the formal system
I-Mode: Intellegent mode (outside)
Reasoning about formal system
Difference between object and meta-language:
Object language (strings in M-Mode) and meta-language (strings in I-Mode)
What is a decision procedure?
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.
When is a set decidable?
If the question is ‘Is x an element of the set?’ then it is decidable for all elements x