Computer Science – Logic in Computer Science
Scientific paper
2008-12-15
Journal of Logic and Computation, 18 (6) 959-982 (2008)
Computer Science
Logic in Computer Science
35 pages, 3 figures
Scientific paper
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes, respectively. In this paper we prove that these logics are complete even for those classes of the former lattices from which the standard orthomodular lattices and Boolean algebras are excluded. We also show that neither quantum nor classical computers can be founded on the latter models. It follows that logics are "valuation-nonmonotonic" in the sense that their possible models (corresponding to their possible hardware implementations) and the valuations for them drastically change when we add new conditions to their defining conditions. These valuations can even be completely separated by putting them into disjoint lattice classes by a technique presented in the paper.
Megill Norman D.
Pavicic Mladen
No associations
LandOfFree
Standard Logics Are Valuation-Nonmonotonic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Standard Logics Are Valuation-Nonmonotonic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Standard Logics Are Valuation-Nonmonotonic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-348307