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)

We develop a version of Herbrand's theorem for continuous logic and use it to prove that definable functions in infinite-dimensional Hilbert spaces are piecewise approximable by affine functions. We obtain similar results for definable functions in Hilbert spaces expanded by a group of generic unitary operators and Hilbert spaces expanded by a generic subspace. We also show how Herbrand's theorem can be used to characterize definable functions in absolutely ubiquitous structures from classical logic.

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)

This paper supplies a structuralist reconstruction of the Modigliani-Miller theory and shows that the economic literature following their results reports on research with an implicit strategy to come "closer-to-the-truth" in the modern technical sense in philosophy of science.

Shi and Aharonov have shown that the Toffoli gate and the Hadamard gate give rise to an approximately universal set of quantum computational gates. We study the basic algebraic properties of this system by introducing the notion of Shi-Aharonov quantum computational structure. We show that the quotient of this structure is isomorphic to a structure based on a particular set of complex numbers (the closed disc with center \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(\frac{1}{2},\frac{1}{2})$\end{document} (...) and radius \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\frac{1}{2}$\end{document} ). (shrink)

Following the idea of L -fuzzy generalized neighborhood systems as introduced by Zhao et al., we will give the join-complete lattice structures of lower and upper approximation operators based on L -fuzzy generalized neighborhood systems. In particular, as special approximation operators based on L -fuzzy generalized neighborhood systems, we will give the complete lattice structures of lower and upper approximation operators based on L -fuzzy relations. Furthermore, if L satisfies the double negative law, then there exists an (...) order isomorphic mapping between upper and lower approximation operators based on L -fuzzy generalized neighborhood systems; when L -fuzzy generalized neighborhood system is serial, reflexive, and transitive, there still exists an order isomorphic mapping between upper and lower approximation operators, respectively, and both lower and upper approximation operators based on L -fuzzy relations are complete lattice isomorphism. (shrink)

A single abstract from the DHd-2020 Book ofs.

The present article covers the first part of our constructive-axiomatic approach to general spacetime, guided by Ludwig's conception of an axiomatic base. The leading idea of axiomatization is a generalized version of the equivalence principle—the principle of approximative reproducibility. As fundamental concepts we use processes and reproductions of processes. On the universe of processes the point space of events is founded which carries the familiar properties of spacetime topology. A general contact relation for reproductions is the key structure to (...) build up a group of tangential germs (pre-jets). Finally, using Yamabe's characterization we obtain the Lie structure. (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.).

The relevance of exchange effects for the stability of superheavy nuclei is examined within a linear QHD-II model by comparing Hartree-Fock with meanfield results. To allow a scan of the complete superheavy regime the recently developed local density approximation (LDA) for the exchange potential is employed for the Hartree-Fock level calculations. It turns out that, while many nuclear properties obtained with the LDA approach differ significantly from the corresponding mean-field results, the predictions of the two methods for shell closures (...) are very similar. Furthermore, a comparison with a nonlinear variant of QHD-II shows that many nuclear properties obtained with the LDA in the framework of linear QHD-II are somewhere in-between the corresponding linear and nonlinear mean-field results. This indicates that the LDA exchange partially includes nonlinear contributions, which supports the interpretation of the meson self-coupling as a parametrization of many-body effects. (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)

We define the notion of approximate Euler characteristic of definable sets of a first order structure. We show that a structure admits a non-trivial approximate Euler characteristic if it satisfies weak pigeonhole principle WPHP2nn: two disjoint copies of a non-empty definable set A cannot be definably embedded into A, and principle CC of comparing cardinalities: for any two definable sets A, B either A definably embeds in B or vice versa. Also, a structure admitting a non-trivial approximate (...) Euler characteristic must satisfy WPHP2nn.Further we show that a structure admits a non-trivial dimension function on definable sets if and only if it satisfies weak pigeonhole principle WPHPn2n: for no definable set A with more than one element can A2 definably embed into A. (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.

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)

