1. Erfðir og uppeldi.--2. Siðmenning og siðgæði.

It is widely accepted that a theory of truth for arithmetic should be consistent, but -consistency is a highly desirable feature for such theories. The point has already been made for first-order languages, though the evidence is not entirely conclusive. We show that in the second-order case the consequence of adopting -inconsistent theories of truth are considered: the revision theory of nearly stable truth T # and the classical theory of symmetric truth FS. Briefly, we present some conceptual problems with (...) ω-inconsistent theories, and demonstrate some technical results that support our criticisms of such theories. (shrink)

This chapter contains sections titled: Introduction Scenario 1: The World According to Adam Swift Scenario 2: The World According to Plato Scenario 3: The World According to Adam Smith Conclusion: The Three Fs Notes References.

The ubiquitous schema ‘All Fs are Gs’ dominates much philosophical discussion on laws but rarely is it shown how actual laws mentioned and used in science are supposed to fit it. After consideration of a variety of laws, including those obviously conditional and those superficially not conditional, I argue that we have good reason to support the traditional interpretation of laws as conditionals of some quantified form with a single object variable. I show how this conclusion impacts on the status (...) of ‘system laws’ and the significance of having only one object variable with regard to the relationship between laws and causal relations. (shrink)

We introduce the computable FS-jump, an analog of the classical Friedman–Stanley jump in the context of equivalence relations on the natural numbers. We prove that the computable FS-jump is proper with respect to computable reducibility. We then study the effect of the computable FS-jump on computably enumerable equivalence relations (ceers).

On reading the last sentence, did you interpret me as saying falsely that everything — everything in the entire universe — was packed into my carry-on baggage? Probably not. In ordinary language, ‘everything’ and other quantifiers (‘something’, ‘nothing’, ‘every dog’, ...) often carry a tacit restriction to a domain of contextually relevant objects, such as the things that I need to take with me on my journey. Thus a sentence of the form ‘Everything Fs’ is true as uttered in a (...) context C if and only if everything that is relevant in C satisfies the predicate ‘F’; ‘everything’ ranges just over the contextually relevant things. Such generality is restricted in a context-relative way. (shrink)

The feature selection (FS) process has an essential effect in solving many problems such as prediction, regression, and classification to get the optimal solution. For solving classification problems, selecting the most relevant features of a dataset leads to better classification accuracy with low training time. In this work, a hybrid binary crow search algorithm (BCSA) based quasi-oppositional (QO) method is proposed as an FS method based on wrapper mode to solve a classification problem. The QO method was employed in tuning (...) the value of flight length in the BCSA which is controlling the ability of the crows to find the optimal solution. To evaluate the performance of the proposed method, four benchmark datasets have been used which are human intestinal absorption, HDAC8 inhibitory activity (IC50), P-glycoproteins, and antimicrobial. Accordingly, the experimental results are discussed and compared against other standard algorithms based on the accuracy rate, the average number of selected features, and running time. The results have proven the robustness of the proposed method relied on the high obtained value of accuracy (84.93–95.92%), G-mean (0.853–0.971%), and average selected features (4.36–11.8) with a relatively low computational time. Moreover, to investigate the effectiveness of the proposed method, Friedman test was used which declared that the performance supremacy of the proposed BCSA-QO with four datasets was very evident against BCSA and CSA by selecting the minimum relevant features and producing the highest accuracy classification rate. The obtained results verify the usefulness of the proposed method (BCSA-QO) in the FS with classification in terms of high classification accuracy, a small number of selected features, and low computational time. (shrink)

(1) anything that fs does so because it participates in the f itself. (2) it is impossible that: a form phi fs because phi participates in phi. (3) the f itself fs. These are inconsistent all right, but (1) is not a doctrine of the theory of forms, and (2) is neither reasonable nor held by plato! but the tma does not involve any of these three. Rather, the tma is aimed at (4) anything that fs does so (a) because (...) it participates in the f itself and (b) because the f itself fs. And the tma uses only simple inference rules of the logic of 'because'–no suppressed premises. I also discuss causal regress arguments generally. (shrink)

