Two variable implicational calculi of prescribed many-one degrees of unsolvability

Journal of Symbolic Logic 41 (1):39-44 (1976)
A constructive proof is given which shows that every nonrecursive r.e. many-one degree is represented by the family of decision problems for partial implicational propositional calculi whose well-formed formulas contain at most two distinct variable symbols
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2272943
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,433
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
M. D. Gladstone (1970). On the Number of Variables in the Axioms. Notre Dame Journal of Formal Logic 11 (1):1-15.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #614,823 of 1,925,045 )

Recent downloads (6 months)

1 ( #418,130 of 1,925,045 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.