Results

**1 - 4**of**4**### Recent Developments in Computing and Philosophy

"... Because the label "computing and philosophy " can seem like an ad hoc attempt to tie computing to philosophy, it is important to explain why it is not, what it studies (or does) and how it differs from research in, say, "computing and history, " or "computing and biology&quo ..."

Abstract
- Add to MetaCart

Because the label "computing and philosophy " can seem like an ad hoc attempt to tie computing to philosophy, it is important to explain why it is not, what it studies (or does) and how it differs from research in, say, "computing and history, " or "computing and biology". The American Association for History and Computing is "dedicated to the reasonable and productive marriage of history and computer technology for teaching, researching and representing history through scholarship and public history "

### • allow relations F n and G n (n ≥ 1) to be distinct even when The Theory of Relations, Complex Terms, and a Connection Between λ and ɛ Calculi

"... This paper introduces a new method of interpreting complex relation terms in a second-order quantified modal language. We develop a completely general second-order modal language with two kinds of complex terms: one kind for denoting individuals and one kind for denoting n-place relations. Several i ..."

Abstract
- Add to MetaCart

(Show Context)
This paper introduces a new method of interpreting complex relation terms in a second-order quantified modal language. We develop a completely general second-order modal language with two kinds of complex terms: one kind for denoting individuals and one kind for denoting n-place relations. Several issues arise in connection with previous, algebraic methods for interpreting the relation terms. The new method of interpreting these terms described here addresses those issues while establishing an interesting connection between λ and ɛ calculi. The resulting semantics provides a precise understanding of the theory of relations. Consider a second-order language with quantification over both individuals and n-place relations (n ≥ 0), a modal operator, definite descriptions (i.e., complex individual terms, interpreted rigidly for simplicity), and λ-expressions (i.e., complex n-place relation terms). The

### and

"... Our computational metaphysics group describes its use of au-tomated 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 concepts, under this reconstruction, h ..."

Abstract
- Add to MetaCart

(Show Context)
Our computational metaphysics group describes its use of au-tomated 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 concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means of automated theorem provers and finite model builders. The fundamental theo-rem of Leibniz’s theory is derived using these tools. 1