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.

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)

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)

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)

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

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)

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

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)

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)

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)

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)

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

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)

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)

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

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)

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.

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)

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)

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.

Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures to various natural classes of complete metric structures. 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 satisfiable if it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby Σ⊨φ 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 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∘ is uniformly recursive from φ, where φT∘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 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 Δ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)

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)

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)

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.

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)

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)

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.

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)

I sketch the most important epistemological positions in the instrumentalism-realism debate, viz., instrumentalism, constructive empiricism, referential realism, and theory realism. I order them according to their answers to a number of successive leading questions, where every next question presupposes an affirmative answer to the foregoing one. I include the answer to questions concerning truth, as well as the most plausible answer to questions concerning truth approximation. Restricting my survey to the natural sciences and hence to the natural world, (...) I indicate the implications of the results of the study of empirical progress and truth approximation for the way these epistemological positions are related. I conclude that there are good reasons for the instrumentalist to become a constructive empiricist; in order to give deeper explanations of success differences, the constructive empiricist is forced to become a referential realist; and, there are good reasons for the referential realist to become a theory realist of a non-essentialist nature, here called a constructive realist. (shrink)

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

We examine the process of the emission of light from an atom that is in a relative translational motion with respect to the medium at rest in which the electromagnetic excitations propagate. The effect of Lorentz contraction of the of electron orbits on the emitted frequency is incorporated in the Rydberg formula, as well as the emitter’s Doppler effect is acknowledged. The result is that the frequency of the emitted light is modified by a factor that is identical with what (...) is called the ‘relativistic Doppler effect’. The new emission formula is applied for reinterpretation of the Ives-Stilwell experiment and shown that within the second order of approximation with respect to the speeds of the atom and the ‘absolute speed’ (Earth’s speed relative to the medium), the absolute motion does not affect the interference. The expression for the modification of the frequency involves both a first and a second-order term with respect to the speed of the atoms in the cathode tube. The latter turns out to be quantitatively the same as if the time would have changed its rate in the frame moving with the atoms. Thus, a new interpretation of the results of this famous experiment is provided without stipulating time dilation. (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)

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)

Manila is one of the world’s most fragmented, privatized and un-public of cities. Why is this so? This paper contemplates the seemingly immutable privacy of the city of Manila, and the paradoxical character of its publicity. Manila is our prime exemplar of the 21st-century mega-city whose apparent disorder discloses a coherent order which we here call ‘neo-patrimonial urbanism’. Manila is a city where poor and rich alike have their own government, infrastructure, and armies, the shopping malls are the simulacra (...) of public congregations once found in cathedrals and plazas, and where household order is matched by streetside chaos, and personal cleanliness wars with public dirt. We nominate the key characteristics of this uncanny approximation of chaotic and discordant order – a polyphonous and polyrhythmic social order but one lacking harmony – and offer a historical sociology, a genealogy that traces an emblematic pattern across the colonizing periods of its emergent urban forms into the contemporary impositions of gated zones and territories. The enduring legacy of patrimonial power to Manila is to be found in the households and on the streets that undermine and devalue public forms of social power in favour of the patriarch and his householders (now relabelled as ‘shareholders’ in ‘public companies’) at the cost of harmonious, peaceable and just public order. Such a state of affairs is not only destructive of the historic built environment of the city, especially its public parks and plazas and heritage districts, its streets, footpaths, public transport and utilities, but is directly injurious of its citizens. To address the question of Manila’s private order and public chaos is to reopen the quest for the good city as the just polis. It is also to take us beyond arguments of indigenous versus colonial forms of urbanism that are mired in nationalist and modernization ideologies respectively, and it is to reject the reductive logics of globalization arguments that Asian mega-cities are but variations of American logics of urbanism. (shrink)

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)