Sentences of the form ‘Fs are Gs’ can express laws of nature, weaker Special Science laws, and also regularities which are not a part of any explicit science. These so-called generic sentences express nomic relationships which may have exceptions. I discuss the kinds of regularities expressed by generic sentences and argue that since they play a similar role in determining our ability to categorise and reason about the world, we should look for a unified treatment of them.

A theory of truth is usually demanded to be consistent, but -consistency is less frequently requested. Recently, Yatabe has argued in favour of -inconsistent first-order theories of truth, minimising their odd consequences. In view of this fact, in this paper, we present five arguments against -inconsistent theories of truth. In order to bring out this point, we will focus on two very well-known -inconsistent theories of truth: the classical theory of symmetric truth FS and the non-classical theory of naïve truth (...) based on ᴌukasiewicz infinitely valued logic: PAᴌT. (shrink)

Walking through the supermarket, I see the avocados. I know they are avocados. Similarly, if you see a pumpkin on my office desk, you can know it’s a pumpkin from its looks. The phenomenology in such cases is that of “just seeing” that such and such. This phenomenology might suggest that the knowledge gained is immediate. This paper argues, to the contrary, that in these target cases, the knowledge is mediate, depending as it does on one’s knowledge of what the (...) relevant kind of thing looks like. To make the case requires examining the nature of knowing what Fs look like. Is such knowledge to be understood as knowledge of a fact, or rather as a kind of ability? From the conclusion that the knowledge in the target cases is not immediate, the paper concludes that perception does not afford us immediate knowledge concerning objects’ kinds. (shrink)

A property, F, is maximal iff, roughly, large parts of an F are not themselves Fs.' Maximality makes trouble for a recent analysis of intrinsicality by Rae Langton and David Lewis.

Complex demonstratives, expressions of the form 'That F', 'These Fs', etc., have traditionally been taken to be referring terms. Yet they exhibit many of the features of quantified noun phrases. This has led some philosophers to suggest that demonstrative determiners are a special kind of quantifier, which can be paraphrased using a context sensitive definite description. Both these views contain elements of the truth, though each is mistaken. We advance a novel account of the semantic form of complex demonstratives that (...) shows how to reconcile the view that they function like quantified noun phrases with the view that simple demonstratives function as context sensitive referring terms wherever they occur. If we are right, previous accounts of complex demonstratives have misconceived their semantic role; and philosophers relying on the majority view in employing complex demonstratives in analysis have proceeded on a false assumption. (shrink)

Most laws are ceteris paribus (cp) laws: they say not that all Fs are G but only that All Fs are G all else being equal. Most philosophical accounts of laws, however, have focused on strict laws. This paper considers how some of the standard philosophical problems about laws change when we switch attention from strict to cp laws and what special problems these laws raise. It is argued that some cp laws do not simply reflect the complexity of the (...) world and the limitations of our minds. Correctly interpreted, they reveal the simplicity that underlies the complexity, a simplicity that it is without our cognitive powers to grasp. (shrink)

A brief, non-technical introduction to technical and philosophical aspects of Frege's philosophy of arithmetic. The exposition focuses on Frege's Theorem, which states that the axioms of arithmetic are provable, in second-order logic, from a single non-logical axiom, "Hume's Principle", which itself is: The number of Fs is the same as the number of Gs if, and only if, the Fs and Gs are in one-one correspondence.

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation and conecessitation T and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is -inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give an analysis (...) of its proof theory. (shrink)

In this paper I further elucidate and defend a metaontological position that allows you to have a minimal ontology without embracing an error-theory of ordinary talk. On this view 'there are Fs' can be strictly and literally true without bringing an ontological commitment to Fs. Instead of a sentence S committing you to the things that must be amongst the values of the variables if it is true, I argue that S commits you to the things that must exist as (...) truthmakers for S if it is true. I rebut some recent objections that have been levelled against this metaontological view. (shrink)