The standard theory for belief revision provides an elegant and powerful framework for reasoning about how a rational agent should change its beliefs when confronted with new information. However, the agents considered are extremely idealized. Some recent models attempt to tackle the problem of plausible belief revision by adding structure to the belief bases and using nonstandard inference operations. One of the key ideas is that not all of an agent's beliefs are relevant for an operation of belief change.In (...) this paper we incorporate the insights pertaining to local change and relevance sensitivity with the use of approximate inference relations. These approximate inference relations offer us partial solutions at any stage of the revision process. The quality of the approximations improves as we allow for more and more resources to be used. We are provided with upper and lower bounds to what would be obtained with the use of classical inference. (shrink)

In this paper we start from the assumption that in a metaphor, or an analogy, some terms belonging to one domain (source domain) are used to refer to objects other than their conventional referents belonging to a possibly different domain (target domain). We describe a formalism, which is based on the First Order Predicate Calculus, for representing the knowledge structure associated with a domain and then develop a theory of Constrained Semantic Transference [CST] which allows the terms and the (...) structural relationships of the source domain to be transferred coherently across to the target domain. We show how metaphors and analogies can be characterized in CST in such a way that many of their cognitive properties con be explained.We then propose a theory of Approximate Semantic Transference [AST] which is a computational version of CST and is derived from it by replacing the coherency requirement with approximate coherency. We show how AST can be used as a basis for designing models of cognitive processes involved in comprehending metaphors and analogies. (shrink)

I argue that molecules may not have structure in isolation. I support this by investigating how quantum models identify structure for isolated molecules. Specifically, I distinguish between two sets of models: those that identify structure in isolation and those that do not. The former identify structure because they presuppose structural information about the target system via the Born- Oppenheimer approximation. However, it is an idealisation to assume structure in isolation because there is no empirical (...) evidence of this. In fact, whenever structure is empirically examined it is always partially determined by factors that are absent in isolation. Together with the growing empirical evidence that isolated molecules behave in non-classical ways, this shows that the quantum models that do not identify structure are more faithful representations of isolated molecules. (shrink)

What is it reasonable to believe about our most successful scientific theories such as the general theory of relativity or quantum mechanics? That they are true, or at any rate approximately true? Or only that they successfully ‘save the phenomena’, by being ‘empirically adequate’? In earlier work I explored the attractions of a view called Structural Scientific Realism (hereafter: SSR). This holds that it is reasonable to believe that our successful theories are (approximately) structurally correct (and also that this is (...) the strongest epistemic claim about them that it is reasonable to make). In the first part of this paper I shall explain in some detail what this thesis means and outline the reasons why it seems attractive. The second section outlines a number of criticisms that have none the less been brought against SSR in the recent (and as we shall see, in some cases, not so recent) literature; and the third and final section argues that, despite the fact that these criticisms might seem initially deeply troubling (or worse), the position remains viable. (shrink)

Merely approximate symmetry is mundane enough in physics that one rarely finds any explication of it. Among philosophers it has also received scant attention compared to exact symmetries. Herein I invite further consideration of this concept that is so essential to the practice of physics and interpretation of physical theory. After motivating why it deserves such scrutiny, I propose a minimal definition of approximate symmetry—that is, one that presupposes as little structure on a physical theory to which it is (...) applied as seems needed. Then I apply this definition to three topics: first, accounting for or explaining the symmetries of a theory emeritus in intertheoretic reduction; second, explicating and evaluating the Curie-Post principle; and third, a new account of accidental symmetry. (shrink)

An approach to argument macrostructure -- The dialectical nature of argument -- Toulmin's problematic notion of warrant -- The linked-convergent distinction, a first approximation -- Argument structure and disciplinary perspective : the linked-convergent versus multiple-co-ordinatively compound distinctions -- The linked-convergent distinction, refining the criterion -- Argument structure and enthymemes -- From analysis to evaluation.

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)

