Since Aristotle it is recognised that a valid syllogism cannot have two particular premises. However, that is not how a lay person sees it; at least as long as the premises read many, most etc, instead of a plain some. The lay people are right if one considers that these syllogisms do not have strict but approximate (Zadeh) validity. Typically there are only particular premises available in everyday life and one is dependent on such syllogisms. – Some rules on the (...) usage of particular premises are given below. (shrink)

We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.

Journal of Mathematical Logic, Volume 22, Issue 03, December 2022. We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory [math] of [E. Jeřábek, Approximate counting by hashing in bounded arithmetic, J. Symb. Log. 74(3) (2009) 829–860]. In particular, the Ramsey and weak pigeonhole search problems lie in the new class. We give a purely computational (...) characterization of this class and show that, relative to an oracle, it does not contain the problem CPLS, a strengthening of PLS. As CPLS is provably total in the theory [math], this shows that [math] does not prove every [math] sentence which is provable in bounded arithmetic. This answers the question posed in [S. Buss, L. A. Kołodziejczyk and N. Thapen, Fragments of approximate counting, J. Symb. Log. 79(2) (2014) 496–525] and represents some progress in the program of separating the levels of the bounded arithmetic hierarchy by low-complexity sentences. Our main technical tool is an extension of the “fixing lemma” from [P. Pudlák and N. Thapen, Random resolution refutations, Comput. Complexity, 28(2) (2019) 185–239], a form of switching lemma, which we use to show that a random partial oracle from a certain distribution will, with high probability, determine an entire computation of a [math] oracle machine. The introduction to the paper is intended to make the statements and context of the results accessible to someone unfamiliar with NP search problems or with bounded arithmetic. (shrink)

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)

In this article, we offer a detailed study of two important episodes in the early history of high-energy physics, namely the development of the Chew and the Nambu-Jona-Lasinio models. Our study reveals that both models resulted from the combination of an old Hamiltonian, which had been introduced by earlier researchers, and two new approximation methods developed by Chew and by Nambu and Jona-Lasinio. These new approximation methods, furthermore, were the key component behind the models’ success. We take this (...) historical investigation to support two philosophical theses about the manner in which scientific modelling operates in high-energy physics. Both of these theses run counter to a view that is commonly accepted among philosophers of science: the view that all approximations can be embedded within an equivalent idealized system, and that whatever role the former might play in scientific modelling is therefore parasitic on the much more substantial work performed by the latter. Our first thesis, which we call “Distinctness,” states that approximation methods constitute an independent category of theoretical output from idealized systems. We thus believe that approximations and idealized systems constitute two independent types of objects, both of which are essential to the practice of modelling. Our second, more radical thesis is called “Content Determination.” Our claim here is that approximation methods can in fact be essential to assigning determinate physical content to the idealized systems with which they jointly operate. As we show, this is due to the fact that quantum field theory allows for a very thin characterization of idealized systems only, making the use of approximations necessary to supply additional content. We conclude the paper with a few reflections about the manner in which our two theses can be used to articulate David Kaiser’s views on the “vanishing of scientific theory” in physics after WWII. (shrink)

In this paper I show that Goodman's theory of projectibility, although partly successful, is inadequate since it fails to take into consideration the "approximate" nature of certain scientific hypotheses.

It is well known that the computational complexity of propositional knowledge base revision is at the second level of polynomial hierarchy. A way to solve this kind of problems is to introduce approximate algorithms. In this paper, an approximate approach is introduced for belief change. Operators, which satisfy the AGM rational postulates, are defined to change belief sets or belief bases. Furthermore, approximate algorithms to implement the revision of finite belief bases are presented. The time complexities of the approximate algorithms (...) shown in this paper are at lower level than the time complexities of the existed approaches in literatures, although they may not generate the optimal solution, and this is meaningful from the theoretical point of view. (shrink)

