A theory of computation based on quantum logic. I

DOI10.1016/j.tcs.2005.04.001zbMath1079.68035OpenAlexW2087997688MaRDI QIDQ2575078

Ming Sheng Ying

Publication date: 5 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.04.001

zbMATH Keywords

orthomodular latticequantum computationalgebraic semanticsquantum logicfinite automataregular languages

Mathematics Subject Classification ID

Related Items (25)

Notes on automata theory based on quantum logic ⋮ On intuitionistic fuzzy context-free languages ⋮ Automata theory based on quantum logic: recognizability and accessibility ⋮ WEIGHTED NESTED WORD AUTOMATA AND LOGICS OVER STRONG BIMONOIDS ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ Quantum set theory: transfer principle and De Morgan's laws ⋮ Fuzzy grammar theory based on lattices ⋮ Model checking computation tree logic over finite lattices ⋮ A BRIDGE BETWEEN Q-WORLDS ⋮ Automata theory based on lattice-ordered semirings ⋮ Finite automata theory with membership values in lattices ⋮ A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata ⋮ Weak QMV algebras and some ring-like structures ⋮ Weak Second‐Order Arithmetic and Finite Automata ⋮ Computing power of Turing machines in the framework of unsharp quantum logic ⋮ Quantum Reversible Fuzzy Grammars ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Automata theory based on unsharp quantum logic ⋮ Weighted automata and multi-valued logics over arbitrary bounded lattices ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ Natural deduction for quantum logic ⋮ Characterization of tree automata based on quantum logic

Cites Work

• Three-valued logics: An introduction, a comparison of various logical lexica, and some philosophical remarks
• Constructivism in mathematics. An introduction. Volume II
• Present trends in pure mathematics
• Fuzzifying topology based on complete residuated lattice-valued logic. I
• Quantum automata and quantum grammars
• Automata theory based on quantum logic. I
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Quantum implication
• Implication connectives in orthomodular lattices
• A new approach for fuzzy topology. I
• Quantum computational networks
• Orthologic and quantum logic
• The deduction theorem for quantum logic—some negative results
• Deduction Theorem for Many‐Valued Inference
• Orthomodular Logic
• Quantum theory, the Church–Turing principle and the universal quantum computer
• THE FUNDAMENTAL THEOREM OF ULTRAPRODUCT IN PAVELKA'S LOGIC
• COMPACTNESS, THE LÖWENHEIM‐SKOLEM PROPERTY AND THE DIRECT PRODUCT OF LATTICES OF TRUTH VALUES
• A logic for approximate reasoning
• Toward quantum mathematics. I. From quantum set theory to universal quantum mechanics
• Quantum logic as an implication algebra
• Logical Reversibility of Computation
• Axiom schemes for m-valued propositions calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A theory of computation based on quantum logic. I