Recursive \(\omega\)-rule for proof systems (Q1119627): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:17, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recursive \(\omega\)-rule for proof systems |
scientific article |
Statements
Recursive \(\omega\)-rule for proof systems (English)
0 references
1989
0 references
By using the result of \textit{E. G. K. Lopez-Escobar} [Stud. Logic Found. Math. 89, 75--97 (1977; Zbl 0386.03026)] that if there is an effective disjunctor on a formal Carnap theory \({\mathcal F}\), then \({\mathcal F}^{\infty}\) is a conservative extension of \({\mathcal F}^{\infty}_{rec}\), this author shows that infinitary rules in most proof systems in computer science can be restricted to recursive ones.
0 references
recursive proof systems
0 references
effective disjunctor
0 references
Carnap theory
0 references
infinitary rules
0 references
proof systems in computer science
0 references