We study the long-standing open problem of giving$\forall {\rm{\Sigma }}_1^b$separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the$\forall {\rm{\Sigma }}_1^b$Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole (...) principle for FPNPfunctions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of$T_2^1$augmented with the surjective weak pigeonhole principle for polynomial time functions. (shrink)

The example can be generalized. Suppose that ϕ and ψ are suffi- ciently different functions of an independent variable t. We may show that whenever X’s predictions for ϕ and ψ lie (weakly) between Z’s predictions and T’s predictions (the true values), then there are other quantities, interdefinable with ϕ and ψ, that reverse the ordering.

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)

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)

In this paper we aim to develop an indispensability argument in support of the existence of virtual particles in scattering processes. In order to avoid the Paradox of Infinite Limits, which allegedly poses a challenge to scientific realism, one needs to de-idealize the fictitious systems introduced by the two limiting procedures employed in the perturbation scheme, namely the infinite expansion in Dyson series and the limits for negative and positive infinite times associated with the assumption of free particles. We (...) show that these limits do not introduce essential idealizations, in agreement with scientific realism. What is more, according to our argument, unobservable virtual particles arise as essential approximations and they should be interpreted as propagators of the interaction responsible for subatomic scattering. As such, their existence is based on the use of approximations that matter. (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)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially (...) using a third-order accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

