- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Two variable implicational calculi of prescribed many-one degrees of unsolvability
Journal of Symbolic Logic 41 (1):39-44 (1976)
Abstract
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 symbolsLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.D. Bollman & M. Tapia - 1972 - Notre Dame Journal of Formal Logic 13 (1):124-128.
The classification of propositional calculi.Alexander S. Karpenko - 2000 - Studia Logica 66 (2):253-271.
Interpretations of classical implicational sentential calculus in nonclassical implicational calculi.Tadeusz Prucnal - 1974 - Studia Logica 33 (1):59 - 64.
Uniqueness of normal proofs in implicational intuitionistic logic.Takahito Aoto - 1999 - Journal of Logic, Language and Information 8 (2):217-242.
Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.
On the structural completeness of some pure implicational propositional calculi.Tadeusz Prucnal - 1972 - Studia Logica 30 (1):45 - 52.
Variables in Natural Language: Where Do They Come From?'.Jaroslav Peregrin - 2000 - In Michael Böttner & Wolf Thümmel (eds.), Variable-Free Semantics. Secolo. pp. 46--65.
Single premise post canonical forms defined over one-letter alphabets.Charles E. Hughes - 1974 - Journal of Symbolic Logic 39 (3):489-495.
Analytics
Added to PP
2009-01-28
Downloads
23 (#682,406)
6 months
6 (#520,776)
2009-01-28
Downloads
23 (#682,406)
6 months
6 (#520,776)
Historical graph of downloads
Citations of this work
A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems.Egon Börger - 1979 - Mathematical Logic Quarterly 25 (7-12):135-162.
On the number of variables in undecidable superintuitionistic propositional calculi.Grigoriy V. Bokov - 2016 - Logic Journal of the IGPL 24 (5).
References found in this work
A detailed argument for the Post-Linial theorems.Mary Katherine Yntema - 1964 - Notre Dame Journal of Formal Logic 5 (1):37-50.
On the number of variables in the axioms.M. D. Gladstone - 1970 - Notre Dame Journal of Formal Logic 11 (1):1-15.
Triadic partial implicational propositional calculi.Charles E. Hughes - 1975 - Mathematical Logic Quarterly 21 (1):21-28.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5ff6c685cb-rskd8 uwo