MHB Degree of Sentence in Smith's Godel Book: Explained

  • Thread starter Thread starter agapito
  • Start date Start date
  • Tags Tags
    Degree
AI Thread Summary
The discussion centers on the concept of "degree" in the context of formal languages, specifically as presented in Smith's Godel book. The degree of a sentence is defined based on its construction from well-formed formulas (wffs) using connectives and bounded quantifiers. A $\Delta_0$ sentence has degree k if it is formed by k applications of these elements. For example, a sentence with one connective and one bounded quantifier has a degree of 2. The participants clarify that the degree increases with the complexity of the sentence, with specific examples illustrating degrees of 2 and 3. The concept of Godel numbering is also mentioned as a way to assign unique integers to statements or proofs, linking it to the notion of degree.
agapito
Messages
46
Reaction score
0
In Smith's Godel book he presents induction proofs that deal with the degree of a sentence of a formal language. So the base case corresponds to degree 0. The assumption is for sentence of degree k. Then finally proving that sentence of degree k+1 holds. What exactly does the property of "degree" mean in this context? Thanks for any clarification.
 
Technology news on Phys.org
Using "Godel numbering" every statement or proof can be assigned a unique positive integer. I believe that is the "degree" you are referring to.
 
HallsofIvy said:
Using "Godel numbering" every statement or proof can be assigned a unique positive integer. I believe that is the "degree" you are referring to.

OK many thanks for your input. am
 
agapito said:
What exactly does the property of "degree" mean in this context?
Page 75 says, "So let us say that a $\Delta_0$ sentence has degree $k$ iff it is built up from wffs of the form $\sigma=\tau$ or $\sigma\le\tau$ by $k$ applications of connectives and/or bounded quantifiers."
 
Evgeny.Makarov said:
Page 75 says, "So let us say that a $\Delta_0$ sentence has degree $k$ iff it is built up from wffs of the form $\sigma=\tau$ or $\sigma\le\tau$ by $k$ applications of connectives and/or bounded quantifiers."

Thanks for replying. To check for my understanding, if you look at example vii on previous page:

Sentence has 1 connective and 1 bounded quantifier. Would this mean that k in this case is 2? If correct, what might an example of k = 3 look like?

As always, your help is greatly appreciated. am
 
agapito said:
To check for my understanding, if you look at example vii on previous page:

Sentence has 1 connective and 1 bounded quantifier. Would this mean that k in this case is 2?

Yes.

agapito said:
If correct, what might an example of k = 3 look like?
The degree of formula (vi) right before that is 3.
 
Evgeny.Makarov said:
Yes.

The degree of formula (vi) right before that is 3.

Understood, many thanks, Evgeny. agapito
 
Back
Top