Despite the pervasive use of idealizations and approximations in science, the issue of their role has been neglected or misunderstood by philosophers. Idealizations enter into a scientific analysis or explanation in at least two ways. First, they may be embodied in the very statement or formulation of laws and theories; I call such laws idealizational laws. Second, they may be conjoined to a theory as extraneous assumptions, mainly to make it easier to work with the theory. I first examine the (...) problems of testing pertaining to idealizational laws. I argue that the major theories of confirmation face difficulties in accounting for the confirmation and disconfirmation of such laws. Underlying their difficulties is the fact that those laws are about nonexistent objects. The analysis I propose of the testing of idealizational laws is based on the fact that idealized objects comprising the domains of such laws can be approximated by real objects. ;I next investigate the problems of testing in relation to theories and hypotheses which are fed idealizational assumptions and approximations from outside. In the course of my discussion of the issues surrounding the use of idealizations and approximations in science, I critically examine the views of Milton Friedman, Clark Glymour and Ronald Laymon. In the final chapter I propose an analysis of confirmation which is within the Bayesian tradition. My analysis, if correct, is an improvement over the standard Bayesian framework in two respects. First, it is a more realistic representation of the testing process in actual science. Secondly, it is capable of solving "the problem of old evidence," which has recently troubled traditional Bayesianism. Both of these advantages my analysis achieves by taking as the evidence not the observation itself, but the error or discrepancy between the observation and what was predicted by the theory in conjunction with the idealizations and approximations. ;In the Appendix I argue against a prevalent view among physicists and philosophers of science concerning the interpretation of the domain of Newton's second law, viz. the view that the domain of this law, when properly stated, consists of point-masses. (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)

This paper develops an explicit, pragmatic solution to the problem of deciding when an explanans which only approximately "covers" a desired event-explanandum E is acceptable as an adequate explanation. It shows in detail how comparisons made by the explanation's audience with the numerical value in E are what determine how closely E must be approximated for success. With the aid of several physics examples, it spells out the principles that govern these explanandum-comparisons, the conditions under which those principles hold, and (...) the audience traits that influence which comparisons they take seriously. (shrink)

It is proposed that we use the term “approximation” for inexact description of a target system and “idealization” for another system whose properties also provide an inexact description of the target system. Since systems generated by a limiting process can often have quite unexpected, even inconsistent properties, familiar limit systems used in statistical physics can fail to provide idealizations, but are merely approximations. A dominance argument suggests that the limiting idealizations of statistical physics should be demoted to approximations.

In this paper, we investigate the problem of truth approximation via belief merging, i.e., we ask whether, and under what conditions, a group of inquirers merging together their beliefs makes progress toward the truth about the underlying domain. We answer this question by proving some formal results on how belief merging operators perform with respect to the task of truth approximation, construed as increasing verisimilitude or truthlikeness. Our results shed new light on the issue of how rational (dis)agreement (...) affects the inquirers’ quest for truth. In particular, they vindicate the intuition that scientific inquiry, and rational discussion in general, benefits from some heterogeneity in opinion and interaction among different viewpoints. The links between our approach and related analyses of truth tracking, judgment aggregation, and opinion dynamics, are also highlighted. (shrink)

We investigate the logical and conceptual connections between abductive reasoning construed as a process of belief change, on the one hand, and truth approximation, construed as increasing (estimated) verisimilitude, on the other. We introduce the notion of ‘(verisimilitude-guided) abductive belief change’ and discuss under what conditions abductively changing our theories or beliefs does lead them closer to the truth, and hence tracks truth approximation conceived as the main aim of inquiry. The consequences of our analysis for some recent (...) discussions concerning belief revision aiming at truth approximation and inference to the best explanation are also highlighted. (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)

