In “Truth – A Traditional Debate Reviewed”, Crispin Wright proposed an inductive definition of “coherence truth” for arithmetic relative to an arithmetic base theory B. Wright’s definition is in fact a notational variant of the usual Tarskian inductive definition, except for the basis clause for atomic sentences. This paper provides a model-theoretic characterization of the resulting sets of sentences "cohering" with a given base theory B. These sets are denoted WB. Roughly, if B satisfies a certain minimal condition, then WB (...) is the Th, where M is the canonical model of the set At of atomic sentences provable in B. The paper also shows that the disquotational T-scheme is provable from Wright’s inductive definition just in case the base theory B is sound and complete for arithmetic atomic sentences. (shrink)

Structural realism has been proposed as an epistemological position interpolating between realism and sceptical anti-realism about scientific theories. The structural realist who accepts a scientific theory thinks that is empirically correct, and furthermore is a realist about the ‘structural content’ of . But what exactly is ‘structural content’? One proposal is that the ‘structural content’ of a scientific theory may be associated with its Ramsey sentence (). However, Demopoulos and Friedman have argued, using ideas drawn from Newman's earlier criticism of (...) Russell's structuralism, that this move fails to achieve an interesting intermediate position between realism and anti-realism. Rather, () adds little content beyond the instrumentalistically acceptable claim that the theory is empirically adequate. Here, I formulate carefully the crucial claim of Demopoulos and Friedman, and show that the Ramsey sentence () is true just in case possesses a full model which is empirically correct and satisfies a certain cardinality condition on its theoretical domain. This suggests that structural realism is not a position significantly different from the anti-realism it attempts to distinguish itself from. Introduction Technical framework Ramsification Empirical adequacy Ramsification empirical adequacy + cardinality constraint Conclusion. (shrink)

Deflationsism about truth is a pot-pourri, variously claiming that truth is redundant, or is constituted by the totality of 'T-sentences', or is a purely logical device (required solely for disquotational purposes or for re-expressing finitarily infinite conjunctions and/or disjunctions). In 1980, Hartry Field proposed what might be called a 'deflationary theory of mathematics', in which it is alleged that all uses of mathematics within science are dispensable. Field's criterion for the dispensability of mathematics turns on a property of theories, called (...) conservativeness. I present some technical results, some of which may be found in Tarski (1936), concerning the logical properties of truth theories; in particular, concerning the conservativeness of adding a truth theory for an object level language to any theory expressed in it. It transpires that various deflationary truth theories behave somewhat differently from the standard Tarskian truth theory. These results suggest that Tarskian theories of truth are not redundant or dispensable. Finally, I hint at an analogy between the behaviour of mathematical theories and of standard (Tarskian) theories of truth with respect to their indispensability to, as Quine would put, our 'scientific world-view'. (shrink)

It is argued that Yablo’s Paradox is not strictly paradoxical, but rather ‘ω-paradoxical’. Under a natural formalization, the list of Yablo sentences may be constructed using a diagonalization argument and can be shown to be ω-inconsistent, but nonetheless consistent. The derivation of an inconsistency requires a uniform fixed-point construction. Moreover, the truth-theoretic disquotational principle required is also uniform, rather than the local disquotational T-scheme. The theory with the local disquotation T-scheme applied to individual sentences from the Yablo list is also (...) consistent. (shrink)

Any (1-)consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a nontrivial fashion. The extended methods of formal proof must capture the essentials of the so-called 'semantical argument' for the truth of the Gödel sentence. We are concerned to show that (...) the deflationist has at his disposal such extended methods--methods which make no use or mention of a truth-predicate. (edited). (shrink)

The notion of strict identity is sometimes given an explicit second-order definition: objects with all the same properties are identical. Here, a somewhat different problem is raised: Under what conditions is the identity relation on the domain of a structure first-order definable? A structure may have objects that are distinct, but indiscernible by the strongest means of discerning them given the language (the indiscernibility formula). Here a number of results concerning the indiscernibility formula, and the definability of identity, are collected (...) and a number of applications discussed. (shrink)

This paper aims to study the foundations of applied mathematics, using a formalized base theory for applied mathematics: ZFCAσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathsf {ZFCA}_{\sigma }$$\end{document} with atoms, where the subscript used refers to a signature specific to the application. Examples are given, illustrating the following five features of applied mathematics: comprehension principles, application conditionals, representation hypotheses, transfer principles and abstract equivalents.

