Suppose that scientific realists believe that a successful theory is approximately true, and that constructive empiricists believe that it is empirically adequate. Whose belief is more likely to be false? The problem of underdetermination does not yield an answer to this question one way or the other, but the pessimistic induction does. The pessimistic induction, if correct, indicates that successful theories, both past and current, are empirically inadequate. It is arguable, however, that they are approximately true. Therefore, scientific realists overall (...) take less epistemic risk than constructive empiricists. (shrink)

The main question addressed in this paper is whether some false sentences can constitute evidence for the truth of other propositions. In this paper it is argued that there are good reasons to suspect that at least some false propositions can constitute evidence for the truth of certain other contingent propositions. The paper also introduces a novel condition concerning propositions that constitute evidence that explains a ubiquitous evidential practice and it contains a defense of a particular condition concerning the possession (...) of evidence. The core position adopted here then is that false propositions that are approximately true reports of measurements can constitute evidence for the truth of other propositions. So, it will be argued that evidence is only quasi-factive in this very specific sense. (shrink)

Approximation involves representing things in ways that might be close to the truth but are nevertheless false. Given the widespread reliance on approximations in science and everyday life, here we ask whether it is conceptually possible for false approximations to qualify as knowledge. According to the factivity account, it is impossible to know false approximations, because knowledge requires truth. According to the representational adequacy account, it is possible to know false approximations, if they are close enough to the truth for (...) present purposes. In this paper, we adopt an experimental methodology to begin testing these two theories. When an agent provides a false and practically inadequate answer, both theories predict that people will deny knowledge. But the theories disagree about an agent who provides a false but practically adequate answer: the factivity hypothesis again predicts knowledge denial, whereas the representational adequacy hypothesis predicts knowledge attribution. Across two experiments, our principal finding was that people tended to attribute knowledge for false but practically adequate answers, which supports the representational adequacy account. We propose an interpretation of existing findings that preserves a conceptual link between knowledge and truth. According to this proposal, truth is not necessary for knowledge, but it is a feature of prototypical knowledge. (shrink)

Approximate coherentism suggests that imperfectly rational agents should hold approximately coherent credences. This norm is intended as a generalization of ordinary coherence. I argue that it may be unable to play this role by considering its application under learning experiences. While it is unclear how imperfect agents should revise their beliefs, I suggest a plausible route is through Bayesian updating. However, Bayesian updating can take an incoherent agent from relatively more coherent credences to relatively less coherent credences, depending on the (...) data observed. Thus, comparative rationality judgments among incoherent agents are unduly sensitive to luck. (shrink)