We call an $\alpha \in \mathbb {R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha $ with $\alpha - a_n n}$ for infinitely many n. Similarly, there exist regainingly approximable sets whose initial segment complexity infinitely often reaches the maximum possible for c.e. sets. Finally, there is a uniform algorithm splitting regular real numbers into two regainingly approximable numbers that are still regular.

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 Ganser syndrome, or talking past the point, (originally identifying symptoms of inmates on remand when questioned by prison doctors), is explored as a form of insubordination against the stigmatizing effects of overdetermined diagnostic categories. The strategies of approximation that characterize the syndrome are likened to comedy routines/vaudeville styles and to their employment of punning, clownery, and ambiguity to challenge the more privileged cultural values of clarity, literalness, and precision. The seeming craftiness of Ganserians is related to the aesthetic (...) tactics of the trickster figure and to the physical buffoonery of hysterics. Stylistically, this paper synthesizes the languages of critical theory, Gracie Allen routines, personal narrative, jokes, and poetic reflections on the notion of being approximate. (shrink)

A new approach for a uniform classification of the computably approximable real numbers is introduced. This is an important class of reals, consisting of the limits of computable sequences of rationals, and it coincides with the 0'-computable reals. Unlike some of the existing approaches, this applies uniformly to all reals in this class: to each computably approximable real x we assign a degree structure, the structure of all possible ways available to approximate x. So the main criterion for such classification (...) is the variety of the effective ways we have to approximate a real number. We exhibit extreme cases of such approximation structures and prove a number of related results. (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)

Research on the cognitive abilities involved in decision making has shown that, under objective risk conditions (i.e., when explicit information about possible outcomes and risks is available), superior decisions are especially predicted by executive functions and exact number processing skills, also referred to as objective numeracy. So far, decision-making research has mainly focused on exact number processing skills, such as performing calculations or transformations of symbolic numbers. There is evidence that such exact numeric skills are based on approximate number processing (...) (ANP) skills, which enable quick and accurate processing of non-symbolic numbers (e.g. Chen and Li, 2014). Very few studies, however, have investigated ANP skills in the context of risky decision making and have analyzed direct associations among the aforementioned sub functions. Possible interactions between the closely related skills have not been considered. The current study (N = 128) examines interactions of ANP skills with executive functions and objective numeracy, in predicting risky choice behavior. ANP skills are represented by the accuracy in a dot-comparison task. Decision making is measured by two versions of the Game of Dice Task (GDT), which place different emphases on the reflection of potential risks. The results show two-way as well as three-way interactions between the measures of ANP skills, executive functions, and objective numeracy in predicting risky decisions in both GDT versions. The riskiest decisions were most frequently made in case of low scores in all of the three competencies, while good performance in any one of them resulted in significant reductions of disadvantageous decisions. The findings indicate that high ANP skills can positively affect choice behavior in individuals who have weaknesses in reflectively attributed skills, namely executive functions and objective numeracy. Potential compensatory effects and mechanisms of ANP in decision making are discussed. (shrink)

We study Δ2 reals x in terms of how they can be approximated symmetrically by a computable sequence of rationals. We deal with a natural notion of ‘approximation representation’ and study how these are related computationally for a fixed x. This is a continuation of earlier work; it aims at a classification of Δ2 reals based on approximation and it turns out to be quite different than the existing ones (based on information content etc.).

This paper describes a theory of accuracy or approximate truth and applies it to problems in the realist interpretation of scientific theories. It argues not only that realism requires approximate truth, but that an adequate theory of approximation also presupposes some elements of a realist interpretation of theories. The paper distinguishes approximate truth from vagueness, probability and verisimilitude, and applies it to problems of confirmation and deduction from inaccurate premises. Basic results are cited, but details appear elsewhere. Objections are (...) surveyed, including arguments by Miller, Laymon, and Laudan. Comparison is made with Niiniluoto's theory of verisimilitude, and the utility of his theory for realism assessed. (shrink)

Traditional theories construe approximate truth or truthlikeness as a measure of closeness to facts, singular facts, and idealization as an act of either assuming zero of otherwise very small differences from facts or imagining ideal conditions under which scientific laws are either approximately true or will be so when the conditions are relaxed. I first explain the serious but not insurmountable difficulties for the theories of approximation, and then argue that more serious and perhaps insurmountable difficulties for the theory (...) of idealization force us to sever its close tie to approximation. This leads to an appreciation of lawlikeness as a measure of closeness to laws, which I argue is the real measure of idealization whose main purpose is to carve nature at its joints. (shrink)

