A reduction theorem for normal algorithms
Journal of Symbolic Logic 31 (1):86-97 (1966)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesDonald Ervin Knuth (2010). Selected Papers on Design of Algorithms. Center for the Study of Language and Information.
Michael J. Carroll (1979). Reduction to First Degree in Quantificational S5. Journal of Symbolic Logic 44 (2):207-214.
Thomas Bartz-Beielstein (2008). How Experimental Algorithmics Can Benefit From Mayo's Extensions to Neyman–Pearson Theory of Testing. Synthese 163 (3):385 - 396.
Anita Wasilewska (1984). DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations. Studia Logica 43 (4):395 - 404.
Nobuyoshi Motohashi (1984). A Normal Form Theorem for First Order Formulas and its Application to Gaifman's Splitting Theorem. Journal of Symbolic Logic 49 (4):1262-1267.
Teddy Seidenfeld (1994). When Normal and Extensive Form Decisions Differ. In Dag Prawitz, Brian Skyrms & Dag WesterstĂĄhl (eds.), Logic, Methodology and Philosophy of Science. Elsevier.
Helena Rasiowa (1981). On Logic of Complex Algorithms. Studia Logica 40 (3):289 - 310.
Hongwei Xi (1999). Upper Bounds for Standardizations and an Application. Journal of Symbolic Logic 64 (1):291-303.
Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,507 of 548,941 )Recent downloads (6 months)1 ( #63,511 of 548,941 )How can I increase my downloads? |
My notes
Discussion