This paper focuses on the interpretation of the Italian approximative adverb quasi 'almost' by primarily looking at cases in which it modifies temporal connectives, a domain which, to our knowledge, has been largely unexplored thus far. Consideration of this domain supports the need for a scalar account of the semantics of quasi (close in spirit to Hitzeman's semantic analysis of almost, in: Canakis et al. (eds) Papers from the 28th regional meeting of the Chicago Linguistic Society, 1992). When paired with (...) suitable analyses of temporal connectives, such an account can provide a simple explanation of the patterns of implication that are observed when quasi modifies locational (e. g. quando 'when'), directional (e. g. fino 'until' and da 'since'), and event-sequencing temporal connectives (e. g. prima 'before' and dopo ' after'). A challenging empirical phenomenon that is observed is a contrast between the modification of fino and da by quasi, on the one hand, and the modification of prima and dopo by the same adverb, on the other. While quasi fino and quasi da behave symmetrically, a puzzling asymmetry is observed between quasi prima and quasi dopo. To explain the asymmetry, we propose an analysis of prima and dopo on which the former has the meaning of the temporal comparative più presto 'earlier', while the latter is seen as an atomic predicate denoting temporal succession between events (Del Prete, Nat Lang Semantics 16: 157-203, 2008). We show that the same pattern of implication observed for quasi prima is attested when quasi modifies overt comparatives, and propose a pragmatic analysis of this pattern that uniformly applies to both cases, thus providing new evidence for the claim that prima is underlyingly a comparative. A major point of this paper is a discussion of the notion of scale which is relevant for the semantics of quasi', in particular, we show that the notion of Horn (entailment-based) scale is not well-suited for handling modification of temporal connectives, and that a more general notion of scale is required in order to provide a uniform analysis of quasi as a cross-categorial modifier. (shrink)

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can (...) be computed from the calculus. (shrink)

We study the first-order theories of some natural and important classes of coloured trees, including the four classes of trees whose paths have the order type respectively of the natural numbers, the integers, the rationals, and the reals. We develop a technique for approximating a tree as a suitably coloured linear order. We then present the first-order theories of certain classes of coloured linear orders and use them, along with the approximating technique, to establish complete axiomatisations of the four classes (...) of trees mentioned above. (shrink)

Some years ago, Hidding et al. suggest that the emergence of intricate and pervasive weblike structure of the Universe on Megaparsec scales can be approximated by a well-known equation from fluid mechanics, the Burgers’ equation. The solution to this equation can be obtained from a geometrical formalism. The resulting Adhesion formalism provides deep insight into the dynamics and topology of the Cosmic Web. It uncovers a direct connection between the conditions in the very early Universe and the complex spatial patterns (...) that emerged out of these under the influence of gravity. In the present paper, we describe a cellular automaton model of the Burgers’ equation, which can be investigated via a fast computer simulation. In the end, this suggests a Cellular Automata Adhesion Model of the Universe. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers larger than 4 (...) or 5. Our results imply a distinction between a nonverbal system of number approximation and a language-based counting system for exact number and arithmetic. (shrink)

Some epistemologists think that the Bayesian ideals matter because we can approximate them. That is, our attitudes can be more or less close to the ones of our ideal Bayesian counterpart. In this paper, I raise a worry for this justification of epistemic ideals. The worry is this: In order to correctly compare agents to their ideal counterparts, we need to imagine idealized agents who have the same relevant information, knowledge, or evidence. However, there are cases in which one’s ideal (...) counterpart cannot have one’s information, knowledge, or evidence. In these situations, agents cannot compare themselves to their ideal counterpart. (shrink)

We propose a new account of vagueness and approximation in terms of the theory of granular partitions. We distinguish different kinds of crisp and non-crisp granular partitions and we describe the relations between them, concentrating especially on spatial examples. We describe the practice whereby subjects use regular grid-like reference partitions as a means for tempering the vagueness of their judgments, and we demonstrate how the theory of reference partitions can yield a natural account of this practice, which is referred to (...) in the literature as ‘approximation’. (shrink)

DRAFT Several philosophers have suggested that it is impossible to formulate a theory of population ethics that simultaneously satisfies all of the necessary conditions set by our ethical intuitions (Arrhenius, 2000; Blackorby et al., 2004). However, we will attempt to demonstrate that, using the Stone-Weierstrass method, starting from scratch with a completely underspecified polynomial approximation function for commensurable cardinal utility (used here as a synonym for welfare) in a domain of commodities and populations, there are possible sets of functions that (...) satisfy many if not all of our ethical intuitions (avoiding the Repugnant and Sadistic Conclusions, and others), thus providing a self-consistent welfarist axiology. DRAFT. (shrink)

Hájek (Erkenntnis 70(2):211–235, 2009) argues that probabilities cannot be the limits of relative frequencies in counterfactual infinite sequences. I argue for a different understanding of these limits, drawing on Norton’s (Philos Sci 79(2):207–232, 2012) distinction between approximations (inexact descriptions of a target) and idealizations (separate models that bear analogies to the target). Then, I adapt Hájek’s arguments to this new context. These arguments provide excellent reasons not to use hypothetical frequencies as idealizations, but no reason not to use them as (...) approximations. (shrink)

J. Schauder introduced the notion of basis in a Banach space in 1927. If a Banach space has a basis then it is also separable. The problem whether every separable Banach space has a Schauder basis appeared for the first time in 1931 in Banach's book "Theory of Linear Operations". If a Banach space has a Schauder basis it also has the approximation property. A Banach space X has the approximation property if for every Banach space Y the finite rank (...) operators are dense in the closed subspace of all compact operators from Y to X. Both problems were solved in the negative in 1972 by Per Enflo. His proof was almost immediately simplified by A. M. Davie, who using a probabilistic lemma constructed a separable closed subspace of l_inifnity without the approximation property. In this thesis we present some of the equivalent properties to the approximation property due to A. Grothendieck, and we make a detailed exposition of the proof by A. M. Davie. (shrink)

In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP). In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving neutrosophic multi-objective programming problem (...) at end of this paper. (shrink)

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can (...) be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