We apply a method analogous to the eikonal approximation to the Maxwell wave equations in an inhomogeneous anisotropic medium and geodesic motion in a three dimensional Riemannian manifold, using a method which identifies the symplectic structure of the corresponding mechanics, to the five dimensional generalization of Maxwell theory required by the gauge invariance of Stueckelberg's covariant classical and quantum dynamics. In this way, we demonstrate, in the eikonal approximation, the existence of geodesic motion for the flow of mass (...) in a four dimensional pseudo-Riemannian manifold. These results provide a foundation for the geometrical optics of the five dimensional radiation theory and establish a model in which there is mass flow along geodesics. We then discuss the interesting case of relativistic quantum theory in an anisotropic medium as well. In this case the eikonal approximation to the relativistic quantum mechanical current coincides with the geodesic flow governed by the pseudo-Riemannian metric obtained from the eikonal approximation to solutions of the Stueckelberg–Schrödinger equation. The locally symplectic structure which emerges is that of a generally covariant form of Stueckelberg's mechanics on this manifold. (shrink)

Approximations form an essential part of scientific activity and they come in different forms: conceptual approximations (simplifications in models), mathematical approximations of various types (e.g. linear equations instead of non-linear ones, computational approximations), experimental approximations due to limitations of the instruments and so on and so forth. In this paper, we will consider one type of approximation, namely numerical approximations involved in the comparison of two results, be they experimental or theoretical. Our goal is to lay down the conceptual (...) and formal foundations of a local theory of partial truth. This is done by introducing and exploring the concept of truth space. (shrink)

We study the approximation properties of computably enumerable reals. We deal with a natural notion of approximation representation and study their wtt-degrees. Also, we show that a single representation may correspond to a quite diverse variety of reals.

This paper highlights some connections between work on truth approximation and work in social epistemology, in particular work on peer disagreement. In some of the literature on truth approximation, questions have been addressed concerning the efficiency of research strategies for approximating the truth. So far, social aspects of research strategies have not received any attention in this context. Recent findings in the field of opinion dynamics suggest that this is a mistake. How scientists exchange and take into account (...) information about each others’ beliefs may greatly influence the accuracy and speed with which the scientific community as a whole approximates the truth. On the other hand, social epistemologists concerned with peer disagreement have so far neglected the question of how practices of responding to disagreements with peers fare with respect to the goal of approximating the truth. Again, work on opinion dynamics shows that this may be a mistake, and that how we ought to respond to disagreements with our peers may depend on the specific purposes of our investigations. (shrink)

The so-called Preface Paradox seems to show that one can rationally believe two logically incompatible propositions. We address this puzzle, relying on the notions of truthlikeness and approximate truth as studied within the post-Popperian research programme on verisimilitude. In particular, we show that adequately combining probability, approximate truth, and truthlikeness leads to an explanation of how rational belief is possible in the face of the Preface Paradox. We argue that our account is superior to other solutions of the paradox, including (...) a recent one advanced by Hannes Leitgeb (Analysis 74.1). (shrink)

De Cock and Kerre, in considering Poincaré paradox, observed that the intuitive notion of "approximate similarity" cannot be adequately represented by the fuzzy equivalence relations. In this note we argue that the deduction apparatus of fuzzy logic gives adequate tools with which to face the question. Indeed, a first-order theory is proposed whose fuzzy models are plausible candidates for the notion of approximate similarity. A connection between these structures and the point-free metric spaces is also established.

There is good reason to suppose that our best physical theories, quantum mechanics and special relativity, are false if taken together and literally. If they are in fact false, then how should they count as providing knowledge of the physical world? One might imagine that, while strictly false, our best physical theories are nevertheless in some sense probably approximately true. This paper presents a notion of local probable approximate truth in terms of descriptive nesting relations between current and subsequent theories. (...) This notion helps explain how false physical theories might nevertheless provide physical knowledge of a variety that is particularly salient to diachronic empirical inquiry. (shrink)