This is a response to a paper “Paradox without satisfaction”, Analysis 63, 152-6 (2003) by Otavio Bueno and Mark Colyvan on Yablo’s paradox. I argue that this paper makes several substantial mathematical errors which vitiate the paper. (For the technical details, see [12] below.).

Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We introduce a notion of strong semantic self-representation applicable to any (sufficiently rich) interpreted many-valued language L. A sufficiently rich interpreted many-valued language L is SSSR just in case it has a function symbol n(x) such that, for any f Sent(L), the denotation of the term n(“f”) in L is precisely ||f||L, the semantic value of f in L. By a simple diagonal construction (finding a sentence l (...) such that l is equivalent to n(“l”) T), it is shown that no such language strongly represents itself semantically. Hence, no such language can be its own metalanguage. (shrink)

The following inference is valid: There are exactly 101 dalmatians, There are exactly 100 food bowls, Each dalmatian uses exactly one food bowl Hence, at least two dalmatians use the same food bowl. Here, “there are at least 101 dalmatians” is nominalized as, "x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x100) and “there are exactly 101 dalmatians” is nominalized as, "x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ (...) x100) & Ø"x1"x2…."x101$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x101). This is abbreviated $101xDx. The validity of the above inference corresponds to the valid formula, PHP(100): [$101xDx & $100xFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)). More generally, for variable n, the formula PHP(n) is PHP(n): [$n+1xDx & $nxFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)). A mathematical proof that PHP(n) is valid, for all n > 0, is quite short (less than a page), but refers to numbers, functions and sets. It uses the Pigeonhole Principle. This explains why PHP(n) is valid, for all n>0. However, I estimate that a predicate calculus derivation of PHP(100), using natural deduction, say, would require around 107 symbols. Unfeasibility Problem: nominalism is the radical anti-realist view that there are no numbers, functions or sets. So, how could a nominalist know that PHP(100) is valid, without directly performing the rather long derivation? Can the nominalist “ride piggyback” on the standard mathematical proof? If so, how is this justified? (shrink)

Sometimes structures or theories are formulated with different sets of primitives and yet are definitionally equivalent. In a sense, the transformations between such equivalent formulations are rather like basis transformations in linear algebra or co-ordinate transformations in geometry. Here an analogous idea is investigated. Let a relational signature \ be given. For a set \ of \-formulas, we introduce a corresponding set \ of new relation symbols and a set of explicit definitions of the \ in terms of the \. (...) This is called a definition system, denoted \. A definition system \ determines a translation function\. Any \-structure A can be uniquely definitionally expanded to a model \, called \. The reduct \ to the Q-symbols is called the definitional image\ of A. Likewise, a theory T in \ may be extended a definitional extension \; the restriction of this extension \ to \ is called the definitional image\ of T. If \ and \ are in disjoint signatures and \, we say that \ and \ are definitionally equivalent and \). Some results relating these notions are given, culminating in two characterization theorems for the definitional equivalence of structures and theories. (shrink)

This dialogue concerns metasemantics and language cognition. It defends a Lewisian conception of languages as abstract entities (Lewis 1975), arguing that semantic facts are necessities (Soames 1984), and therefore not naturalistically reducible. It identifies spoken languages as idiolects, in line roughly with Chomskyan I-languages. It relocates traditional metasemantic indeterminacy arguments as indeterminacies of what language an agent speaks or cognizes. Finally, it aims to provide a theoretical analysis of the cognizing relation in terms of the agent's assigning certain meanings to (...) strings. (shrink)

Instrumentalist nominalism responds to the indispensability arguments by rejecting the demand that successful mathematicized scientific theories be nominalized, and instead claiming merely that such theories are nominalistically adequate: the concreta behave ‘as if’ the theory is true. This article examines some definitions of the concept of nominalistic adequacy and concludes with some considerations against instrumentalist nominalism.

Lucas and Redhead ([2007]) announce that they will defend the views of Redhead ([2004]) against the argument by Panu Raatikainen ([2005]). They certainly re-state the main claims of Redhead ([2004]), but they do not give any real arguments in their favour, and do not provide anything that would save Redhead’s argument from the serious problems pointed out in (Raatikainen [2005]). Instead, Lucas and Redhead make a number of seemingly irrelevant points, perhaps indicating a failure to understand the logico-mathematical points at (...) issue. (shrink)

In the Tarskian theory of truth, the strengthened liar sentence is a theorem. More generally, any formalized truth theory which proves the full, self-applicative scheme True(“f”) f will prove the strengthened liar sentence. (This scheme is sometimes called (T-Out).).