The approximate number system (ANS) enables organisms to represent the approximate number of items in an observed collection, quickly and independently of natural language. Recently, it has been proposed that the ANS goes beyond representing natural numbers by extracting and representing rational numbers (Clarke & Beck, 2021a). Prior work demonstrates that adults and children discriminate ratios in an approximate and ratio-dependent manner, consistent with the hallmarks of the ANS. Here, we use a well-known “connectedness illusion” to provide evidence that these (...) ratio-dependent ratio discriminations are (a) based on the perceived number of items in seen displays (and not just non-numerical confounds), (b) are not dependent on verbal working memory, or explicit counting routines, and (c) involve representations with a part-whole (or subset-superset) format, like a fraction, rather than a part-part format, like a ratio. These results vindicate key predictions of the hypothesis that the ANS represents rational numbers. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

Many philosophers appeal to the “fallacy of approximation”, or “problem of second best”. However, despite the pervasiveness of such appeals, there has been only a single attempt to provide a systematic account of what the fallacy is. We identify the shortcomings of this account and propose a better one in its place. Our account not only captures all the contexts in which approximation-based reasoning occurs but also systematically explains the several different ways in which it can be in error.

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

All humans share a universal, evolutionarily ancient approximate number system (ANS) that estimates and combines the numbers of objects in sets with ratio-limited precision. Interindividual variability in the acuity of the ANS correlates with mathematical achievement, but the causes of this correlation have never been established. We acquired psychophysical measures of ANS acuity in child and adult members of an indigene group in the Amazon, the Mundurucú, who have a very restricted numerical lexicon and highly variable access to mathematics education. (...) By comparing Mundurucú subjects with and without access to schooling, we found that education significantly enhances the acuity with which sets of concrete objects are estimated. These results indicate that culture and education have an important effect on basic number perception. We hypothesize that symbolic and nonsymbolic numerical thinking mutually enhance one another over the course of mathematics instruction. (shrink)

In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.