Nous proposons dans cet article un développement de l’idée proposée par F.A. Hayek selon laquelle l’ordre du droit coutumier est un ordre d’action, une coordination des plans individuels dans un système d’échange régi par ce droit. Cette conception s’oppose à l’idée suivant laquelle l’ordre légal doit être avant tout fondé sur la cohérence logique des concepts et doctrines de ce droit. Un exemple important de cette approche est celui de la structure de maximisation des richesses de William Landes et Richard (...) Posner. L’article montre que la cohérence logique n’est ni nécessaire ni suffisante pour un ordre de plans ou pour une “cohérence praxéologique”. Nous défendons la position du droit coutumier classique suivant laquelle le droit se développe en accord avec les anticipations marginales des parties en présence. Dans la mesure où le droit se développe dans ce sens, il est possible d’approcher des objectifs jumelés du droit coutumier : la certitude relative et l’adaptation aux circonstances particulières.This article is a development of the idea, proposed by F.A. Hayek, that the order of common law is an order of actions, that is, a coordination of the plans of individuals in a system of exchanges governed by that law. This is in contrast to the idea that legal order is primarily to be found in the logical coherence of the law’s doctrines and concepts. The article shows that logical coherence is neither necessary nor sufficient for an order of plans, or “praxeological coherence”. It argues for the classic common law position that the law develops in accordance with the marginal expectations of the relevant parties. To the extent that the law develops in this way, it is possible for the twin goals of the common law to be approximated: relative certainty and adaptation to novel circumstances. (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- (...) class='Hi'>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 describe approximation algorithms for MAX SAT with performance ratios arbitrarily close to 1, in particular, when performance ratios exceed the limits of polynomial-time approximation. Namely, given a polynomial-time α-approximation algorithm , we construct an -approximation algorithm . The algorithm runs in time of the order ck, where k is the number of clauses in the input formula and c is a constant depending on α. Thus we estimate the cost of improving a performance ratio. (...) Similar constructions for MAX 2SAT and MAX 3SAT are also described. Taking known algorithms as , we obtain particular upper bounds on the running time of. (shrink)

In this paper a theory of finitistic and frequentistic approximations — in short: f-approximations — of probability measures P over a countably infinite outcome space N is developed. The family of subsets of N for which f-approximations converge to a frequency limit forms a pre-Dynkin system $${{D\subseteq\wp(N)}}$$. The limiting probability measure over D can always be extended to a probability measure over $${{\wp(N)}}$$, but this measure is not always σ-additive. We conclude that probability measures can be regarded as idealizations of (...) limiting frequencies if and only if σ-additivity is not assumed as a necessary axiom for probabilities. We prove that σ-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full f-approximations. We also show that every non-σ-additive probability measure is f-approximable, though neither canonically nor fully f-approximable. Finally, we transfer our results to probability measures on open or closed formulas of first-order languages. (shrink)

Psychological literacy, the ability to apply psychological knowledge to personal, family, occupational, community and societal challenges, is promoted as the primary outcome of an undergraduate education in psychology. As the concept of psychological literacy becomes increasingly adopted as the core business of undergraduate psychology training courses world-wide, there is urgent need for the construct to be accurately measured so that student and institutional level progress can be assessed and monitored. Key to the measurement of psychological literacy is determining the underlying (...) factor-structure of psychological literacy. In this paper we provide a first approximation of the measurement of psychological literacy by identifying and evaluating self-report measures for psychological literacy. Multi-item and single-item self-report measures of each of the proposed nine dimensions of psychological literacy were completed by two samples (N = 218 and N = 381) of undergraduate psychology students at an Australian university. Single and multi-item measures of each dimension were weakly to moderately correlated. Exploratory and confirmatory factor analyses of multi-item measures indicated a higher order three factor solution best represented the construct of psychological literacy. The three factors were reflective processes, generic graduate attributes, and psychology as a helping profession. For the measurement of psychological literacy to progress there is a need to further... (shrink)

The ordering tendency in binary f -Ti solid solution containing 3sp or 4sp simple-metal or 3d transition-metal solute is investigated systematically by the linear muffin-tin orbital method within the atomic sphere approximation . We demonstrated that the effective pairwise interaction energy in a solid solution is equal to half the solute-solute interaction energies and can be evaluated by a supercell total energy approach. The calculations of EPI energy both with and without volume relaxation of the supercells and local density (...) of states show that the EPI energies of Ti-SM and Ti-TM solutions are dominated by different factors. For Ti-SM solutions, the EPI energies are of large absolute values with a negative sign, indicating strong ordering tendency in these solutions. The volume relaxation does not alter the EPI energy substantially. The calculated LDOS shows that the ordering tendency in Ti-SM solutions may be related to the hybridization between the electrons of the SM atoms when they are close to each other. For most Ti-TM solutions, if calculated without relaxation, the absolute EPI energies are very small; however, if calculated with relaxation, they are of relatively large positive values, indicating a clustering tendency in these solutions. By combining the calculated EPI energy and Flinn's model for short-range order strengthening, the increase in critical shear stress ‰ sro due to SRO is estimated for Ti-SM alloys, and the results qualitatively agree with experiment. (shrink)

One of the traditional pragmatic approaches to vagueness suggests that there needs to be a significant gap between individuals or objects that can be described using a vague adjective like tall and those that cannot. In contrast, intuitively, an explicit comparative like taller does not require fulfillment of the gap requirement. Our starting point for this paper is the consideration that people cannot make precise measures under time pressure and their ability to discriminate approximate heights obeys Weber’s law. We formulate (...) and experimentally test three hypotheses relating to the difference between positive and comparative forms of the vague adjectives, gap requirement, and Weber’s law. In two experiments, participants judged appropriateness of usage of positive and comparative forms of vague adjectives in a sentence-picture verification task. Consequently, we review formal analysis of vagueness using weak orders and semi-orders and suggest adjustments based on the experimental results and properties of Weber’s law. (shrink)

The aim of this paper is to introduce a formal system STW of self-referential truth, which extends the classical first-order theory of pure combinators with a truth predicate and certain approximation axioms. STW naturally embodies the mechanisms of general predicate application/abstraction on a par with function application/abstraction; in addition, it allows non-trivial constructions, inspired by generalized recursion theory. As a consequence, STW provides a smooth inner model for Myhill's systems with levels of implication.

In A. Kumar, & M. Banerjee [(2012). Definable and rough sets in covering-based approximation spaces. In T. Li. (eds.), Rough sets and knowledge technology (pp. 488–495). Springer-Verlag], A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], authors proposed a pair of lower and upper approximation operators based on granules generated by quasiorders. This work is an extension of algebraic results presented therein. A characterisation has (...) been presented for those quasiorder-generated covering-based approximation spaces whose corresponding collections of definable and rough sets form Stone algebras. The notion of rough lattice was proposed in A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], A. Kumar [(2020). A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces. In Transactions on Rough Sets XXII, LNCS (Vol. 12485, pp. 123–251). Springer]. Some special rough lattices are introduced in this work, viz. rough Stone algebra, ∼1-complemented and ∼2-complemented rough lattices. Representations of these algebras in terms of rough sets are obtained. Moreover, logics for these algebras are shown to be sound and complete with respect to rough set semantics. (shrink)

