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.

Categories

Keywords

Reprint years

DOI

10.1007/bf00370115

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,347

External links

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

Through your library

My notes

Similar books and articles

The logic of multisets continued: The case of disjunction.Athanassios Tzouvaras - 2003 - Studia Logica 75 (3):287 - 304.
Logic for A.I. - Solutions.Rosalie Iemhoff - unknown
Do the right thing! Rule finitism, rule scepticism and rule following.Wes Sharrock & Graham Button - 1999 - Human Studies 22 (2-4):193-210.
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
Notes on "epistemology of a rule-based expert system".William J. Clancey - 1993 - Artificial Intelligence 59 (1-2):191-204.
Quantum logic and the luders rule.Allen Stairs - 1982 - Philosophy of Science 49 (3):422-436.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
Who needs rules of recognition?Jeremy Waldron - unknown
Classical logic, intuitionistic logic, and the Peirce rule.Henry Africk - 1992 - Notre Dame Journal of Formal Logic 33 (2):229-235.

Analytics

Added to PP
2009-01-28

Downloads
34 (#473,364)

6 months
1 (#1,478,500)

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