Applying first-order logic to derive the consequences of laws that are only approximately true of empirical phenomena involves idealization of a kind that is akin to applying arithmetic to calculate the area of a rectangular surface from approximate measures of the lengths of its sides. Errors in the data, in the exactness of the lengths in one case and in the exactness of the laws in the other, are in some measure transmitted to the consequences deduced from them, and (...) the aim of a theory of idealization is to describe this process. The present paper makes a start on this in the case of applied first-order logic, and relates it to Plato's picture of a world or model of 'appearances' in which laws are only approximately true, but which to some extent resembles an ideal world or model in which they are exactly true. (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)

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)

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)

Two objects of valuation are said to be incommensurable if neither is better than the other, nor are they equally good. This negative, coarse-grained characterization fails to capture the nuanced structure of incommensurability. We argue that our evaluative resources are far richer than orthodoxy recognizes. We model value comparisons with the corresponding class of permissible preference orderings. Then, making use of our model, we introduce a potentially infinite set of degrees of approximation to better, worse, and equally good, which (...) we interpret as degrees of commensurability.One payoff is the solution our approach provides to a paradox in population ethics, generated by Parfit's “Continuum Argument”. Parfit imagines a sequence of populations, starting with one consisting of excellent lives and, by a sequence of apparent improvements, reaching a much larger population of lives barely worth living. What he dubs “the Repugnant Conclusion” is that the final population is better than the first. Developing Parfit's response, we argue that some of the populations in the sequence are merely almost better than their immediate predecessors. Almost better is not transitive (unlike better). We offer analogies to other ‘spectrum arguments’, Condorcet's paradox, and to developments in formal epistemology. (shrink)

Manila is one of the world’s most fragmented, privatized and un-public of cities. Why is this so? This paper contemplates the seemingly immutable privacy of the city of Manila, and the paradoxical character of its publicity. Manila is our prime exemplar of the 21st-century mega-city whose apparent disorder discloses a coherent order which we here call ‘neo-patrimonial urbanism’. Manila is a city where poor and rich alike have their own government, infrastructure, and armies, the shopping malls are the simulacra (...) of public congregations once found in cathedrals and plazas, and where household order is matched by streetside chaos, and personal cleanliness wars with public dirt. We nominate the key characteristics of this uncanny approximation of chaotic and discordant order – a polyphonous and polyrhythmic social order but one lacking harmony – and offer a historical sociology, a genealogy that traces an emblematic pattern across the colonizing periods of its emergent urban forms into the contemporary impositions of gated zones and territories. The enduring legacy of patrimonial power to Manila is to be found in the households and on the streets that undermine and devalue public forms of social power in favour of the patriarch and his householders (now relabelled as ‘shareholders’ in ‘public companies’) at the cost of harmonious, peaceable and just public order. Such a state of affairs is not only destructive of the historic built environment of the city, especially its public parks and plazas and heritage districts, its streets, footpaths, public transport and utilities, but is directly injurious of its citizens. To address the question of Manila’s private order and public chaos is to reopen the quest for the good city as the just polis. It is also to take us beyond arguments of indigenous versus colonial forms of urbanism that are mired in nationalist and modernization ideologies respectively, and it is to reject the reductive logics of globalization arguments that Asian mega-cities are but variations of American logics of urbanism. (shrink)

This paper attempts a systematic presentation of the ideas of Sri Aurobindo, India's foremost sage- philosopher-nationalist, in two parts. This, the first part, encompasses a time span of approximately four decades when Aurobindo was an activist and a frontline leader in India's freedom struggle. This period has been identified by the author as the pre-Pondicherry days when the keynote of Aurobindo's social, economic and political writings was nationalism. This paper sheds light on how Aurobindo's views on India's social and economic (...) upliftment were inextricably linked with his clarion call for the resurgence of the spiritual identity of her citizens. Thus, the author argues that Aurobindo was not just a narrow-visioned political scientist who saw India merely as a geographical entity. Rather, his vision was engrossed with the quintessential spiritual symbol that India has been and is. The second part of the paper will appear in the next issue of this journal. (shrink)