This monograph presents new ideas in nomic truth approximation. It features original and revised papers from a philosopher of science who has studied the concept for more than 35 years. Over the course of time, the author's initial ideas evolved. He discovered a way to generalize his first theory of nomic truth approximation, viz. by dropping an unnecessarily strong assumption. In particular, he first believed to have to assume that theories were maximally specific in the sense that they (...) did not only exclude certain conceptual possibilities, but also that all non-excluded possibilities were in fact claimed to be nomically possible. Now, he argues that the exclusion claim alone, or for that matter the inclusion claim alone, is sufficient to motivate the formal definition of being closer to the nomic truth. The papers collected here detail this generalized view of nomic truthlikeness or verisimilitude. Besides this, the book presents, in adapted form, the relation with several other topics, such as, domain revision, aesthetic progress, abduction, inference to the best explanation, pragmatic aspects, probabilistic methods, belief revision and epistemological positions, notably constructive realism. Overall, the volume presents profound insight into nomic truth approximation. This idea seeks to determine how one theory can be closer to, or more similar to, the truth about what is nomically, e.g. physically, chemically, biologically, possible than another theory. As a result, it represents the ultimate goal of theory oriented empirical science. Theo Kuipers is the author of Studies in Inductive Probability and Rational Expectation, From Instrumentalism to Constructive Realism and Structures in Science. He is the volume-editor of the Handbook on General Philosophy of Science. In 2005 there appeared two volumes of Essays in Debate with Theo Kuipers, entitled Confirmation, Empirical Progress, and Truth Approximation and Cognitive Structures in Scientific Inquiry. (shrink)

The aim of this paper is to revisit the phlogiston theory to see what can be learned from it about the relationship between scientific realism, approximate truth and successful reference. It is argued that phlogiston theory did to some extent correctly describe the causal or nomological structure of the world, and that some of its central terms can be regarded as referring. However, it is concluded that the issue of whether or not theoretical terms successfully refer is not the (...) key to formulating the appropriate form of scientific realism in response to arguments from theory change, and that the case of phlogiston theory is shown to be readily accommodated by ontic structural realism. (shrink)

Ordinary measurement using a standard scale, such as a ruler or a standard set of weights, has two fundamental properties. First, the results are approximate, for example, within 0.1 g. Second, the resulting indistinguishability is transitive, rather than nontransitive, as in the standard psychological comparative judgments without a scale. Qualitative axioms are given for structures having the two properties mentioned. A representation theorem is then proved in terms of upper and lower measures.

Several approaches to quantum gravity signal the loss of spacetime at some level. According to spacetime functionalism, spacetime is functionally realised by a more fundamental structure. According to one version of spacetime functionalism, the spacetime role is specified by Ramsifying general relativity. In some approaches to QG, however, there does not appear to be anything that exactly realises the functional role defined by a Ramsey sentence for GR. The spacetime role is approximately realised. It is open to the spacetime (...) functionalist to adopt a ‘near enough is good enough’ attitude to functional realisation, and maintain that spacetime is functionally realised nonetheless. In this paper I present a challenge for such an ‘approximate’ spacetime functionalism. The challenge, in brief, is to provide an account of how ‘close’ is close enough for approximate realisation to occur. I canvass a range of options for spelling out a similarity relation of the relevant kind, and argue that none are successful. In light of the challenge, I recommend giving up on the functional realisation of spacetime. I argue, however, that even if spacetime as a whole is not functionally realised, some of the functions of spacetime may still be performed. (shrink)

In many applications we have a set of objects together with their properties. Since the available information is usually incomplete and/or imprecise, the true knowledge about subsets of objects can be determined approximately only. In this paper, we discuss a fuzzy generalisation of two pairs of relation-based operators suitable for fuzzy set approximations, which have been recently investigated by Düntsch and Gediga. Double residuated lattices, introduced by Orlowska and Radzikowska, are taken as basic algebraic structures. Main properties of these operators (...) are presented. (shrink)

