Three ways of recognizing inessential formulas in sequents

DOI10.1007/BF01629445MaRDI QIDQ1167722zbMATH OpenOpenAlexFDO

Authors V. P. Orevkov

Publication date 1982

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01629445

zbMATH Keywords

derivabilityhereditary unsolvabilityintuitionistic equality theoryintuitionistic monadic predicate calculusunessential formulas in classical and intuitionistic predicate calculus

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Classical first-order logic (03B10) Complexity of proofs (03F20) Intuitionistic mathematics (03F55)

Cites work

• scientific article; zbMATH DE number 3261581 (Why is no real title available?)
• scientific article; zbMATH DE number 3275580 (Why is no real title available?)
• scientific article; zbMATH DE number 3298856 (Why is no real title available?)
• scientific article; zbMATH DE number 3296225 (Why is no real title available?)
• Elementary intuitionistic theories

This page was built for publication: Three ways of recognizing inessential formulas in sequents

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