To investigate mechanisms of rational representation, I consider construction of an ordered continuum of psychophysical scale of magnitude of sensation; counting mechanism leading to an approximate numerosity scale for integers; and conjoint measurement structure pitting the denominator against the numerator in tradeoff positions. Number sense of resulting rationals is neither intuitive nor expedient in their manipulation.

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.).

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.

The study of the chaotic dynamics in fractional-order discrete-time systems has received great attention over the last years. Some efforts have been also devoted to analyze fractional maps with special features. This paper makes a contribution to the topic by introducing a new fractional map that is characterized by both particular dynamic behaviors and specific properties related to the system equilibria. In particular, the conceived one dimensional map is algebraically simpler than all the proposed fractional maps in the literature. (...) Using numerical simulation, we investigate the dynamic and complexity of the fractional map. The results indicate that the new one-dimensional fractional map displays various types of coexisting attractors. The approximate entropy is used to observe the changes in the sequence sequence complexity when the fractional order and system parameter. Finally, the fractional map is applied to the problem of encrypting electrophysiological signals. For the encryption process, random numbers were generated using the values of the fractional map. Some statistical tests are given to show the performance of the encryption. (shrink)

§1. Introduction. The problem raised by the liar paradox has long been an intriguing challenge for all those interested in the concept of truth. Many “solutions” have been proposed to solve or avoid the paradox, either prescribing some linguistical restriction, or giving up the classical true-false bivalence or assuming some kind of contextual dependence of truth, among other possibilities. We shall not discuss these different approaches to the subject in this paper, but we shall concentrate on a kind of formal (...) construction which was originated by Kripke's paper “Outline of a theory of truth” [11] and which, in different forms, reappears in later papers by various authors.The main idea can be presented as follows: assume a first order language ℒ containing, among other unspecified symbols, a predicate symbolTintended to represent the truth predicate for ℒ. Assume, also, a fixed modelM= 〈D, I〉 whereDcontains all sentences of ℒ andIinterprets all non-logical symbols of ℒ exceptTin the usual way. In general,Dmight contain many objects other than sentences of ℒ but as that would raise the problem of the meaning of sentences in whichTis applied to one of these objects, we shall assume that this is not the case. (shrink)

An adaptive fractional-order nonsingular terminal sliding mode controller for a microgyroscope is presented with uncertainties and external disturbances using a fuzzy neural network compensator based on a backstepping technique. First, the dynamic of the microgyroscope is transformed into an analogical cascade system to guarantee the application of a backstepping design. Then, a fractional-order nonsingular terminal sliding mode surface is designed which provides an additional degree of freedom, higher precision, and finite convergence without a singularity problem. The proposed control (...) scheme requires no prior knowledge of the unknown dynamics of the microgyroscope system since the fuzzy neural network is utilized to approximate the upper bound of the lumped uncertainties and adaptive algorithms are derived to allow online adjustment of the unknown system parameters. The chattering phenomenon can be reduced simultaneously by the fuzzy neural network compensator. The stability and finite time convergence of the system can be established by the Lyapunov stability theorem. Finally, simulation results verify the effectiveness of the proposed controller and the comparison of root mean square error between different fractional orders and integer order is given to signify the high precision tracking performance of the proposed control scheme. (shrink)

