Axiom schemes for m-valued propositions calculi

DOI10.2307/2267026zbMATH Open0063.06587OpenAlexW2013680190WikidataQ114589273 ScholiaQ114589273MaRDI QIDQ5845641FDOQ5845641

Authors: Atwell R. Turquette, J. Barkley Rosser 

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Cited In (43)

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

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)