In the Tarskian theory of truth, the strengthened liar sentence is a theorem. More generally, any formalized truth theory which proves the full, self-applicative scheme True f will prove the strengthened liar sentence..).

Certain translational T-schemes of the form True « f, where f can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

Theorem 1 of Ketland 1999 is not quite correct as stated. The theorem would imply that the disquotational T-scheme – suitably restricted to avoid the liar paradox – is conservative over pure logic. But it has been pointed out (e.g. Halbach 2001, “How Innocent is Deflationism?”, Synthese 126, pp. 179-181) that this is not the case, for one can prove ∃x∃y(x ≠ y) from the T-scheme (lemma 2 below).

Is the restricted, consistent, version of the T-scheme sufficient for an ‘implicit definition’ of truth? In a sense, the answer is yes (Haack 1978 , Quine 1953 ). Section 4 of Ketland 1999 mentions this but gives a result saying that the T-scheme does not implicitly define truth in the stronger sense relevant for Beth’s Definability Theorem. This insinuates that the T-scheme fares worse than the compositional truth theory as an implicit definition. However, the insinuation is mistaken. For, as (...) Bays rightly points out, the result given extends to the compositional truth theory also. So, as regards implicit definability, both kinds of truth theory are equivalent. Some further discussion of this topic is mentioned (Gupta 2008 , Ketland 2003 , McGee 1991 ), all in agreement with Bays’s analysis. (shrink)

We can modify Hume’s Principle in the same manner that George Boolos suggested for modifying Frege’s Basic Law V. This leads to the principle Small Hume. Then, we can show that Small Hume is interderivable with Hume’s Principle.

A standard formalization of a scientific theory is a system of axioms for that theory in a first-order language (possibly many-sorted; possibly with the membership primitive $$\in$$ ). Suppes (in: Carvallo M (ed) Nature, cognition and system II. Kluwer, Dordrecht, 1992) expressed skepticism about whether there is a “simple or elegant method” for presenting mathematicized scientific theories in such a standard formalization, because they “assume a great deal of mathematics as part of their substructure”. The major difficulties amount to these. (...) First, as the theories of interest are mathematicized, one must specify the underlying applied mathematics base theory, which the physical axioms live on top of. Second, such theories are typically geometric, concerning quantities or trajectories in space/time: so, one must specify the underlying physical geometry. Third, the differential equations involved generally refer to coordinate representations of these physical quantities with respect to some implicit coordinate chart, not to the original quantities. These issues may be resolved. Once this is done, constructing standard formalizations is not so difficult—at least for the theories where the mathematics has been worked out rigorously. Here we give what may be claimed to be a simple and elegant means of doing that. This is for mathematicized scientific theories comprising differential equations for $$\mathbb{R}$$ -valued quantities Q (that is, scalar fields), defined on n (“spatial” or “temporal”) dimensions, taken to be isomorphic to the usual Euclidean space $$\mathbb{R}^n$$. For illustration, I give standard (in a sense, “text-book”) formalizations: for the simple harmonic oscillator equation in one-dimension and for the Laplace equation in two dimensions. (shrink)

