Nondecidable intermediate calculus

DOI10.1007/BF01669131zbMATH Open0528.03028OpenAlexW2018445849MaRDI QIDQ786806FDOQ786806

Authors: Sergey Popov 

Publication date: 1982

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187160

Recommendations

• Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication
• Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi
• Undecidable iterative propositional calculus
• Undecidable problems for propositional calculi with implication
• The method of axiomatic rejection for the intuitionistic propositional logic

zbMATH Keywords

nondecidable intermediate propositional calculirecursively nondecidable Post production systems

Mathematics Subject Classification ID

Intermediate logics (03B55) Thue and Post systems, etc. (03D03) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication

This page was built for publication: Nondecidable intermediate calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786806)