En las actividades ordinarias de nuestra vida cotidiana encontramos nuestros actos de percepción confrontados por las cosas materiales. A ellos ─actos de percepción─ les atribuimos una existencia "real" asumiéndolos de tal manera que los sumergimos y transfundimos, de forma múltiple e indefinida, dentro del entorno de realidades análogas que se unen para formar un único mundo al que yo, con mi propio cuerpo, pertenezco. Ahora bien sí frente a la cotidianidad descrita anteriormente asumimos una actitud escéptica acerca de lo que (...) es “real” en el mundo,nos descubriremos haciendo una reflexión filosófica. Bajo esta deliberación encontramos que, por ejemplo, la cualidad "verde", tiene existencia por medio de la sensación "verde"asociada a un objeto dado por la percepción, lo que nos lleva a pensar que no tiene sentido vincularla sensación como cosa en sí misma a cosas materiales existentes en sí mismos , esto nos lleva a pensar que las cualidades de los sentidostienen carácter subjetivo.A pesar de esta reflexión es conveniente acotar que esta subjetividad no interesaa las ciencias exactas ya que éstas procuran lo objetivo. -/- Desde este punto de vista,encontramos dentro de los estudios de Galileo Galilei el principio que subyace al método matemáticoconstructivo de nuestra física moderna ; de esta manera, y bajo este principio,los colores ─ por ejemplo “verde”─ son solo vibraciones en un medio repudiando de esta forma el carácter subjetivo a la vez que se mantiene la objetividad. Sin embargo, dentro del campo de la filosofía el idealismo transcendental de Kant marca un cambio de paradigma en relación a lo anterior. Kant sostiene que no solamente las cualidades de los sentidos tienen carácter subjetivo, sino que espacio y tiempo, conceptos fundacionales dentro de la física, no tienen significación absoluta; en otras palabras, espacio y tiempo son formas de nuestra percepción . Para Kant aquello que sustenta nuestra percepción y aquello que sustenta el conocimiento matemático aplicado a la experiencia son lo mismo: intuiciones puras a priori del espacio y el tiempo. De esta manera, y bajo esta perspectiva, sólo la teoría de la relatividad deja muyen claro que las dos esencias: espacio y tiempo, como formas de la intuición en términos kantianos, no tienen lugar en el mundo construido por la física matemática concebida por Galileo . -/- Según esto, los colores no son siquiera vibraciones en un medio sino simplemente una serie de valores de funciones matemáticas en las que se producen cuatro parámetros independientes que corresponden a las tres dimensiones del espacio y la del tiempo, expresado como principio general esto significa que el mundo real y cada uno de sus constituyentes con sus características sólo pueden ser, en términos husserlianos, objetos intencionales de actos de conciencia . En otras palabras: los datos inmediatos que recibo son las experiencias de la conciencia. Esto nos permite afirmar que la sensación de un objeto está presente de una forma físicamente real para mí con quien esa sensación se relaciona. Esto es lo que Brentano llama objeto intencional ;es así como al percibir un objeto, por ejemplo: veo este “libro” mi atención está totalmente dirigida hacia él. Yo "tengo" la percepción, pero sólo cuando hago de esta percepción ─ acto libre de reflexión ─algo que "conozco" con respecto a ella ─y no sólo el “libro”─ llego precisamente a un segundo acto: objetos intencionales de actos de conciencia, que son a los que referíamos antes . -/- El objeto intencional es inmanente y lo que es inmanente es absoluto ; es exactamente lo que es en la forma en que lo tengo, y puedo reducir esto, su esencia, por los actos de reflexión . En otras palabras, es un componente real de mis experiencias; contrario a lo que sucede con el acto primario de percepción, donde el objeto es trascendental , esto es, se da en una experiencia de conciencia pero no es un componente real de la misma. Por otra parte, los objetos trascendentales tienen sólo una existencia fenoménica; son apariencias que se presentan de múltiples maneras. Ninguno de estos modos de aparición puede pretender presentar aquello que percibimos – por ejemplo el libro- tal como es en sí, además en toda percepción está involucrada la tesis de la realidad del objeto que aparece en ella; este último es, de hecho, un elemento fijo y duradero de la tesis general de la realidad del mundo . En resumen, lo que interesa ver claramente es la importancia enel dato de la conciencia como punto de partida en el que debemos situarnos si queremos comprender el significado absoluto . (shrink)

In this work, we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingaỉe representation in the case of discrete time and an application of obtained result for semi-continous market model are given.

Abstract: We propose a view of vagueness as a semantic property of names and predicates. All entities are crisp, on this semantic view, but there are, for each vague name, multiple portions of reality that are equally good candidates for being its referent, and, for each vague predicate, multiple classes of objects that are equally good candidates for being its extension. We provide a new formulation of these ideas in terms of a theory of granular partitions. We show that this (...) theory provides a general framework within which we can understand the relation between vague terms and concepts and the corresponding crisp portions of reality. We also sketch how it might be possible to formulate within this framework a theory of vagueness which dispenses with the notion of truth-value gaps and other artifacts of more familiar approaches. Central to our approach is the idea that judgments about reality involve in every case (1) a separation of reality into foreground and background of attention and (2) the feature of granularity. On this basis we attempt to show that even vague judgments made in naturally occurring contexts are not marked by truth-value indeterminacy. We distinguish, in addition to crisp granular partitions, also vague partitions, and reference partitions, and we explain the role of the latter in the context of judgments that involve vagueness. We conclude by showing how reference partitions provide an effective means by which judging subjects are able to temper the vagueness of their judgments by means of approximations. (shrink)