In Part I of this paper, I assumed we begin with a signature $$P = \{P_i\}$$ P = { P i } and the corresponding language $$L_P$$ L P, and introduced the following notions: a definition system$$d_{\Phi }$$ d Φ for a set of new predicate symbols $$Q_i$$ Q i, given by a set $$\Phi = \{\phi _i\}$$ Φ = { ϕ i } of defining $$L_P$$ L P -formulas \leftrightarrow \phi _i)$$ ∀ x ¯ ↔ ϕ i ) ); (...) a corresponding translation function$$\tau _{\Phi }: L_Q \rightarrow L_P$$ τ Φ : L Q → L P ; the corresponding definitional image operator$$D_{\Phi }$$ D Φ, applicable to $$L_P$$ L P -structures and $$L_P$$ L P -theories; and the notion of definitional equivalence itself: for structures $$A + d_{\Phi } \equiv B + d_{\Theta }$$ A + d Φ ≡ B + d Θ ; for theories, $$T_1 + d_{\Phi } \equiv T_2 + d_{\Theta }$$ T 1 + d Φ ≡ T 2 + d Θ. Some results relating these notions were given, ending with two characterizations for definitional equivalence. In this second part, we explain the notion of a representation basis. Suppose a set $$\Phi = \{\phi _i\}$$ Φ = { ϕ i } of $$L_P$$ L P -formulas is given, and $$\Theta = \{\theta _i\}$$ Θ = { θ i } is a set of $$L_Q$$ L Q -formulas. Then the original set $$\Phi $$ Φ is called a representation basis for an $$L_P$$ L P -structure A with inverse $$\Theta $$ Θ iff an inverse explicit definition $$\forall \overline{x} \leftrightarrow \theta _i)$$ ∀ x ¯ ↔ θ i ) is true in $$A + d_{\Phi }$$ A + d Φ, for each $$P_i$$ P i. Similarly, the set $$\Phi $$ Φ is called a representation basis for a $$L_P$$ L P -theory T with inverse $$\Theta $$ Θ iff each explicit definition $$\forall \overline{x} \leftrightarrow \theta _i)$$ ∀ x ¯ ↔ θ i ) is provable in $$T + d_{\Phi }$$ T + d Φ. Some results about representation bases, the mappings they induce and their relationship with the notion of definitional equivalence are given. In particular, we show that $$T_1$$ T 1 is definitionally equivalent to $$T_2$$ T 2, with respect to $$\Phi $$ Φ and $$\Theta $$ Θ, if and only if $$\Phi $$ Φ is a representation basis for $$T_1$$ T 1 with inverse $$\Theta $$ Θ and $$T_2 \equiv D_{\Phi }T_1$$ T 2 ≡ D Φ T 1. (shrink)

This article provides a computational example of a mathematical explanation within science, concerning computational equivalence of programs. In addition, it outlines the logical structure of the reasoning involved in explanations in applied mathematics. It concludes with a challenge that the nominalist provide a nominalistic explanation for the computational equivalence of certain programs.

Certain translational T-schemes of the form True(“f”) « f(f), where f(f) can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

In mathematical logic, Craig’s Theorem states that any recursively enumerable theory is recursively axiomatizable. Its epistemological interest concerns its possible use as a method of eliminating “theoretical content” from scientific theories.

This discusses a mistake (concerning what a definition is) in “Grelling’s revenge”, Analysis 64, 251-6 (2004), by Dale Jacquette, who claims that the simple theory of types is inconsistent.

Second-order logic is the extension of first-order logic obtaining by introducing quantification of predicate and function variables.

Ordinarily, in mathematical and scientific practice, the notion of a “theory” is understood as follows: (SCT) Standard Conception of Theories : A theory T is a collection of statements, propositions, conjectures, etc. A theory claims that things are thus and so. The theory may be true, and may be false. A theory T is true if things are as T says they are, and T is false if things are not as T says they are. One can make this Aristotelian (...) explanation more precise, as Tarski showed, in the cases where we understand how to give precise logical analyses of theories, by identifying an interpreted language L, Á) in which T may be formulated. Here L is some formalized language and Á is an L-interpretation. One can define the satisfaction relation ⊨, holding between L-sentences j and L-interpretations, and then define the notion L-sentence j is true in L, Á)” as Á ⊨ j”. What is essential about this is that theories are truth bearers . They are bearers of semantic properties. (shrink)

Jeffrey E. Brower presents and explains the hylomorphic conception of the material world developed by Thomas Aquinas, according to which material objects are composed of both matter and form. In addition to presenting and explaining Aquinas's views, Brower seeks wherever possible to bring them into dialogue with the best recent literature on related topics. Along the way, he highlights the contribution that Aquinas's views make to a host of contemporary metaphysical debates, including the nature of change, composition, material constitution, (...) the ontology of stuff vs. things, the proper analysis of ordinary objects, the truthmakers for essential vs. accidental predication, and the metaphysics of property possession. (shrink)

Closest-possible-world analyses of counterfactuals suffer from what has been called the ‘problem of counterpossibles’: some counterfactuals with metaphysically impossible antecedents seem plainly false, but the proposed analyses imply that they are all (vacuously) true. One alleged solution to this problem is the addition of impossible worlds. In this paper, I argue that the closest possible or impossible world analyses that have recently been suggested suffer from the ‘new problem of counterpossibles’: the proposed analyses imply that some plainly true counterpossibles (viz., (...) ‘counterlogicals’) are false. After motivating and presenting the ‘new problem’, I give reasons to think that the most plausible objection to my argument is not compelling. (shrink)

This is annotated bibliography of the field of business ethics. It identifies and summarizes useful journals, textbooks, anthologies, and articles.

