A reduction theorem for normal algorithms

Journal of Symbolic Logic 31 (1):86-97 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1996

DOI

10.2307/2270622

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Review: J. W. Swanson, A Reduction Theorem for Normal Algorithms. [REVIEW]Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123-123.
A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13‐15):219-222.
A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13-15):219-222.
Towards Strengthening of the Reduction Theorem of the Theory of Algorithms.N. M. Nagornyj - 1954 - Journal of Symbolic Logic 19 (3):218-218.
Review: N. M. Nagornyj, Towards Strengthening of the Reduction Theorem of the Theory of Algorithms. [REVIEW]Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (3):218-218.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
Compactness and normality in abstract logics.Xavier Caicedo - 1993 - Annals of Pure and Applied Logic 59 (1):33-43.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
Classes of Markov-like k-ALGORITHMS.Zdzislaw Grodzki & Jerzy Mycka - 1996 - Reports on Mathematical Logic:83-99.
Algorithms, genetics, and populations: The schemata theorem revisited.Freddy Bugge Christiansen & Marcus W. Feldman - 1998 - Complexity 3 (3):57-64.
Uniqueness of normal proofs in implicational intuitionistic logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Normal Gentzen deductions in the classical case.A. Palmigiano - 2000 - Logic Journal of the IGPL 8 (2):211-219.
A normal form for logical derivations implying one for arithmetic derivations.G. Mints - 1993 - Annals of Pure and Applied Logic 62 (1):65-79.
Emergence, Reduction and Supervenience: A Varied Landscape. [REVIEW]Jeremy Butterfield - 2011 - Foundations of Physics 41 (6):920-959.
On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.

Analytics

Added to PP
2009-01-28

Downloads
69 (#232,586)

6 months
6 (#512,819)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13-15):219-222.
A reduction theorem for normal algorithms.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (13‐15):219-222.

Add more citations

References found in this work

Foundations of Mathematical Logic.William Craig - 1963 - Journal of Symbolic Logic 45 (2):377-378.
Introduction to Mathematical Logic.John Corcoran - 1964 - Journal of Symbolic Logic 54 (2):618-619.
Theory of Algorithms.A. A. Markov - 1962 - Journal of Symbolic Logic 27 (2):244-244.

Add more references