In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are regarded as (...) models (e.g., including Banach algebras or other structures of functional analysis), and ask whether the resulting extensions of first order model theory preserve some of its desirable characteristics.A formal framework for the study of structures based on Banach spaces from the perspective of model theory was first introduced by C. W. Henson in [8] and [6]. Notions of syntax and semantics for these structures were defined, and it was shown that using them one obtains a model theoretic apparatus that satisfies many of the fundamental properties of first order model theory. For instance, one has compactness, Löwenheim-Skolem, and omitting types theorems. Further aspects of the theory, namely, the fundamentals of stability and forking, were first introduced in [10] and [9].The classes of mathematical structures formally encompassed by this framework are normed linear spaces, possibly expanded with additional structure,e.g., operations, real-valued relations, and constants. This notion subsumes wide classes of structures from functional analysis. However, the restriction that the universe of a structure be a normed space is not necessary. (This restriction has a historical, rather than technical origin; specifically, the development of the theory was originally motivated by questions in Banach space geometry.) Analogous techniques can be applied if the universe is a metric space. Now, when the underlying metric topology is discrete, the resulting model theory coincides with first order model theory, so this logic extends first order in the sense described above. Furthermore, without any cost in the mathematical complexity, one can also work in multi-sorted contexts, so, for instance, one sort could be an operator algebra while another is. say, a metric space. (shrink)

We revive the idea that a deductive-nomological explanation of a scientific theory by its successor may be defensible, even in those common and troublesome cases where the theories concerned are mutually incompatible; and limiting, approximating and counterfactual assumptions may be required in order to define a logical relation between them. Our solution is based on a general characterization of limiting relations between physical theories using the method of nonstandard analysis.

We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-lowness for sets of natural numbers. A computable non-decreasing unbounded function h is called an order function. Informally, a set A is strongly jump-traceable if for each order function h, for each input e one may effectively enumerate a set Te of possible values for the jump JA, and the number of values enumerated is at most (...) h. A′ is well-approximable if can be effectively approximated with less than h changes at input x, for each order function h. We prove that there is a strongly jump-traceable set which is not computable, and that if A′ is well-approximable then A is strongly jump-traceable. For r.e. sets, the converse holds as well. We characterize jump-traceability and strong jump-traceability in terms of Kolmogorov complexity. We also investigate other properties of these lowness properties. (shrink)

Reverse Mathematics (RM) is a program in the foundations of mathematics where the aim is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. Generally, the minimal axioms are equivalent to the theorem at hand, assuming a weak logical system called the base theory. Moreover, many theorems are either provable in the base theory or equivalent to one of four logical systems, together called the Big Five. For instance, the Weierstrass approximation theorem, i.e., that (...) a continuous function can be approximated uniformly by a sequence of polynomials, has been classified in RM as being equivalent to weak König’s lemma, the second Big Five system. In this paper, we study approximation theorems for discontinuous functions via Bernstein polynomials from the literature. We obtain many equivalences between the latter and weak König’s lemma. We also show that slight variations of these approximation theorems fall far outside of the Big Five but fit in the recently developed RM of new ‘big’ systems, namely the uncountability of ${\mathbb R}$, the enumeration principle for countable sets, the pigeon-hole principle for measure, and the Baire category theorem. (shrink)

This paper presents the design, simulation, and experimental verification of the fractional-order multiscroll Lü chaotic system. We base them on op-amp-based approximations of fractional-order integrators and saturated series of nonlinear functions. The integrators are first-order active realizations tuned to reduce the inaccuracy of the frequency response. By an exponential curve fitting, we got a convenient design equation for realizing fractional-order integrators of orders from 0.1 to 0.95. The results include simulations in SPICE of the mathematical description (...) and the electronic implementation and experimental measurements that confirm them. Monte Carlo and sensitivity tests revealed a robust realization. Contrary to its passive counterparts, the suggested realizations significantly reduce design and implementation efforts by favoring resistors and capacitors with commercial values and reducing hardware requirements. (shrink)

