After a discussion of the different treatments in the literature of vacuous descriptions, the notion of descriptor is slightly generalized to function descriptor Ⅎ $\overset \rightarrow \to{y}$, so as to form partial functions φ = Ⅎ $y.A$ which satisfy $\forall \overset \rightarrow \to{x}z\leftrightarrow y=z))$. We use logic with existence predicate, as introduced by D. S. Scott, to handle partial functions, and prove that adding function descriptors to a theory based on such a logic is conservative. For theories with quantification over (...) functions, the situation is different: there the addition of Ⅎ yields new theorems in the Ⅎ-free fragment, but an axiomatisation is easily given. The proofs are syntactical. (shrink)

Recently Feferman has outlined a program for the development of a foundation for naive category theory. While Ernst has shown that the resulting axiomatic system is still inconsistent, the purpose of this note is to show that nevertheless some foundation has to be developed before naive category theory can replace axiomatic set theory as a foundational theory for mathematics. It is argued that in naive category theory currently a ‘cookbook recipe’ is used for constructing categories, and it is explicitly shown (...) with a formalized argument that this “foundationless” naive category theory therefore contains a paradox similar to the Russell paradox of naive set theory. (shrink)

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set-theoretic (...) systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic. (shrink)

According to the standard opinions in the literature, blocking the unacceptable consequences of the notorious slingshot argument requires imposing constraints on the metaphysics of facts or on theories of definite descriptions (or class abstracts). This paper argues that both of these well-known strategies to rebut the slingshot overshoot the mark. The slingshot, first and foremost, raises the question as to the adequate logical formalization of statements about facts, i.e. of factual contexts. It will be shown that a rigorous application of (...) Quine’s maxim of shallow analysis to formalizations of factual contexts paves the way for an account of formalizing such contexts which blocks the slingshot without ramifications for theories of facts or definite descriptions. (shrink)

Causal slingshots are formal arguments advanced by proponents of an event ontology of token-level causation which, in the end, are intended to show two things: (i) The logical form of statements expressing causal dependencies on token level features a binary predicate ‘‘... causes ...’’ and (ii) that predicate takes events as arguments. Even though formalisms are only revealing with respect to the logical form of natural language statements, if the latter are shown to be adequately captured within a corresponding formalism, (...) proponents of slingshots usually take the adequacy of their formalizations for granted without justifying it. The first part of this paper argues that the most discussed version of a causal slingshot, viz. the one e.g. presented by Davidson (Essays on actions and events. Oxford, Clarendon Press, 1980), can indeed be refuted for relying on an inadequate formal apparatus. In contrast, the formal means of Gödel’s (The philosophy of Betrand Russell. New York, Tudor, 1944) often neglected slingshot are shown to stand on solid ground in the second part of the paper. Nonetheless, I contend that Gödel’s slingshot does only half the work friends of event causation would like it to do. It provides good reasons for (i) but not for (ii). (shrink)

Attempts to lay a foundation for the sciences based on modern mathematics are questioned. In particular, it is not clear that computer science should be based on set-theoretic mathematics. Set-theoretic mathematics has difficulties with its own foundations, making it reasonable to explore alternative foundations for the sciences. The role of computation within an alternative framework may prove to be of great potential in establishing a direction for the new field of computer science.Whitehead''s theory of reality is re-examined as a foundation (...) for the sciences. His theory does not simply attempt to add formal rigor to the sciences, but instead relies on the methods of the biological and social sciences to construct his world-view. Whitehead''s theory is a rich source of notions that are intended to explain every element of experience. It is a product of Whitehead''s earlier attempt to provide a mathematical foundation for the physical sciences and is still consistent with modern physics. (shrink)