𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON THE ITERATED ω-RULE

✍ Scribed by Grzegorz Michalski


Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
235 KB
Volume
38
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Let Γ~n~(φ) be a formula of L~PA~ (PA = Peano Arithmetic) meaning “there is a proof of φ from PA‐axioms, in which ω‐rule is iterated no more than n times”. We examine relations over pairs of natural numbers of the kind.

(n, k) ≦~H~ (n', k') iff PA + RFN~n'~ (H~k'~) ⊩ RFN~n~ (H~k~).

Where H denotes one of the hierarchies ∑ or Π and RFN~n~(C) is the scheme of the reflection principle for Γ~n~ restricted to formulas from the class C(Γ~n~(φ) implies “φ is true”, for every φ ∈ C). Our main result is that.

(n, k) ≦H (n', k') if nn' and k ≦ max (k', 2n' + 1).


📜 SIMILAR VOLUMES


On the effective ω-rule
✍ Warren D. Goldfarb 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB
The iterated sinh transformation
✍ David Elliott; Peter R. Johnston 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB
MOGUL: A methodology to obtain genetic f
✍ O. Cordón; M. J. del Jesus; F. Herrera; M. Lozano 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 1 views

main aim of this paper is to present MOGUL, a Methodology to Obtain Genetic fuzzy rule-based systems Under the iterative rule Learning approach. MOGUL will consist of some design guidelines that allow us to obtain different genetic fuzzy rule-based systems, i.e., evolutionary algorithm-based process

On iterated clique graphs with increasin
✍ C. Peyrat; D. F. Rall; P. J. Slater 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

We examine the problem of finding a graph G whose nth iterated clique graph has diameter equal to the diameter of G plus n.