The ω-rule

Studia Logica 51 (2):241 - 248 (1992)
  Copy   BIBTEX

Abstract

We prove that all proofs in -logic (a first order logic with -rule added) in which -rule is used finitely many times can be turned into proofs in which the -rule is used at most one time. Next, we prove that the word finitely above cannot be changed by the word infinitely.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the iterated ω‐rule.Grzegorz Michalski - 1992 - Mathematical Logic Quarterly 38 (1):203-208.
On the effective ω‐rule.Warren D. Goldfarb - 1975 - Mathematical Logic Quarterly 21 (1):409-412.
On a Restricted ω-Rule.J. R. Shoenfield - 1969 - Journal of Symbolic Logic 34 (1):130-131.
Completeness of the primitive recursive $$omega $$ ω -rule.Emanuele Frittaion - 2020 - Archive for Mathematical Logic 59 (5-6):715-731.
Iterated reflection principles and the ω-rule.Ulf R. Schmerl - 1982 - Journal of Symbolic Logic 47 (4):721-733.
On the iterated ω-rule.Grzegorz Michalski - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):203-208.

Analytics

Added to PP
2009-01-28

Downloads
28 (#558,165)

6 months
1 (#1,723,047)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Thau
University of Illinois at Springfield

Citations of this work

No citations found.

Add more citations

References found in this work

Henkin's completeness proof: forty years later.Hugues Leblanc, Peter Roeper, Michael Thau & George Weaver - 1991 - Notre Dame Journal of Formal Logic 32 (2):212-232.

Add more references