- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the equational theory of projection lattices of finite von Neumann factors
Journal of Symbolic Logic 75 (3):1102-1110 (2010)
Abstract
For a finite von Neumann algebra factor M, the projections form a modular ortholattice L(M). We show that the equational theory of L(M) coincides with that of some resp. all L(ℂ n × n ) and is decidable. In contrast, the uniform word problem for the variety generated by all L(ℂ n × n ) is shown to be undecidableLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Decidability of the Equational Theory of the Continuous Geometry CG(\Bbb {F}).John Harding - 2013 - Journal of Philosophical Logic 42 (3):461-465.
Intuitionistic Quantum Logic of an n-level System.Martijn Caspers, Chris Heunen, Nicolaas P. Landsman & Bas Spitters - 2009 - Foundations of Physics 39 (7):731-759.
Inherently nonfinitely based lattices.Ralph Freese, George F. McNulty & J. B. Nation - 2002 - Annals of Pure and Applied Logic 115 (1-3):175-193.
Von Neumann coordinatization is not first-order.Friedrich Wehrung - 2006 - Journal of Mathematical Logic 6 (01):1-24.
A preservation theorem for ec-structures with applications.Michael H. Albert - 1987 - Journal of Symbolic Logic 52 (3):779-785.
Elementary equivalence of some rings of definable functions.Vincent Astier - 2008 - Archive for Mathematical Logic 47 (4):327-340.
A Generalization of the Łukasiewicz Algebras.Teresa Almada & JÚlia Vaz de Carvalho - 2001 - Studia Logica 69 (3):329 - 338.
Review: V. L. Murskii, D. M. Pritzker, Nondiscernible Properties of Finite Systems of Identity Relations; George F. McNulty, The Decision Problem for Equational Bases of Algebras; George F. McNulty, Undecidable Properties of Finite Sets of Equations. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
Type-Decomposition of a Synaptic Algebra.David J. Foulis & Sylvia Pulmannová - 2013 - Foundations of Physics 43 (8):948-968.
Analytics
Added to PP
2010-09-12
Downloads
53 (#309,323)
6 months
11 (#271,859)
2010-09-12
Downloads
53 (#309,323)
6 months
11 (#271,859)
Historical graph of downloads
Citations of this work
Decidability of the Equational Theory of the Continuous Geometry CG(\Bbb {F}).John Harding - 2013 - Journal of Philosophical Logic 42 (3):461-465.
References found in this work
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1952 - Journal of Symbolic Logic 17 (3):207-207.
A Decision Method for Elementary Algebra and Geometry.Alfred Tarski - 1949 - Journal of Symbolic Logic 14 (3):188-188.
Quantum logic as motivated by quantum computing.J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss & Zhenghan Wang - 2005 - Journal of Symbolic Logic 70 (2):353-359.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-7qn45 uwo