Review: A. Janiczak, On the Reducibility of Decision Problems [Book Review]

Journal of Symbolic Logic 21 (1):100-101 (1956)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268529

Links

PhilArchive



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

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: A. Janiczak, Some Remarks on Partially Recursive Functions. [REVIEW]Rózsa Péter - 1956 - Journal of Symbolic Logic 21 (1):101-101.
Review: Antoni Janiczak, A Remark Concerning Decidability of Complete Theories. [REVIEW]Rózsa Péter - 1951 - Journal of Symbolic Logic 16 (2):146-147.
Reducibility Relationships Between Decision Problems for System Functions.M. B. Thuraisingham - 1987 - Mathematical Logic Quarterly 33 (4):305-312.
A New Reducibility between Turing‐ and wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
A characterization of the Δ⁰₂ hyperhyperimmune sets.Roland Sh Omanadze & Andrea Sorbi - 2008 - Journal of Symbolic Logic 73 (4):1407-1415.
Review: H. G. Rice, Classes of Recursively Enumerable Sets and their Decision Problems. [REVIEW]Rózsa Péter - 1954 - Journal of Symbolic Logic 19 (2):121-122.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Review: A. Janiczak, Undecidability of Some Simple Formalized Theories. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (2):217-217.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Bounds in the Turing reducibility of functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
Supervenience and reducibility: An odd couple.Ausonio Marras - 1994 - Philosophical Quarterly 44 (171):215-222.
Review: Richard M. Karp, Raymond E. Miller, James W. Thatcher, Reducibility Among Combinatorial Problems. [REVIEW]Ronald V. Book - 1975 - Journal of Symbolic Logic 40 (4):618-619.
On the logic of reducibility: Axioms and examples. [REVIEW]Karl-Georg Niebergall - 2000 - Erkenntnis 53 (1-2):27-61.
Intentions and interactive transformations of decision problems.Olivier Roy - 2009 - Synthese 169 (2):335 - 349.

Analytics

Added to PP
2013-11-22

Downloads
3 (#1,715,951)

6 months
2 (#1,206,802)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references