scientific article; zbMATH DE number 3908426
[For the entire collection see Zbl 0553.00001.] The paper presents the solution to Mostowski's famous question of finding a syntactical rule (the \(\beta\)-rule) complete w.r.t. truth in all \(\beta\)-models, i.e. models where well-foundedness is correctly interpreted. The solution is by means of a concept of functorial proof, preserving direct limits and pull-backs: the value of such a proof on an infinite input is therefore effectively approximable from its values on finite inputs. The solution of Mostowski's problem was found by the author in 1978, but never published. Here an improvement of the original solution is presented, obtained by considering arbitrary well-founded orders instead of ordinals, from which one gets a nicer geometrical approach to these proofs, essentially in the problem of rewriting them as the addition to usual logic of a specific new rule: the \(\Omega\)-rule.
- The \(\omega{}\)-rule
- ON THE ITERATED ω‐RULE
- An extension of the omega-rule
- On an extremely restricted ω-rule
- Countable version of Omega-rule
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus
- The ω-problem
- Hilbert's program and the omega-rule
- Functional interpretation of the β-rule
- The \(\omega{}\)-rule
- scientific article; zbMATH DE number 5903094 (Why is no real title available?)
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
- Functional interpretation of the β-rule
- scientific article; zbMATH DE number 4057506 (Why is no real title available?)
- Completeness of the primitive recursive \(\omega \)-rule
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686708)