Studia Logica 51 (2):241 - 248 (1992)
|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.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Athanassios Tzouvaras (2003). The Logic of Multisets Continued: The Case of Disjunction. Studia Logica 75 (3):287 - 304.
Brian K. Burton & Michael Goldsby (2005). The Golden Rule and Business Ethics: An Examination. Journal of Business Ethics 56 (4):371 - 383.
Michael Rathjen (1991). The Role of Parameters in Bar Rule and Bar Induction. Journal of Symbolic Logic 56 (2):715-730.
Allen Stairs (1982). Quantum Logic and the Luders Rule. Philosophy of Science 49 (3):422-436.
Wojciech Zielonka (2002). On Reduction Systems Equivalent to the Lambek Calculus with the Empty String. Studia Logica 71 (1):31-46.
Wes Sharrock & Graham Button (1999). Do the Right Thing! Rule Finitism, Rule Scepticism and Rule Following. Human Studies 22 (2-4):193-210.
Henry Africk (1992). Classical Logic, Intuitionistic Logic, and the Peirce Rule. Notre Dame Journal of Formal Logic 33 (2):229-235.
Added to index2009-01-28
Total downloads10 ( #106,438 of 549,546 )
Recent downloads (6 months)0
How can I increase my downloads?