In this paper, we give a possible characterization of the distributivity on bi-approximation semantics. To this end, we introduce new notions of special elements on polarities and show that the distributivity is first-order definable on bi-approximation semantics. In addition, we investigate the dual representation of those structures and compare them with bi-approximation semantics for intuitionistic logic. We also discuss that two different methods to validate the distributivity—by the splitters and by the adjointness—can be explicated with the help (...) of the axiom of choice as well. (shrink)

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class, a special kind of multidimensional asymptotic class with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result, as conjectured by Macpherson: For any countable language $\mathcal {L}$ and any positive integer d the class $\mathcal {C}$ (...) of all finite $\mathcal {L}$-structures with at most d 4-types is a polynomial exact class in $\mathcal {L}$, where a polynomial exact class is a multidimensional exact class with polynomial measuring functions. (shrink)

Exact solutions of epidemic models are critical for identifying the severity and mitigation possibility for epidemics. However, solving complex models can be difficult when interfering conditions from the real-world are incorporated into the models. In this paper, we focus on the generally unsolvable adaptive susceptible-infected-susceptible epidemic model, a typical example of a class of epidemic models that characterize the complex interplays between the virus spread and network structural evolution. We propose two methods based on mean-field approximation, i.e., the first-order (...) mean-field approximation and higher-order mean-field approximation, to derive the exact solutions to ASIS models. Both methods demonstrate the capability of accurately approximating the metastable-state statistics of the model, such as the infection fraction and network density, with low computational cost. These methods are potentially powerful tools in understanding, mitigating, and controlling disease outbreaks and infodemics. (shrink)

We introduce and discuss a concept of approximation of a topological algebraic system A by finite algebraic systems from a given class K. If A is discrete, this concept agrees with the familiar notion of a local embedding of A in a class K of algebraic systems. One characterization of this concept states that A is locally embedded in K iff it is a subsystem of an ultraproduct of systems from K. In this paper we obtain a similar characterization (...) of approximability of a locally compact system A by systems from K using the language of nonstandard analysis. In the signature of A we introduce positive bounded formulas and their approximations; these are similar to those introduced by Henson [14] for Banach space structures (see also [15, 16]). We prove that a positive bounded formula φ holds in A if and only if all precise enough approximations of φ hold in all precise enough approximations of A. We also prove that a locally compact field cannot be approximated arbitrarily closely by finite (associative) rings (even if the rings are allowed to be non-commutative). Finite approximations of the field R can be considered as possible computer systems for real arithmetic. Thus, our results show that there do not exist arbitrarily accurate computer arithmetics for the reals that are associative rings. (shrink)

As a result of the complexity inherent in some natural systems, mathematical models employed in ecology are often governed by a large number of variables. For instance, in the study of population dynamics we often find multiregional models for structured populations in which individuals are classified regarding their age and their spatial location. Dealing with such structured populations leads to high dimensional models. Moreover, in many instances the dynamics of the system is controlled by processes whose time scales are very (...) different from each other. For example, in multiregional models migration is often a fast process in comparison to the growth of the population.Approximate reduction techniques take advantage of the presence of different time scales in a system to introduce approximations that allow one to transform the original system into a simpler low dimensional system. In this way, the dynamics of the original system can be approximated in terms of that of the reduced system. This work deals with the study of that approximation. In particular, we work with a non-autonomous discrete time model previously presented in the literature and obtain different bounds for the error we incur when we describe the dynamics of the original system in terms of the reduced one. (shrink)

Generalized structured component analysis (GSCA) is a component-based approach to structural equation modeling (SEM), where latent variables are approximated by weighted composites of indicators. It has no formal mechanism to incorporate errors in indicators, which in turn renders components prone to the errors as well. We propose to extend GSCA to account for errors in indicators explicitly. This extension, called GSCA_M, considers both common and unique parts of indicators, as postulated in common factor analysis, and estimates a weighted composite of (...) indicators with their unique parts removed. Adding such unique parts or uniqueness terms serves to account for measurement errors in indicators in a manner similar to common factor analysis. Simulation studies are conducted to compare parameter recovery of GSCA_M and existing methods. These methods are also applied to fit a substantively well-established model to real data. (shrink)