The general expression of formulas in two-valued propositional logic F(S_n) in the meaning of logical equivalence
From MaRDI portal
Publication:3403597
Recommendations
- The restricted logic equivalence relation in two-valued propositional logic and its applications
- Simplification of many-valued logic formulas using anti-links
- Possibilities of logically equivalent expressions
- Mathematical Foundations of Computer Science 2003
- Convergence of a formula sequence in two-valued propositional logic
Cited in
(7)- The restricted logic equivalence relation in two-valued propositional logic and its applications
- Convergence of a formula sequence in two-valued propositional logic
- A 16-classification partition of formula set \(F(S)\) in revised Kleene system \(\overline W\)
- scientific article; zbMATH DE number 3161193 (Why is no real title available?)
- scientific article; zbMATH DE number 3176035 (Why is no real title available?)
- About the one question of implementation of the logic of sentences
- Features of equivalence in the complex \(s\)-logic
This page was built for publication: The general expression of formulas in two-valued propositional logic \(F(S_n)\) in the meaning of logical equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3403597)