No label defined (Q3686708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3908426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3908426 |
Statements
1984
0 references
dilators
0 references
functors
0 references
completeness
0 references
beta-rule
0 references
pi-one-two logic
0 references
syntactical rule
0 references
well-foundedness
0 references
functorial proof
0 references
direct limits
0 references
pull-backs
0 references
well-founded orders
0 references
0 references
0 references
0 references
0.8255732
0 references
0.8234284
0 references
0 references
0.8084591
0 references
[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.
0 references