Axiom schemes for m-valued propositions calculi

DOI10.2307/2267026zbMath0063.06587OpenAlexW2013680190WikidataQ114589273 ScholiaQ114589273MaRDI QIDQ5845641

Atwell R. Turquette

Publication date: 1945

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2267026

zbMATH Keywords

formalizationtruth-value functions\(m\)-valued propositional calculusdesignated and undesignated truth values

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Related Items (37)

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

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