On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate
Journal of Symbolic Logic 4 (1):1-9 (1939)
| 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,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesW. Ackermann (1954). Solvable Cases of the Decision Problem. Amsterdam, North-Holland Pub. Co..
M. Albert (2007). The Propensity Theory: A Decision-Theoretic Restatement. Synthese 156 (3):587 - 603.
Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
Laszlo Kalmar & Janos Suranyi (1947). On the Reduction of the Decision Problem. Journal of Symbolic Logic 12 (3).
László Kalmár & János Surányi (1947). On the Reduction of the Decision Problem. Journal of Symbolic Logic 12 (3):65-73.
Charles E. Hughes (1976). A Reduction Class Containing Formulas with One Monadic Predicate and One Binary Function Symbol. Journal of Symbolic Logic 41 (1):45-49.
Laszlo Kalmar & Janos Suranyi (1950). On the Reduction of the Decision Problem: Third Paper. Pepis Prefix, a Single Binary Predicate. Journal of Symbolic Logic 15 (3).
László Kalmár & János Surányi (1950). On the Reduction of the Decision Problem: Third Paper. Pepis Prefix, a Single Binary Predicate. Journal of Symbolic Logic 15 (3):161-173.
Laszlo Kalmar (1939). On the Reduction of the Decision Problem. First Paper. Ackermann Prefix, a Single Binary Predicate. Journal of Symbolic Logic 4 (1).
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #201,930 of 549,088 )Recent downloads (6 months)1 ( #63,317 of 549,088 )How can I increase my downloads? |
My notes
Discussion