Some philosophers have claimed that it is meaningless or paradoxical to consider the probability of a probability. Others have however argued that second-order probabilities do not pose any particular problem. We side with the latter group. On condition that the relevant distinctions are taken into account, second-order probabilities can be shown to be perfectly consistent. May the same be said of an infinite hierarchy of higher-order probabilities? Is it consistent to speak of a probability of a probability, (...) and of a probability of a probability of a probability, and so on, {\em ad infinitum}? We argue that it is, for it can be shown that there exists an infinite system of probabilities that has a model. In particular, we define a regress of higher-order probabilities that leads to a convergent series which determines an infinite-order probability value. We demonstrate the consistency of the regress by constructing a model based on coin-making machines. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice L. (...) In this paper, we combine the Ershov Hierarchy and fuzzy set theory, by introducing and investigating the Fuzzy Ershov Hierarchy. In particular, we focus on the fuzzy n-c.e. sets which form the finite levels of this hierarchy. Intuitively, a fuzzy set is n-c.e. if its membership function can be approximated by changing monotonicity at most n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n-1$$\end{document} times. We prove that the Fuzzy Ershov Hierarchy does not collapse; that, in analogy with the classical case, each fuzzy n-c.e. set can be represented as a Boolean combination of fuzzy c.e. sets; but that, contrary to the classical case, the Fuzzy Ershov Hierarchy does not exhaust the class of all Δ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta ^0_2$$\end{document} fuzzy sets. (shrink)

