Axiom schemes for m-valued propositions calculi

Recommendations

Formalisations of Many‐Valued Propositional Calculi with Variable Functors
A Strongly Complete Formalisation of a 5-Valued Propositional Calculus
Many-Valued Modal Propositional Calculi
A Formalisation of an ℵ₀‐Valued Propositional Calculus with Variable Functors
scientific article; zbMATH DE number 3877155

Cited in

(43)

An Axiomatic Value Model for Isabelle/UTP
Programming in three-valued logic
Optimal axiomatizations of finitely valued logics
Systems of logic whose truth-values form lattices
A Simplified Self m‐AL Set of Primitive Functors for the m‐Valued Propositional Calculus
A Strongly Complete Formalisation of a 5-Valued Propositional Calculus
Analysis of billiard ball computation using phase space logics
A theorem about infinite-valued sentential logic
Foundations of fuzzy sets
N-ary selection functions and formal selective systems. I
scientific article; zbMATH DE number 3639588 (Why is no real title available?)
Quantum conservative many-valued computing
Self-dual binary and ternary connectives for \(m\)-valued propositional calculi
scientific article; zbMATH DE number 3957059 (Why is no real title available?)
Automata theory based on complete residuated lattice-valued logic: Turing machines
Fuzzifying topological linear spaces
Completeness of Lukasiewicz-Tarski propositional calculi
A formalisation of Post's \(m\)-valued propositional calculus
A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata
Two, Many, and Differently Many
Logical operators on complete lattices
Automata theory based on complete residuated lattice-valued logic: Reduction and minimization
Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic
Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note
Automata theory based on quantum logic: Some characterizations
Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
On many-valued logics, fuzzy sets, fuzzy logics and their applications
Identities in Two-Valued Calculi
Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
Completely continuous functions and \(R\)-map in fuzzifying topological space
A theory of computation based on quantum logic. I
Word operation definable in the typed \(\lambda\)-calculus
\(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\)
Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras
Fuzzifying topology based on complete residuated lattice-valued logic. I
Hilbert-style axiom systems for the matrix-based logics \(\mathrm{RMQ}^-\) and \(\mathrm{RMQ}^\ast\)
On some extensions of the class of MV-algebras
Fuzzy sets in approximate reasoning. II: Logical approaches
Nice embedding in classical logic
Characterizations of fuzzy finite automata.
Characterizations of complete residuated lattice-valued finite tree automata
\(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\)

This page was built for publication: Axiom schemes for m-valued propositions calculi

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