According to Hempel’s influential theory of explanation, explaining why some a is G consists in showing that the truth that a is G follows from a law-like generalization to the effect that all Fs are G together with the initial condition that a is F. While Hempel’s overall account is now widely considered to be deeply flawed, the idea that some generalizations play the explanatory role that the account predicts is still often endorsed by contemporary philosophers of science. This idea, (...) however, conflicts with widely shared views in metaphysics according to which the generalization that all Fs are G is partially explained by the fact that a is G. I discuss two solutions to this conflict that have been proposed recently, argue that they are unsatisfactory, and offer an alternative. (shrink)

In ‘Knowing What Things Look Like,’ I argued against the immediacy of visual objectual knowledge, i.e. visual knowledge that a thing is F, for an object category F, such as avocado, tree, desk, etc. Joseph Shieber proposes a challenging dilemma in reply. Either knowing what Fs look like requires having concepts such as looks or it doesn’t. Either way my argument fails. If knowing what Fs look like doesn’t require having such concepts, then he claims we can give an immediacy-friendly (...) anti-intellectualist account of knowing what Fs look like, one that I neglected. If it does require having such concepts, then knowledge of what Fs look like plays no important role in ordinary cases of knowing things to be F by their looks. I argue for several claims. First, Shieber's anti-intellectualist proposal fails for independent reasons. Second, I give reasons for thinking that knowing what Fs look like doesn't require having a general concept of looks, which lessens worries about nonhuman animals having such knowledge. Finally, I consider the possibility, important to Shieber's argument, that nonhuman animals are simply incapable of knowing what Fs look like. I argue the implications for human knowledge are far from clear. (shrink)

What requirements must deflationary formal theories of truth satisfy? This chapter argues against the widely accepted view that compositional and Tarskian theories of truth are substantial or otherwise unacceptable to deflationists. First, two purposes that a formal truth theory can serve are distinguished: one descriptive, the other logical (i.e., to characterise the correctness of inferences involving ‘true’). The chapter argues that the most compelling arguments for the incompatibility of compositional and Tarskian theories concern descriptive theories only. -/- Second, two requirements (...) that any deflationist truth theory intended to serve a logical purpose must satisfy are put forward. These requirements, it is argued, suggest that (i) many well-known compositional and Tarskian theories are acceptable from a deflationist standpoint (including CT); (ii) certain other popular theories of truth (including KF and FS) are not similarly acceptable; (iii) there are no conclusive reasons to impose a conservativeness requirement on deflationary theories of truth. (shrink)

Kit Fine’s book is a study of abstraction in a quite precise sense which derives from Frege. In his Grundlagen, Frege contemplates defining the concept of number by means of what has come to be called Hume’s principle—the principle that the number of Fs is the same as the number of Gs just in case there is a one-to-one correspondence between the Fs and the Gs. Frege’s discussion is largely conducted in terms of another, similar but in some respects simpler, (...) proposal—to define the concept of direction by laying down the principle that the direction of a line a is the same as that of line b if and only if lines a and b are parallel. Such principles have come to be known as abstraction principles. More generally, abstraction principles are ones of the shape: ∀α∀β ↔ α ≈ β), where ≈ is an equivalence relation on entities of the type over which α and β vary and, if the principle is acceptable, § is a function from entities of that type to objects. Since ‘the direction of’ is intended to stand for a function from objects of a certain sort to other objects, the Direction Equivalence is a first-order, or in Fine’s terminology objectual, abstraction; since ‘the number of’ is intended to stand for a function from concepts to objects, Hume’s principle is a higher-order, or as Fine says conceptual, abstraction. As is well-known, Frege himself abandoned the idea of defining number implicitly or contextually by means of Hume’s principle—adopting instead an explicit definition of the number of Fs as the extension of the concept concept equinumerous to the concept F— because he thought that an adequate definition should settle the question whether Julius Caesar, for example, is or is not the number of some concept, but that the proposed implicit definition cannot do so. But interest in abstraction principles has revived in the last couple of decades, largely as a result of Crispin Wright’s attempt to show that in spite of the many difficulties confronting it—including the notorious Julius Caesar problem— Hume’s principle can after all serve as a foundation for arithmetic. (shrink)