The work broadens – to a considerable extent – Z. Pawlak’s original method (1982, 1992) of approximation of sets. The approximation of sets included in a universum U goes on in the contextual approximation space CAS which consists of: 1) a sequence of Pawlak’s approximation spaces (U,Ci), where indexes i from set I are linearly ordered degrees of contexts (I, <), and Ci is the universum partition U, 2) a sequence of binary relations on sets included (...) in U, relations called context relations indexed with degrees of contexts. The introduction of relations of contexts of sets was inspired by the work of W. Ziarnko (1993). Intuitively, set X is the context of set Y to the degree i, when on the basis of knowledge of the elements of set X we can obtain knowledge about the belonging of these elements to set Y to the degree i which is a degree of uncertainty or ambiguity, or inaccuracy. The operations of approximation of sets Ci-, BNi, Ci+, called lower approximation of the degree i, boundary of the degree i, upper approximation of the degree i, are formulated in a way which is analogous with the systems of Pawlak’s approximation, by expanding their formulas accordingly. In the next part of the work, it is shown (in an analogous way to Bryniarski’s work (1989)) that one can define the following operations on contextual rough sets: the union of contextual rough sets, the intersection of contextual rough sets and the complement of contextual rough set. It is proved that the algebra of contextual rough sets is a ditributive lattice with a unit and with a zero. On the basis of the results presented above the problem of defining operations on contextual rough sets by membership relations (Bryniarski 1989) may be formulated analogously to the classical operations on sets. (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 demand of many scientific areas for the usage of fractional partial differential equations to explain their real-world systems has been broadly identified. The solutions may portray dynamical behaviors of various particles such as chemicals and cells. The desire of obtaining approximate solutions to treat these equations aims to overcome the mathematical complexity of modeling the relevant phenomena in nature. This research proposes a promising approximate-analytical scheme that is an accurate technique for solving a variety of noninteger partial differential equations. (...) The proposed strategy is based on approximating the derivative of fractional-order and reducing the problem to the corresponding partial differential equation. Afterwards, the approximating PDE is solved by using a separation-variables technique. The method can be simply applied to nonhomogeneous problems and is proficient to diminish the span of computational cost as well as achieving an approximate-analytical solution that is in excellent concurrence with the exact solution of the original problem. In addition and to demonstrate the efficiency of the method, it compares with two finite difference methods including a nonstandard finite difference method and standard finite difference technique, which are popular in the literature for solving engineering problems. (shrink)

In this article, we present a one-step hybrid block method for approximating the solutions of second-order fuzzy initial value problems. We prove the stability and convergence results of the method and present several examples to illustrate the efficiency and accuracy of the proposed method. The numerical results are compared with the existing ones in the literature.

We revisit the nonrelativistic problem of a bound, charged particle subject to the random zero-point radiation field, with the purpose of revealing the mechanism that takes it from the initially classical description to the final quantum-mechanical one. The combined effect of the zpf and the radiation reaction force results, after a characteristic time lapse, in the loss of the initial conditions and the concomitant irreversible transition of the dynamics to a stationary regime controlled by the field. In this regime, the (...) canonical variables x, p become expressed in terms of the dipolar response functions to a set of field modes. A proper ordering of the response coefficients leads to the matrix representation of quantum mechanics, as was proposed in the early days of the theory, and to the basic commutator x^,p^=iħ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left[ {\hat{x}},{\hat{p}}\right] =i\hbar $$\end{document}. Further, the connection with the corresponding Fokker–Planck equation valid in the Markov approximation, allows one to obtain the radiative corrections of qed. These results reaffirm the essentially electrodynamic and stochastic nature of the quantum phenomenon, as proposed by stochastic electrodynamics. (shrink)

Due to the excellent approximation ability, the neural networks based control method is used to achieve adaptive consensus of the fractional-order uncertain nonlinear multiagent systems with external disturbance. The unknown nonlinear term and the external disturbance term in the systems are compensated by using the radial basis function neural networks method, a corresponding fractional-order adaption law is designed to approach the ideal neural network weight matrix of the unknown nonlinear terms, and a control law is designed eventually. (...) According to the designed Lyapunov candidate function and the fractional theory, the systems stability is proved, and the adaptive consensus can be guaranteed by using the designed control law. Finally, two simulations are shown to illustrate the validity of the obtained results. (shrink)

In Pitjantjatjara, a central Australian Indigenous language, speakers typically describe sequences of actions using clause chaining constructions. While similar constructions are common among the world’s languages, very little is known about how children acquire them. A notable exception are the converb constructions of Turkish, which have been relatively well-studied. The present paper examines the acquisition of Pitjantjatara clause chaining constructions and compares this with the acquisition of Turkish converb constructions. Data is drawn from a naturalistic corpus recorded between 2016 and (...) 2019. The corpus contains over 4000 utterances from 23 children aged between 10 months and 10 years, five of whom are recorded at multiple ages. The corpus also includes approximately 1600 utterances from 21 adults, aged between 16 and 70. Results show that the acquisition of Pitjantjatjara clause chains consists of three stages. Stage 1 features juxtaposition of finite verb forms. In Stage 2, children make regular use of clause chain morphology, but primarily for modification purposes. In Stage 3, clause chains are the preferred strategy for sequential actions as well as modification purposes. The initial use of verb juxtaposition followed by increasing use of dedicated morphology is consistent with findings for Turkish converb acquisition, with speakers of both languages utilizing dedicated forms from around 2;6 onwards. A notable difference between the acquisition of Pitjantjatjara clause chains and Turkish converbs is in the order of acquisition of semantic functions. In Turkish, children acquire temporal functions, such as sequential actions, before modifying functions, such as manner specification. In Pitjantjatjara, the order is reversed, with children first using clause chaining constructions for modification and simultaneous aspects of events before utilizing them to combine sequential actions. This raises questions regarding the distribution and relative timing of event combination and modification strategies. (shrink)

-/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The (...) primary purpose of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊧φ (if and) only if Σ⊢φ ∸2−n for all n < ω. This approximated form of strong completeness asserts that if Σ⊧φ, then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. -/- Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number φ T o is uniformly recursive from φ, where φ T o is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable. (shrink)

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies limit computable sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a complete lattice. In this paper, we combine the Ershov Hierarchy and fuzzy (...) set theory, by introducing and investigating the Fuzzy Ershov Hierarchy. (shrink)

Large scale experiments at CERN’s Large Hadron Collider rely heavily on computer simulations, a fact that has recently caught philosophers’ attention. CSs obviously require appropriate modeling, and it is a common assumption among philosophers that the relevant models can be ordered into hierarchical structures. Focusing on LHC’s ATLAS experiment, we will establish three central results here: with some distinct modifications, individual components of ATLAS’ overall simulation infrastructure can be ordered into hierarchical structures. Hence, to a good degree of approximation, (...) hierarchical accounts remain valid at least as descriptive accounts of initial modeling steps. In order to perform the epistemic function Winsberg Model-based reasoning in scientific discovery. Kluwer Academic/plenum Publishers, New York, pp 255–269, 1999) assigns to models in simulation—generate knowledge through a sequence of skillful but non-deductive transformations—ATLAS’ simulation models have to be considered part of a network rather than a hierarchy, in turn making the associated simulation modeling messy rather than motley. Deriving knowledge-claims from this ‘mess’ requires two sources of justification: holistic validation :253–262, 2010; in Carrier M, Nordmann A Science in the context of application. Springer, Berlin, pp 115–130, 2011), and model coherence. As it turns out, the degree of model coherence sets HEP apart from other messy, simulation-intensive disciplines such as climate science, and the reasons for this are to be sought in the historical, empirical and theoretical foundations of the respective discipline. (shrink)

