Masanao Ozawa

dblp:45/2176 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
1since 2021 · last 2021
0000-0002-9245-8187ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 4 first-author · 1 since 2021
YearPublicationVenuePosition
2021 Quantum set theory: Transfer Principle and De Morgan's Laws
Masanao Ozawa
Ann. Pure Appl. Log.1
2007 Transfer principle in quantum set theory
abstract
Abstract In 1981, Takeuti introduced quantum set theory as the quantum counterpart of Boolean valued models of set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed subspaces in a Hilbert space and showed that appropriate quantum counterparts of ZFC axioms hold in the model. Here, Takeuti's formulation is extended to construct a model of set theory based on the logic represented by the lattice of projections in an arbitrary von Neumann algebra. A transfer principle is established that enables us to transfer theorems of ZFC to their quantum counterparts holding in the model. The set of real numbers in the model is shown to be in one-to-one correspondence with the set of self-adjoint operators affiliated with the von Neumann algebra generated by the logic. Despite the difficulty pointed out by Takeuti that equality axioms do not generally hold in quantum set theory, it is shown that equality axioms hold for any real numbers in the model. It is also shown that any observational proposition in quantum mechanics can be represented by a corresponding statement for real numbers in the model with the truth value consistent with the standard formulation of quantum mechanics, and that the equality relation between two real numbers in the model is equivalent with the notion of perfect correlation between corresponding observables (self-adjoint operators) in quantum mechanics. The paper is concluded with some remarks on the relevance to quantum set theory of the choice of the implication connective in quantum logic.
Masanao Ozawa
J. Symb. Log.1
2005 Uniformity of quantum circuit families for error-free algorithms
Harumichi Nishimura, Masanao Ozawa
Theor. Comput. Sci.2
2002 Computational complexity of uniform quantum circuit families and quantum Turing machines
Harumichi Nishimura, Masanao Ozawa
Theor. Comput. Sci.2
1995 Scott Incomplete Boolean Ultrapowers of the Real Line
abstract
Abstract An ordered field is said to be Scott complete iff it is complete with respect to its uniform structure. Zakon has asked whether nonstandard real lines are Scott complete. We prove in ZFC that for any complete Boolean algebra B which is not (ω, 2)-distributive there is an ultrafilter of B such that the Boolean ultrapower of the real line modulo is not Scott complete. We also show how forcing in set theory gives rise to examples of Boolean ultrapowers of the real line which are not Scott complete.
Masanao Ozawa
J. Symb. Log.1
1994 Forcing in Nonstandard Analysis
Masanao Ozawa
Ann. Pure Appl. Log.1