On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi

DOI10.1002/MALQ.19850312103zbMATH Open0596.03004OpenAlexW2124164632MaRDI QIDQ3727948

Teodor Stȩpień

Publication date: 1985

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19850312103

zbMATH Keywords

predicate calculuspropositional calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On predicate provability logics and binumerations of fragments of Peano arithmetic 👍 👎
• On the number of new logical constants in intuitionistic propositional calculus 👍 👎
• The complexity of predicate default logic over a countable domain 👍 👎
• A Lindström theorem for intuitionistic propositional logic 👍 👎
• The number of {□, →}-logics 👍 👎
• A GENERALIZATION OF LINDENBAUM'S THEOREM FOR PREDICATE CALCULI 👍 👎
• On the linear Lindenbaum algebra of Basic Propositional Logic 👍 👎
• On evaluations of propositional formulas in countable structures 👍 👎

This page was built for publication: On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi

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