We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV)), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP, APP, MA, AM) in PV₁ + dWPHP(PV).

This paper, which is based on recent empirical research at the University of Leeds, the University of Edinburgh, and the University of Bristol, presents two difficulties which arise when condensed matter physicists interact with molecular biologists: the former use models which appear to be too coarse-grained, approximate and/or idealized to serve a useful scientific purpose to the latter; and the latter have a rather narrower view of what counts as an experiment, particularly when it comes to computer simulations, than the (...) former. It argues that these findings are related; that computer simulations are considered to be undeserving of experimental status, by molecular biologists, precisely because of the idealizations and approximations that they involve. The complexity of biological systems is a key factor. The paper concludes by critically examining whether the new research programme of ‘systems biology’ offers a genuine alternative to the modelling strategies used by physicists. It argues that it does not. (shrink)

We study concepts of decidability for subsets of Euclidean spaces ℝk within the framework of approximate computability . A new notion of approximate decidability is proposed and discussed in some detail. It is an effective variant of F. Hausdorff's concept of resolvable sets, and it modifies and generalizes notions of recursivity known from computable analysis, formerly used for open or closed sets only, to more general types of sets. Approximate decidability of sets can equivalently be expressed by computability of the (...) characteristic functions by means of appropriately working oracle Turing machines. The notion fulfills some natural requirements and is hereditary under canonical embeddings of sets into spaces of higher dimensions. However, it is not closed under binary union or intersection of sets. We also show how the framework of resolvability and approximate decidability can be applied to investigate concepts of reducibility for subsets of Euclidean spaces. (shrink)

Arguably, there is no substantial, general answer to the question of what makes for the approximate truth of theories. But in one class of cases, the issue seems simply resolved. A wide class of applied dynamical theories can be treated as two-component theories—one component specifying a certain kind of abstract geometrical structure, the other giving empirical application to this structure by claiming that it replicates, subject to arbitrary scaling for units etc., the geometric structure to be found in some real-world (...) dynamical phenomenon. In such a case, a theory is approximately true just if the one geometric structure approximately replicates the other (and if problems remain here, they are problems in geometry, of specifying suitable metric approximation relations, not conceptual problems). This article amplifies and defends this simple approach to approximate truth for dynamical theories. (shrink)

A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively approximable real numbers by the convergence rates of the corresponding computable sequences ofr ational numbers.

Kant insists that definitions cannot be set in stone at the outset of a metaphysical investigation, but instead must be developed successively over the course of it, and should ideally be finalized only at the end. He even suggests that the task of a critical treatment of metaphysical concepts lies in an infinite approximation towards the essence of what they purport to designate. My focus is on this Kantian idea of approximating essence in definition. I begin with a reading (...) of Kant’s remarks on the methodology of definition in the Doctrines of Method of the Critique of Pure Reason and of the Jäsche Logic. On that basis I develop an account of what I take to be the most crucial application of that methodology, which nonetheless presents a lacuna in recent scholarship: Kant’s successive definition of the concept of the understanding in general, or the overall capacity for thought and cognition. I close by suggesting how this application might matter for Kant’s project of enlightenment. (shrink)