In this paper I examine the thesis regarding the end of the history of art, through which Hans Belting frames the museum as a correlate of history, understood as framing art and the role of the museum within the development of a closed and outdated philosophy of history: the phi-losophy of Hegel. On the contrary, I believe that first He-gel and later Arthur Danto not only explain the changing roles of art and the museum but also argue for the need (...) for reflection on art in modern culture. Our reconstruc-tion of this debate through the work of these authors allow us to represent, for contemporary thought, a pro-ductive analysis of the history of art and its connection with philosophy, and offers us theoretical perspectives that remain relevant for our understanding of theory, the history of art, and various institutional spheres. (shrink)

Visual illusions of number provide a means of investigating the rules and principles through which approximate number representations are formed. Here, we investigated the developmental trajectory of an important numerical illusion – the connectedness illusion, wherein connecting pairs of items with thin lines reduces their perceived number without altering continuous attributes of the collections. We found that children as young as 5 years of age are affected by the illusion and that the magnitude of the effect increased into adulthood. Moreover, (...) individuals with greater numerical acuity exhibited stronger connectedness illusions after controlling for age. Overall, these results suggest the approximate number system expects to enumerate over bounded wholes and doing so is a signature of its optimal functioning. (shrink)

In our target article, we argued that the number sense represents natural and rational numbers. Here, we respond to the 26 commentaries we received, highlighting new directions for empirical and theoretical research. We discuss two background assumptions, arguments against the number sense, whether the approximate number system represents numbers or numerosities, and why the ANS represents rational numbers.

On a now orthodox view, humans and many other animals possess a “number sense,” or approximate number system, that represents number. Recently, this orthodox view has been subject to numerous critiques that question whether the ANS genuinely represents number. We distinguish three lines of critique – the arguments from congruency, confounds, and imprecision – and show that none succeed. We then provide positive reasons to think that the ANS genuinely represents numbers, and not just non-numerical confounds or exotic substitutes for (...) number, such as “numerosities” or “quanticals,” as critics propose. In so doing, we raise a neglected question: numbers of what kind? Proponents of the orthodox view have been remarkably coy on this issue. But this is unsatisfactory since the predictions of the orthodox view, including the situations in which the ANS is expected to succeed or fail, turn on the kind of number being represented. In response, we propose that the ANS represents not only natural numbers, but also non-natural rational numbers. It does not represent irrational numbers, however, and thereby fails to represent the real numbers more generally. This distances our proposal from existing conjectures, refines our understanding of the ANS, and paves the way for future research. (shrink)

This chapter presents a re-understanding of the contents of our analog magnitude representations (e.g., approximate duration, distance, number). The approximate number system (ANS) is considered, which supports numerical representations that are widely described as fuzzy, noisy, and limited in their representational power. The contention is made that these characterizations are largely based on misunderstandings—that what has been called “noise” and “fuzziness” is actually an important epistemic signal of confidence in one’s estimate of the value. Rather than the ANS having noisy (...) or fuzzy numerical content, it is suggested that the ANS has exquisitely precise numerical content that is subject to epistemic limitations. Similar considerations will arise for other analog representations. The chapter discusses how this new understanding of ANS representations recasts the learnability problem for number and the conceptual changes that children must accomplish in the number domain. (shrink)

This paper challenges Williamson's "E = K" thesis on the basis of evidential practice. The main point is that most evidence is only approximately true and so cannot be known if knowledge is factive.

I present a new definition of verisimilitude, framed in terms of causes. Roughly speaking, according to it a scientific model is approximately true if it captures accurately the strengths of the causes present in any given situation. Against much of the literature, I argue that any satisfactory account of verisimilitude must inevitably restrict its judgments to context-specific models rather than general theories. We may still endorse—and only need—a relativized notion of scientific progress, understood now not as global advance but rather (...) as the mastering of particular problems. This also sheds new light on longstanding difficulties surrounding language-dependence and models committed to false ontologies. (shrink)

