Pages that link to "Item:Q5845641"
From MaRDI portal
The following pages link to Axiom schemes for <i>m</i>-valued propositions calculi (Q5845641):
Displaying 38 items.
- Nice embedding in classical logic (Q300555) (← links)
- Hilbert-style axiom systems for the matrix-based logics \(\mathrm{RMQ}^-\) and \(\mathrm{RMQ}^\ast\) (Q497423) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- Programming in three-valued logic (Q753474) (← links)
- Quantum conservative many-valued computing (Q835101) (← links)
- Pumping lemma in automata theory based on complete residuated lattice-valued logic: a note (Q853474) (← links)
- Completely continuous functions and \(R\)-map in fuzzifying topological space (Q868305) (← links)
- Automata theory based on complete residuated lattice-valued logic: Reduction and minimization (Q983034) (← links)
- Pumping Lemma in context-free grammar theory based on complete residuated lattice-valued logic (Q1037930) (← links)
- Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras (Q1066930) (← links)
- Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← links)
- Logical operators on complete lattices (Q1174337) (← links)
- On many-valued logics, fuzzy sets, fuzzy logics and their applications (Q1253247) (← links)
- Fuzzifying topology based on complete residuated lattice-valued logic. I (Q1313033) (← links)
- Characterizations of fuzzy finite automata. (Q1426246) (← links)
- Analysis of billiard ball computation using phase space logics (Q1586914) (← links)
- Characterizations of complete residuated lattice-valued finite tree automata (Q1759726) (← links)
- A comment on ``Automata theory based on complete residuated lattice-valued logic: pushdown automata'' (Q1759734) (← links)
- Optimal axiomatizations of finitely valued logics (Q1854378) (← links)
- Fuzzifying topological linear spaces (Q1887100) (← links)
- Foundations of fuzzy sets (Q2277254) (← links)
- N-ary selection functions and formal selective systems. I (Q2541029) (← links)
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics (Q2563461) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- Fuzzy sets in approximate reasoning. II: Logical approaches (Q2641292) (← links)
- Completeness of Lukasiewicz-Tarski propositional calculi (Q2648957) (← links)
- Conditioned disjunction as a primitive connective for the \(m\)-valued propositional calculus (Q2649134) (← links)
- Systems of logic whose truth-values form lattices (Q2649513) (← links)
- A formalisation of Post's \(m\)-valued propositional calculus (Q2650389) (← links)
- On some extensions of the class of MV-algebras (Q2987756) (← links)
- A Strongly Complete Formalisation of a 5-Valued Propositional Calculus (Q3770501) (← links)
- Two, Many, and Differently Many (Q5350334) (← links)
- A theorem about infinite-valued sentential logic (Q5804993) (← links)
- Identities in Two-Valued Calculi (Q5806804) (← links)
- \(\alpha\)-resolution principle based on lattice-valued propositional logic \(\text{LP} (X)\) (Q5946276) (← links)
- \(\alpha\)-resolution principle based on first-order lattice-valued logic \(\text{LF}(X)\) (Q5946327) (← links)
