scientific article; zbMATH DE number 107724
From MaRDI portal
Publication:4023306
Recommendations
- Expressive completeness and decidability
- scientific article; zbMATH DE number 4164803
- scientific article; zbMATH DE number 3861119
- Nonexistence of algorithms for recognizing syntactic expressibility in logic calculi. With a foreword by Iu. Reabuhin
- Semantic characterization of intuitionistic logical connectives
Cited in
(12)- A new variant of the Gödel-Malcev theorem for the classical propositional calculus and correction to my paper: ``The connective of necessity of modal logic \(S_ 5\) is metalogical
- Completeness proofs for propositional logic with polynomial-time connectives
- Explicit definitions of implicitly definable objects in some modal logics
- The connective of necessity of modal logic \(S_ 5\) is metalogical
- scientific article; zbMATH DE number 3863173 (Why is no real title available?)
- Nonexistence of algorithms for recognizing syntactic expressibility in logic calculi. With a foreword by Iu. Reabuhin
- On univocal connectives
- scientific article; zbMATH DE number 4164803 (Why is no real title available?)
- The metatheory of the classical propositional calculus is not axiomatizable
- From arithmetic expressions to propositional formulae
- On some classes of formulas in S5 which are pre-complete relative to existential expressibility
- Expressive power and incompleteness of propositional logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023306)