Conventional wisdom holds that the von Neumann entropy corresponds to thermodynamic entropy, but Hemmo and Shenker (2006) have recently argued against this view by attacking von Neumann's (1955) argument. I argue that Hemmo and Shenker's arguments fail due to several misunderstandings: about statistical-mechanical and thermodynamic domains of applicability, about the nature of mixed states, and about the role of approximations in physics. As a result, their arguments fail in all cases: in the single-particle case, the finite particles case, and the (...) infinite particles case. (shrink)

It is widely accepted in epistemology that knowledge is factive, meaning that only truths can be known. We argue that this theory creates a skeptical challenge: because many of our beliefs are only approximately true, and therefore false, they do not count as knowledge. We consider several responses to this challenge and propose a new one. We propose easing the truth requirement on knowledge to allow approximately true, practically adequate representations to count as knowledge. In addition to addressing the skeptical (...) challenge, this view also coheres with several previous theoretical proposals in epistemology. (shrink)

In this paper, three theories of progress and the aim of science are discussed: the theory of progress as increasing explanatory power, advocated by Popper in The logic of scientific discovery ; the theory of progress as approximation to the truth, introduced by Popper in Conjectures and refutations ; the theory of progress as a steady increase of competing alternatives, which Feyerabend put forward in the essay “Reply to criticism. Comments on Smart, Sellars and Putnam” and defended as late as (...) the last edition of Against method. It is argued that, contrary to what Feyerabend scholars have predominantly assumed, Feyerabend's changing attitude towards falsificationism—which he often advocated at the beginning of his career, and vociferously attacked in the 1970s and 1980s—must be explained by taking into account not only Feyerabend's very peculiar view of the aim of science, but also Popper's changing account of progress. (shrink)

This paper contains a critical examination of the prospects for analyses of knowledge that weaken the factivity condition such that knowledge implies approximate truth.

We provide a 'verisimilitudinarian' analysis of the well-known Linda paradox or conjunction fallacy, i.e., the fact that most people judge the probability of the conjunctive statement "Linda is a bank teller and is active in the feminist movement" (B & F) as more probable than the isolated statement "Linda is a bank teller" (B), contrary to an uncontroversial principle of probability theory. The basic idea is that experimental participants may judge B & F a better hypothesis about Linda as compared (...) to B because they evaluate B & F as more verisimilar than B. In fact, the hypothesis "feminist bank teller", while less likely to be true than "bank teller", may well be a better approximation to the truth about Linda. (shrink)

We present a novel approach to defining the mathematical constant π through the infinite den- sification of a sweeping net, which approximates a circle as the net becomes infinitely dense. By developing and enhancing notation related to sweeping nets and saddle maps, we establish a rigor- ous framework for expressing π in terms of the densification process using reverse integration. This method, inspired by the concept that numbers ”come from infinity,” leverages a reverse integral approach to model the transition (...) from infinite densification to the finite circle. Our work not only offers a new perspective on the geometric interpretation of π but also provides insights into reverse integration techniques and their applications in mathematical analysis. (shrink)

We present a formal mechanical analysis using sweeping net methods to approximate surfacing singularities of saddle maps. By constructing densified sweeping subnets for individual vertices and integrating them, we create a comprehensive approximation of singularities. This approach utilizes geometric concepts, analytical methods, and theorems that demonstrate the robustness and stability of the nets under perturbations. Through detailed proofs and visualizations, we provide a new perspective on singularities and their approximations in analytic geometry.

