An unsolvable problem concerning implicational calculi.
نویسندگان
چکیده
منابع مشابه
An Unsolvable Problem of Elementary Number Theory
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملThe unsolvable identity problem
The identity problem is intractable. To shed light on the problem, which currently is a swirl of interlocking problems that tend to get tumbled together in any discussion, we separate out the various issues so they can be rationally addressed one at a time as much as possible. We explore various aspects of the problem, pick one aspect to focus on, pose an idealized theoretical solution, and the...
متن کاملLabelled Sequent Calculi and Completeness Theorems for Implicational Relevant Logics
It is known that the implicational fragment of the relevant logic E is complete with respect to the class of Urquhart's models, where a model consists of a semilattice and a set of possible worlds. This paper shows that some implicational relevant logics, which are obtained from E by adding axioms, are complete with respect to the class of Urquhart's models with certain conditions. To show this...
متن کاملPrecious Metals in Automotive Technology: An Unsolvable Depletion Problem?
Since the second half of the 20th century, various devices have been developed in order to reduce the emissions of harmful substances at the exhaust pipe of combustion engines. In the automotive field, the most diffuse and best known device of this kind is the “three way” catalytic converter for engines using the Otto cycle designed to abate the emissions of carbon monoxide, nitrogen oxides and...
متن کاملA Note on Decision Problems for Implicational Sequent Calculi
We investigate cut-eliminability and decidability for implicational sequent calculi with prime contraction. The prime contraction is a restricted version of the contraction rule in LJ (the rule does not permit the contraction of implication formulas). Decision problems for the implicational sequent calculi LBB′IW (the system for the logic BB′IW) and FLc→ (the implicational fragment of the full ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1970
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093893936