# Paul OppenheimerStanford University | SU · Department of Philosophy

Paul Oppenheimer

Master of Arts

## About

15

Publications

1,538

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

482

Citations

Introduction

Paul Oppenheimer does research in metaphysics and logic. One of Paul's current projects investigates fictional objects and fictional properties. Paul is an Associate Editor of the Stanford Encyclopedia of Philosophy and a Visiting Lecturer at the University of Adelaide.

## Publications

Publications (15)

Formulations of Anselm’s ontological argument have been the subject of a number of recent studies. We examine these studies in light of Anselm’s text and (a) respond to criticisms that have surfaced in reaction to our earlier representations of the argument, (b) identify and defend a more refined representation of Anselm’s argument on the basis of...

The target article uses the metaphysics of properties to make its meta-ethical claims. This comment discusses two general points in the metaphysics of properties. The first point has to do with the conditions for property identity. Philosophers who accept the existence of properties have proposed a variety of criteria for their identity. The standa...

In this paper, we present a formalism for handling polysemy in spatial expressions based on supervaluation semantics called standpoint semantics for polysemy (SSP). The goal of this formalism is, given a prepositional phrase, to define its possible spatial interpretations. For this, we propose to characterize spatial prepositions by means of a trip...

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of con- cepts, under this reconstruction, has a non-modal algebra of concepts, a concept-con...

The authors investigated the ontological argument computationally. The premises and conclusion of the argument are represented in the syntax understood by the automated reasoning engine PROVER9. Using the logic of definite descriptions, the authors developed a valid representation of the argument that required three non-logical premises. PROVER9, h...

Though Frege was interested primarily in reducing mathematics to logic, he succeeded in reducing an important part of logic
to mathematics by defining relations in terms of functions. In contrast, Whitehead and Russell reduced an important part of
mathematics to logic by defining functions in terms of relations (using the definite description opera...

This work examines the accuracy of a parallel moving least squares algorithm for solving the governing equations of the hydrodynamic formulation of quantum mechanics. The algorithm solves the associated linear least squares problems using either normal equations or QR factorization. The accuracy of the algorithm is studied for both the free particl...

This article documents the first implementation of a parallel algorithm for solving the governing equations of the hydrodynamic formulation of quantum mechanics. The algorithm employs a quantum trajectory method (QTM) based on the serial algorithm introduced by Wyatt and Lopreore. The OpenMP API is employed to parallelize the code across the quantu...

An abstract is not available.

Using exact diagonalization, we calculate the density of states of the two-dimensional Hubbard model on a 4×4 square lattice at U/t=0.5, 4, and 10, and even number of electrons with filling factors n ranging from a quarter filling up to half filling. We compare the ground-state energy and density of states at U/t=0.5 and 4 with second-order perturb...

An implementation of the Lanczos algorithm for the exact diagonalization of the two dimensional Hubbard model on a 4[times]4 square lattice on the Connection Machine CM-2 system is described. The CM-2 is a massively parallel machine with distributed memory. The program is written in C/PARIS. This implementation minimizes memory usage by generating...