The general topic of this paper is the ontological commitment to so-called "fictitious objects", that is, things and characters of fictional stories, like Sherlock Holmes and Pegasus. Discourse about fiction seems to entail an ontological commitment to fictitious entities, a commitment that is often deemed inconsistent with empirical facts. For instance, "Pegasus is a flying horse" seems to entail "There are flying horses" as well as "Pegasus exists" (according to some widely accepted logical principles). I discuss two solutions that have (...) been proposed in the literature. The first one amounts to rejecting sentences like "Pegasus is a flying horse" as false, at least if they are taken at face value. This solution is called the "story operator strategy". It consists in paraphrasing sentences like "Pegasus is a flying horse" by means of the expression "according to a story" such that they are interpreted as an elliptic formulation of, e.g., "According to a story, Pegasus is a flying horse". I spell out the difficulties of the story operator strategy and opt for a realist ontology of fiction. A novel interpretation of the story operator "according to a story" is given, which is not only consistent with but even sheds new light on such a realist ontology. In particular, it is shown how the story operator can be used as a tool to introduce the so-called "modes of predication distinction" (which is an essential ingredient of many realist ontologies of fiction) in a commonsensical way. (shrink)

Gentzen’s and Jaśkowski’s formulations of natural deduction are logically equivalent in the normal sense of those words. However, Gentzen’s formulation more straightforwardly lends itself both to a normalization theorem and to a theory of “meaning” for connectives . The present paper investigates cases where Jaskowski’s formulation seems better suited. These cases range from the phenomenology and epistemology of proof construction to the ways to incorporate novel logical connectives into the language. We close with a demonstration of this latter aspect by (...) considering a Sheffer function for intuitionistic logic. (shrink)

Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms — first-order logic, type theory, and set theory — are usually only adequate for reasoning about partial functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein practice. This paper shows how the traditional approach to partial functions (...) can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann—Bernays—Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems. (shrink)