I discuss in a systematic order the most important epistemological positions in the instrumentalism-realism debate, viz., instrumentalism, constructive empiricism, referential realism, and theory realism. My conclusions are as follows. There are good reasons for the instrumentalist to become a constructive empiricist. In turn, the constructive empiricist is forced to become a referential realist in order to give deeper explanations of success differences. Consequently, there are further good reasons for the referential realist to become a theory realist.

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)

The theory of rough sets starts with the notion of an approximation space , which is a pair ( U , R ), U being the domain of discourse, and R an equivalence relation on U . R is taken to represent the knowledge base of an agent, and the induced partition reflects a granularity of U that is the result of a lack of complete information about the objects in U . The focus then is on approximations of (...) concepts on the domain, in the context of the granularity. The present article studies the theory in the situation where information is obtained from different sources. The notion of approximation space is extended to define a multiple-source approximation system with distributed knowledge base , which is a tuple , where N is a set of sources and P ranges over all finite subsets of N . Each R P is an equivalence relation on U satisfying some additional conditions, representing the knowledge base of the group P of sources. Thus each finite group of sources and hence individual source perceives the same domain differently (depending on what information the group/individual source has about the domain), and the same concept may then have approximations that differ with the groups. In order to express the notions and properties related with rough set theory in this multiple-source situation, a quantified modal logic LMSAS D is proposed. In LMSAS D , quantification ranges over modalities, making it different from modal predicate logic and modal logic with propositional quantifiers. Some fragments of LMSAS D are discussed and it is shown that the modal system KTB is embedded in LMSAS D . The epistemic logic is also embedded in LMSAS D , and cannot replace the latter to serve our purpose. The relationship of LMSAS D with first and second-order logics is presented. Issues of expressibility, axiomatization and decidability are addressed. (shrink)

The mean-field theory with the use of the slave-boson functional method has been generalized to take account of the spin- and/or orbital-ordered state in the doubly degenerate Hubbard model. Numerical calculations are presented of the antiferromagnetic orbital-ordered state in the half-filled simple-cubic model. The orbital order in the present theory is much reduced compared with that in the Hartree–Fock approximation because of the large orbital fluctuations. From a comparison of the ground-state energy, the antiferromagnetic orbital state is shown (...) to be unstable against the antiferromagnetic spin state, although the situation becomes reversed when the exchange interaction is negative. (shrink)

In a recent paper in this journal, entitled ‘Scientific Progress: Why Getting Closer to Truth is Not Enough’ (2017), Moti Mizrahi argues that the view of progress as approximation to the truth or increasing verisimilitude is plainly false. The key premise of his argument is that on such a view of progress, in order to get closer to the truth one only needs to arbitrarily add a true disjunct to a hypothesis or theory. Since quite clearly scientific progress (...) is not a matter of adding true disjuncts to theories, the argument goes, the view of progress as approximation to the truth is untenable. We show that the key premise of Mizrahi’s argument is false: according to verisimilitude-based accounts of progress, adding arbitrary true disjuncts to existing theories is just not enough to get closer to the truth. (shrink)