What can we know about God by reason alone? Philosophical theology is the attempt to obtain such knowledge. An ancient tradition, which is perhaps more influential now than ever, tries to derive the attributes of God from the principle that God is the greatest possible being. Jeff Speaks argues that that constructive project is a failure. He also argues that the related view that the concept of God is the concept of a greatest possible being is a mistake. In the (...) last chapter, he sketches an alternative path forward. (shrink)

This Element has two aims. The first is to discuss arguments philosophers have made about the difference God's existence might make to questions of general interest in metaethics. The second is to argue that it is a mistake to think we can get very far in answering these questions by assuming a thin conception of God, and to suggest that exploring the implications of thick theisms for metaethics would be more fruitful.

This article suggests an iconic turn in cultural sociology. Icons can be seen, it is argued, as symbolic condensations that root social meanings in material form, allowing the abstractions of cognition and morality to be subsumed, to be made invisible, by aesthetic shape. Meaning is made iconically visible, in other words, by the beautiful, sublime, ugly, or simply by the mundane materiality of everyday life. But it is via the senses that iconic power is made. This new approach to meaning (...) is compared with others — with materialism, semiotics, aestheticism, moralism, realism, and spiritualism. (shrink)

Preface : plant theory? -- The first birth of biopower : from plant to animal life in Foucault -- Thinking plants, with Aristotle and Heidegger -- Animal and plant, life and world in Derrida, or, The plant and the sovereign -- From the world to the territory : vegetable life in Deleuze and Guattari, or, What is a rhizome? -- Coda : what difference does it make?

Jeffrey Bloechl traces the evolution of Levinas's thought to argue that his conception of God is dependent on his existential phenomenology.

Justice requires giving people what they deserve. Or so many philosophers – and according to many of those philosophers, everyone else – thought for centuries. In the 1970’s and 1980’s, however, perhaps under the influence of Rawls’s (1971) desert-less theory, desert was largely cast out of discussions of distributive justice. Now it is making a comeback. In this chapter I consider recent research on the concept of desert, arguments for its requital, and connections between desert and other distributive ideals. I (...) suggest that desert-sensitive theories of distributive justice, though they face obstacles, have a promising future. (shrink)

Recently in this journal, Jessica Morley and colleagues (AI & SOC 2023 38:411–423) review AI ethics and education, suggesting that a cultural shift is necessary in order to prepare students for their responsibilities in developing technology infrastructure that should shape ways of life for many generations. Current AI ethics guidelines are abstract and difficult to implement as practical moral concerns proliferate. They call for improvements in ethics course design, focusing on real-world cases and perspective-taking tools to immerse students in challenging (...) situations with relatable personal, social and environmental implications. The present paper considers the ACTWith model of moral cognition for use in such training contexts. Morley and colleagues' paper and contemporary literature are reviewed. Whistleblowing as a source for relatable case studies is discussed, and the purpose of ethics education considered. The ACTWith model is introduced, and correlations with contemporaries noted. The ACTWith model has been successfully employed in a broad range of technology ethics courses in the Netherlands and South Korea. Illustrations are offered. Correlations with contemporary efforts are drawn in the context of software engineering. Summary discussion considers strengths and limitations of the ACTWith program. Overall, the paper emphasizes training high-level moral reasoning through guided inquiry education informing lifetime professional practice, and indicates an outstanding need for teachers able to do the job. (shrink)

Soren Kierkegaard's Fear and Trembling is one of the most widely read works of Continental philosophy and the philosophy of religion. While several commentaries and critical editions exist, Jeffrey Hanson offers a distinctive approach to this crucial text. Hanson gives equal weight and attention to all three of Kierkegaard’s "problems," dealing with Fear and Trembling as part of the entire corpus of Kierkegaard's production and putting all parts into relation with each other. Additionally, he offers a distinctive analysis of (...) the Abraham story and other biblical texts, giving particular attention to questions of poetics, language, and philosophy, especially as each relates to the aesthetic, the ethical, and the religious. Presented in a thoughtful, well-informed, and fresh manner, Hanson’s claims are original and edifying. This new reading of Kierkegaard will stimulate fruitful dialogue on well-traveled philosophical ground. (shrink)

We prove several results about groups of finite Morley rank without unipotent p-torsion: p-torsion always occurs inside tori, Sylow p-subgroups are conjugate, and p is not the minimal prime divisor of our approximation to the "Weyl group". These results are quickly finding extensive applications within the classification project.