In the paper, certain rational postulates for protocols describing real communicating are introduced.These rational postulates, on the one hand, allow assigning a certain typology of real systems of interactions, which is consistent with the reality of epistemic argumentation in systems of communicating, and on the other one – defining rules of using argumentation in real situations. Moreover, the presented postulates for protocols characterize information networks and administering knowledge in real interactivity systems. Due to the epistemic character of the considerations, the (...) problem undertaken in the paper concerns working out fundamental assumptions that refer to building of epistemic logics. They allow establishing the correctness of the discourse defined by rational postulates of protocols of real communication. In the context of the presented problem there are the following two research questions distinguished: 1) How do we determine the rule of building of real dynamic epistemic logics? and 2) How should we define semantics for these logics? Within the framework of considerations relating to the research questions asked, certain epistemic operators, relativized to types of communicating, are introduced. Basic logical relations between using these operators are established for these operators. The relations are presented by a diagram called the square of epis temic operators. On the basis of these logical relations some axioms for real dynamic epistemic logics are presented. The semantics of real dynamic epistem ic logics is extended by the methods of lower and upper approximation of formula evaluating. This allows defining ‘approximation Kripke models’. The results of conceptualization of knowledge on real premises of epistemic argum entation presented in this paper can be applied to rhetoric in real systems of interaction. (shrink)

It is widely thought that knowledge is factive – only truths can be known. However, this view has been recently challenged. One challenge appeals to approximate truths. Wesley Buckwalter and John Turri argue that false-but-approximately-true propositions can be known. They provide experimental findings to show that their view enjoys intuitive support. In addition, they argue that we should reject the factive account of knowledge to avoid widespread skepticism. A second challenge, advanced by Nenad Popovic, appeals to multidimensional geometry to build (...) a case where it seems intuitive that a person knows p even though p is false. In addition, Popovic argues that we should reject the factive account of knowledge because most of us would not become widespread skeptics if we discovered that ordinary objects in our world are actually four-dimensional. In this paper, we defend the factive account of knowledge against these arguments by challenging the intuitive appeal of the cases and arguing that there is no real threat of widespread skepticism for the factive account of knowledge. (shrink)

This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered. First Part of this book presents some (...) theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes. Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification. Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well. (shrink)

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)

Despite an increasing role of machine learning in science, there is a lack of results on limits of empirical exploration aided by machine learning. In this paper, we construct one such limit by proving undecidability of learnability of state spaces of physical systems. We characterize state spaces as binary hypothesis classes of the computable Probably Approximately Correct learning framework. This leads to identifying the first limit for learnability of state spaces in the agnostic setting. Further, using the fact that finiteness (...) of the combinatorial dimension of hypothesis classes is undecidable, we derive undecidability for learnability of state spaces as well. Throughout the paper, we try to connect our formal results with modern neural networks. This allows us to bring the limits close to the current practice and make a first step in connecting scientific exploration aided by machine learning with results from learning theory. (shrink)

Much research supports the existence of an Approximate Number System (ANS) that is recruited by infants, children, adults, and non-human animals to generate coarse, non-symbolic representations of number. This system supports simple arithmetic operations such as addition, subtraction, and ordering of amounts. The current study tests whether an intuition of a more complex calculation, division, exists in an indigene group in the Amazon, the Mundurucu, whose language includes no words for large numbers. Mundurucu children were presented with a video event (...) depicting a division transformation of halving, in which pairs of objects turned into single objects, reducing the array's numerical magnitude. Then they were tested on their ability to calculate the outcome of this division transformation with other large-number arrays. The Mundurucu children effected this transformation even when non-numerical variables were controlled, performed above chance levels on the very first set of test trials, and exhibited performance similar to urban children who had access to precise number words and a surrounding symbolic culture. We conclude that a halving calculation is part of the suite of intuitive operations supported by the ANS. (shrink)

On a now orthodox view, humans and many other animals are endowed with a “number sense”, or approximate number system (ANS), that represents number. Recently, this orthodox view has been subject to numerous critiques, with critics maintaining either that numerical content is absent altogether, or else that some primitive analog of number (‘numerosity’) is represented as opposed to number itself. We distinguish three arguments for these claims – the arguments from congruency, confounds, and imprecision – and show that none succeed. (...) We then highlight positive reasons for thinking that the ANS genuinely represents numbers. The upshot is that proponents of the orthodox view should not feel troubled by recent critiques of their position. (shrink)

Contrary to Bell’s theorem it is demonstrated that with the use of classical probability theory the quantum correlation can be approximated. Hence, one may not conclude from experiment that all local hidden variable theories are ruled out by a violation of inequality result.