The technical results presented here on continuity and approximate implication are obviously incomplete. In particular, a syntactic characterization of approximate implication is highly desirable. Nevertheless, I believe the results above do show that the theory has considerable promise for application to the areas mentioned at the top of the paper.Formulation and defense of realist interpretations of science, for example, require approximate truth because we hardly ever have evidence that a particular scientific theory corresponds perfectly with a portion of the real (...) world. Realists need to assert, then, that evidence for a theory is evidence for its approximate truth, not its truth (see [3] and [18]). Approximate truth is, however, a vague notion, and specification of quantity terms and of a sense of approximation are needed to make precise applications of it. Suitability of both vocabulary and sense of approximation depend on the subject matter, and their selection is a partly empirical matter that raises complex issues. In light of the number of common inferences which are not continuous, realists also need to be concerned about indiscriminate use of deductive logic to derive consequences from approximately true theories. These issues will be considered further in a future paper.Approximate truth also has potential application in areas of artificial intelligence that require inference from inaccurate data. In the ‘qualitative’ physical theories of de Kleer and Brown [6], for example, ‘qualitative’ values are derived by partitioning the real numbers into regions. Inferences leading from inside to outside a region must be identified and avoided, and approximate implication and continuity may prove useful in doing this. More generally, growing use of predicate logic as a programming language invites application of the theory of approximate truth as a symbolic substitute for numerical evaluation of computation errors. This too will be the subject of a future paper. (shrink)

According to approximate Bayesianism, Bayesian norms are ideal norms worthy of approximation for non-ideal agents. This paper discusses one potential challenge for approximate Bayesianism: in non-transparent learning situations—situations where the agent does not learn what they have or have not learnt—it is unclear that the Bayesian norms are worth satisfying, let alone approximating. I discuss two replies to this challenge and find neither satisfactory. I suggest that what transpires is a general tension between approximate Bayesianism and the possibility of (...) “non-ideal” epistemic situations. (shrink)

The Wigner–Weyl mapping of quantum operators to classical phase space functions preserves the algebra, when operator multiplication is mapped to the binary “*” operation. However, this isomorphism is destroyed under the quasiclassical substitution of * with conventional multiplication; consequently, an approximate mapping is required if algebraic relations are to be preserved. Such a mapping is uniquely determined by the fundamental relations of quantum mechanics, as is shown in this paper. The resultant quasiclassical approximation leads to an algebraic derivation of (...) Thomas–Fermi theory, and a new quantization rule which—unlike semiclassical quantization—is non-invariant under action transformations of the Hamiltonian, in the same qualitative manner as the true eigenvalues. The quasiclassical eigenvalues are shown to be significantly more accurate than the corresponding semiclassical values, for a variety of 1D and 2D systems. In addition, certain standard refinements of semiclassical theory are shown to be easily incorporated into the quasiclassical formalism. (shrink)

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov [2] and by Ben Yaacov, Doucha, Nies, and Tsankov [6], which are largely incompatible. With this we explicitly exhibit Scott sentences for the perturbation systems of the former paper, such as the Banach‐Mazur distance and the Lipschitz distance between metric spaces. Our formalism is simultaneously characterized syntactically by a mild generalization of perturbation systems and semantically by certain elementary classes of two‐sorted (...) structures that witness approximate isomorphism. As an application, we show that the theory of any ‐tree or ultrametric space of finite radius is stable, improving a result of Carlisle and Henson [8]. (shrink)

What role does our knowledge about the ideal society play in guiding policymaking in the real world? One intuitive answer is to approximate. Namely, we have a duty to approximate the ideal within the relevant constraints of feasibility. However, political philosophers seem to have what might be called ‘approximatophobia'. Many philosophers, including idealists such as David Estlund, warn against approximation. Their criticism is chiefly motivated by ‘the problem of second best’, which points out that your second-best option may not (...) be closest to your best option. This paper aims to dispel ‘approximatophobia'. The difficulty posed by the problem of second best is often overstated. More positively, I present a novel defence of approximation, arguing that approximation of an ideal can be a reasonably reliable default strategy of action guidance in the real world. Difficulties that may afflict the project of approximation can be mitigated by sophistication of the project of approximation. After showing that critics of approximation overstep their mark in issuing the strong or moderate warning against approximation, I propose an account of sophisticated approximation. It seeks a series of reforms that make existing social institutions closer to the ideal based on careful selection of frame of analysis. Three virtuous correlations are identified as indicators for successful project of approximation, linking descriptive similarity to desirability, feasibility and knowledge of the ideal. I also explain a two-staged strategy of sophisticating the way you approximate the ideal, with an expected positive feedback effect. (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)