The paper formulates and proves a strengthening of ‘Frege’s Theorem’, which states that axioms for second-order arithmetic are derivable in second-order logic from Hume’s Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. ‘Finite Hume’s Principle’ also suffices for (...) the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Frege’s definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed. (shrink)

Aim of the paper is to present a new logic of technical malfunction. The need for this logic is motivated by a simple-sounding philosophical question: Is a malfunctioning corkscrew, which fails to uncork bottles, nonetheless a corkscrew? Or in general terms, is a malfunctioning F, which fails to do what Fs do, nonetheless an F? We argue that ‘malfunctioning’ denotes the modifier Malfunctioning rather than a property, and that the answer depends on whether Malfunctioning is subsective or privative. If subsective, (...) a malfunctioning F is an F; if privative, a malfunctioning F is not an F. An intensional logic is required to raise and answer the question, because modifiers operate directly on properties and not on sets or individuals. This new logic provides the formal tools to reason about technical malfunction by means of a logical analysis of the sentence “a is a malfunctioning F”. (shrink)

Descriptions are phrases of the form ‘an F’, ‘the F’, ‘Fs’, ‘the Fs’ and NP's F (e.g. ‘John's mother’). They can be indefinite (e.g., ‘an F’ and ‘Fs’), definite (e.g. ‘the F’ and ‘the Fs’), singular (e.g., ‘an F’, ‘the F’) or plural (e.g., ‘the Fs’, ‘Fs’). In English plural indefinite descriptions lack an article and are for that reason also known as ‘bare plurals’. How to account for the semantics and pragmatics of descriptions has been one of the central (...) topics in philosophy for centuries. This entry focuses on the historical and contemporary philosophical debate about Bertrand Russell’s theory of descriptions and the theories that developed as responses to this theory. (shrink)

Gideon Rosen and Robert Schwartzkopff have independently suggested (variants of) the following claim, which is a varian of Hume's Principle: -/- When the number of Fs is identical to the number of Gs, this fact is grounded by the fact that there is a one-to-one correspondence between the Fs and Gs. -/- My paper is a detailed critique of the proposal. I don't find any decisive refutation of the proposal. At the same time, it has some consequences which many will (...) find objectionable. (shrink)

The topic of this paper is the notion of technical (as opposed to biological) malfunction. It is shown how to form the property being a malfunctioning F from the property F and the property modifier malfunctioning (a mapping taking a property to a property). We present two interpretations of malfunctioning. Both interpretations agree that a malfunctioning F lacks the dispositional property of functioning as an F. However, its subsective interpretation entails that malfunctioning Fs are Fs, whereas its privative interpretation entails (...) that malfunctioning Fs are not Fs. We chart various of their respective logical consequences and discuss some of the philosophical implications of both interpretations. (shrink)

A property, F, is maximal i?, roughly, large parts of an F are not themselves Fs. Maximal properties are typically extrinsic, for their instantiation by x depends on what larger things x is part of. This makes trouble for a recent argument against microphysical superve- nience by Trenton Merricks. The argument assumes that conscious- ness is an intrinsic property, whereas consciousness is in fact maximal and extrinsic.

Talk of the functions of language or concepts plays a central role in developing an appealing pragmatic approach to conceptual engineering. But some have expressed skepticism that we can make any good sense of the idea of function as applied to concepts or language, or argued that the most we can say is that the function of ‘F’ is to refer to the Fs. In this paper, however, I argue that identifying linguistic functions is not hopeless, and that we can (...) make progress by working at the level of system functions, and drawing on work in systemic functional linguistics. For that enables us to develop a better framework for thinking about the functions that language serves, and the ways its subsystems contribute to those functions. This approach to understanding linguistic functions enables us to develop a pragmatic approach to conceptual engineering that provides standards for conceptual engineering without metaphysical mysteries. It also enables us to make progress in figuring out what functions certain philosophically interesting parts of language serve, and how they are introduced into language, in ways that may disentangle us from a range of old philosophical problems. (shrink)