In the last years, the surprising bosonic behavior that a many-fermion system may acquire has raised interest because of theoretical and practical reasons. This trans-statistical behavior is usually considered to be the result of approximation modeling methods generally employed by physicists when faced with complexity. In this paper, we take a tensor product structure and an ontology of properties approach and provide two versions of a toy model in order to argue that trans-statistical behavior allows for a realistic (...) interpretation. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Semina Ignis:The Interplay of Science and Myth in the Song of SilenusMichael Paschalis1. Introductionhinc lapides Pyrrhae iactos, Saturnia regna,Caucasiasque refert uolucris furtumque Promethei(Virg. Ecl. 6.41-42)The list of myths in Virgil's Eclogues 6.41-42 has intrigued critics since the time of Servius. The problem most commonly pointed out is its lack of chronological and logical order vis-à-vis the mainstream mythological tradition. Virgil does not mention the first creation of man (...) but passes directly to his regeneration from Pyrrha's stones. This is the story of the repopulation of the earth after the Flood and hence ought to have preceded Saturn's reign, which presumably represents man's initial happy state. In addition, Prometheus' punishment comes before his theft of fire; this could indeed be interpreted as a hysteron proteron, but there remains the difficulty that Prometheus is Deucalion's father and Pyrrha's uncle1 and his furtum ought to have preceded Pyrrha's creation of mankind.The majority of critics believe that there is indeed a lack of chronological order and that it is deliberate. I will give a few examples. Zeph Stewart claims that the chronological problem is explicable in terms of Virgil's intention to give random examples of one branch of didactic poetry associated with the name of Hesiod, that is, genealogical and mythological tales of the origin and early history of mankind.2 According to Eleanor Leach the displacement of chronology aims at puzzling readers and causing them to seek an explanation. She furthermore makes the [End Page 201] important observation that these myths "may even seem contradictory for they are not all commonly found in the same accounts" and proceeds to explain that "they provide three distinct ideas of the nature of mankind."3 Charles Segal thinks that behind the deliberate chronological disorder, there is a theme which is central for the song of Silenus, namely "the flawed character of human existence and man's removal from any absolute purity of life or spirit."4 Other critics, however, see no chronological problem in the order of myths. Boyle and Clausen, for instance, note a progression from the creation of mankind (the myth of Pyrrha) to the golden age (Saturn's reign) and from there to the age of technology (Prometheus' theft of fire), which they interpret either as mankind's fall from a happy state or as morally indifferent.5 Patricia Johnston has argued that the relation of men generated from stones to the Saturnia regna conforms to a consistent chronological pattern in Virgil's works and to an overall conception of the Golden Age, which in her view "appears to require that it be preceded by a race of mortals hardened either by primitive existence or by military activities."6In what follows I intend to suggest a somewhat different approach to the passage in question. The interpretation I propose is based on arguments derived from the close relation of these myths to the preceding "scientific" section. The two sections share thematic and semantic features which, as I show in part 4 of this essay, are also prominent in other parts of Eclogue 6.In an article published in 1923 Günther Jachmann7 made two points which are important for any discussion of Virgil's cosmogony and the section on Pyrrha and Prometheus:1. Jachmann objected to Servius' observation that line 41 begins a new section ("relictis prudentibus rebus de mundi origine, subito ad fabulas transitum fecit"), which the majority of Virgilian scholars have adopted without giving it much thought. He pointed out that the initial cosmogony forms a thematic whole with the section treating the origin (Pyrrha) and early history of man (Saturn's reign and the theft of fire by Prometheus). Jachmann noted in this respect that a similar pattern is visible in Orpheus' song in Apollonius (Arg. 1.496-511.), one of the models of Virgil's cosmogony. The difference is that Orpheus' cosmogony [End Page 202] is followed by a theogony and focuses on the gods (503-11), while Silenus' cosmogony is followed by an anthropogony and focuses on man, approximately as Ovid, Metamorphoses 1.76-150... (shrink)