Apparent Generalisations about Fictional Characters

2014 ◽  
Vol 8 (2) ◽  
Author(s):  
Dolf Rami

AbstractThis essay will be concerned with an evaluation, modification, and critique of van Inwagen’s famous argument for the existence of fictional characters. In the first section a reconstruction of the original argument will be provided, and three different challenges for this version of the argument will be pointed out. The first challenge concerns van Inwagen’s commitment to first-order predicate logic as a canonical language for the formal representation of truth-conditions of assertoric sentences in natural languages, and the problematic semantic complexity of van Inwagen’s original example sentences of quantifications about fictional objects. The second challenge concerns his commitment to a Quinean conception of ordinary language quantifications that conceives of first-order quantifiers as existentially loaded. The third challenge concerns van Inwagen’s tendency to interpret our ordinary intuitions about the truth-values of specific sentences as intuitions about the truth-values of the literal contents of these sentences. In the second section, a more detailed investigation of these three challenges will be provided; and a modified, and less problematic, alternative version of the argument will be proposed. It will be shown that the truth-conditions of van Inwagen’s original example sentences cannot be adequately represented on the basis of first-order predicate logic. I will propose alternative and less complex example sentences that are sufficient for the required purpose. Additionally, a reformulation of the argument will be proposed that avoids a commitment to a specific sort of formal framework. After that, it will be shown why the assumption of a Quinean conception of quantification unnecessarily increases the burden of proof. A reformulation of the argument will be proposed that avoids the commitment to a Quinean conception of quantification. Furthermore, I will make a third and final adjustment of the argument that allows us to remain neutral concerning the specific status of our truth-value intuitions concerning the proposed example sentences of generalisations about fictional objects. In the third and final section, three possible responses of an irrealist concerning fictional objects will be evaluated. The first option makes use of a recent semantic analysis of the modifying adjective ›fictional‹ proposed by Sainsbury. According to this analysis, a sentence like ›There are fictional mice that talk‹ is semantically equivalent with the claim ›There are fictional works according to which it is the case that at least one mouse talks‹. The second option additionally makes use of Sainsbury’s conception of spotty scope for ordinary language quantifiers and other related sentential operators. It will be shown why both options cannot account for the desired true readings of our example sentences. Finally, a third solution will be proposed and defended. This solution makes use of a substitutional interpretation of specific fictional generalisations based on a negative free logic to undermine the modified argument. It will be shown how this solution allows us to provide a correct analysis of the desired readings of our example sentences of generalisations about fictional characters. After that, two problems of this account will be discussed. The first problem concerns the extension of the proposed strategy to more complicated and sophisticated example sentences. The second problem concerns the independent motivation of a substitutional treatment of at least certain natural language quantificational expressions.

Axioms ◽  
2019 ◽  
Vol 8 (4) ◽  
pp. 109 ◽  
Author(s):  
Malec

The aim of this article is to present a method of creating deontic logics as axiomatic theories built on first-order predicate logic with identity. In the article, these theories are constructed as theories of legal events or as theories of acts. Legal events are understood as sequences (strings) of elementary situations in Wolniewicz′s sense. On the other hand, acts are understood as two-element legal events: the first element of a sequence is a choice situation (a situation that will be changed by an act), and the second element of this sequence is a chosen situation (a situation that arises as a result of that act). In this approach, legal rules (i.e., orders, bans, permits) are treated as sets of legal events. The article presents four deontic systems for legal events: AEP, AEPF, AEPOF, AEPOFI. In the first system, all legal events are permitted; in the second, they are permitted or forbidden; in the third, they are permitted, ordered or forbidden; and in the fourth, they are permitted, ordered, forbidden or irrelevant. Then, we present a deontic logic for acts (AAPOF), in which every act is permitted, ordered or forbidden. The theorems of this logic reflect deontic relations between acts as well as between acts and their parts. The direct inspiration to develop the approach presented in the article was the book Ontology of Situations by Boguslaw Wolniewicz, and indirectly, Wittgenstein’s Tractatus Logico-Philosophicus.


1962 ◽  
Vol 27 (1) ◽  
pp. 58-72 ◽  
Author(s):  
Timothy Smiley

Anyone who reads Aristotle, knowing something about modern logic and nothing about its history, must ask himself why the syllogistic cannot be translated as it stands into the logic of quantification. It is now more than twenty years since the invention of the requisite framework, the logic of many-sorted quantification.In the familiar first-order predicate logic generality is expressed by means of variables and quantifiers, and each interpretation of the system is based upon the choice of some class over which the variables may range, the only restriction placed on this ‘domain of individuals’ being that it should not be empty.


1999 ◽  
Vol 9 (4) ◽  
pp. 335-359 ◽  
Author(s):  
HERMAN GEUVERS ◽  
ERIK BARENDSEN

We look at two different ways of interpreting logic in the dependent type system λP. The first is by a direct formulas-as-types interpretation à la Howard where the logical derivation rules are mapped to derivation rules in the type system. The second is by viewing λP as a Logical Framework, following Harper et al. (1987) and Harper et al. (1993). The type system is then used as the meta-language in which various logics can be coded.We give a (brief) overview of known (syntactical) results about λP. Then we discuss two issues in some more detail. The first is the completeness of the formulas-as-types embedding of minimal first-order predicate logic into λP. This is a remarkably complicated issue, a first proof of which appeared in Geuvers (1993), following ideas in Barendsen and Geuvers (1989) and Swaen (1989). The second issue is the minimality of λP as a logical framework. We will show that some of the rules are actually superfluous (even though they contribute nicely to the generality of the presentation of λP).At the same time we will attempt to provide a gentle introduction to λP and its various aspects and we will try to use little inside knowledge.


1986 ◽  
pp. 155-183
Author(s):  
Igor Aleksander ◽  
Henri Farreny ◽  
Malik Ghallab

1992 ◽  
Vol 71 (3_suppl) ◽  
pp. 1091-1104 ◽  
Author(s):  
Peter E. Langford ◽  
Robert Hunting

480 adolescents and young adults between the ages of 12 and 29 years participated in an experiment in which they were asked to evaluate hypotheses from quantified first-order predicate logic specifying that certain classes of event were necessarily, possibly, or certainly not included within a universe of discourse. Results were used to test a two-stage model of performance on hypothesis evaluation tasks that originated in work on the evaluation of conditionals. The two-stage model, unlike others available, successfully predicted the range of patterns of reply observed. In dealing with very simple hypotheses subjects in this age range tended not to make use of alternative hypotheses unless these were explicitly or implicitly suggested to them by the task. This tells against complexity of hypothesis as an explanation of the reluctance to use alternative hypotheses in evaluating standard conditionals.


1967 ◽  
Vol 32 (1) ◽  
pp. 23-46 ◽  
Author(s):  
H. Jerome Keisler

In this paper we continue our study, begun in [5], of the connection between ultraproducts and saturated structures. IfDis an ultrafilter over a setI, andis a structure (i.e., a model for a first order predicate logicℒ), the ultrapower ofmoduloDis denoted byD-prod. The ultrapower is important because it is a method of constructing structures which are elementarily equivalent to a given structure(see Frayne-Morel-Scott [3]). Our ultimate aim is to find out what kinds of structure are ultrapowers of. We made a beginning in [5] by proving that, assuming the generalized continuum hypothesis (GCH), for each cardinalαthere is an ultrafilterDover a set of powerαsuch that for all structures,D-prodisα+-saturated.


Sign in / Sign up

Export Citation Format

Share Document