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)

Inspired by the recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of the n-degree of introspection that is allowed, thus generating modaln-logics. The semantics for n-logics is presented, in which formulas are evaluated with respect to paths, and not possible worlds. A tableau-based proof system is presented, n-SST, and soundness and completeness is shown for the approximation of modal logics image and (...) image. (shrink)

Preschool children have been proven to possess nonsymbolic approximate arithmetic skills before learning how to manipulate symbolic math and thus before any formal math instruction. It has been assumed that nonsymbolic approximate math tasks necessitate the allocation of Working Memory (WM) resources. WM has been consistently shown to be an important predictor of children's math development and achievement. The aim of our study was to uncover the specific role of WM in nonsymbolic approximate math. For this purpose, we conducted a (...) dual-task study with preschoolers with active phonological, visual, spatial, and central executive interference during the completion of a nonsymbolic approximate addition dot task. With regard to the role of WM, we found a clear performance breakdown in the central executive interference condition. Our findings provide insight into the underlying cognitive processes involved in storing and manipulating nonsymbolic approximate numerosities during early arithmetic. (shrink)

In this paper we give an axiom system of a logic which we call an approximation logic (AL), whose Lindenbaum-Tarski algebra is a strong Bunge algebra (or simply s-Bunge algebra), and show thatFor every s-Bunge algebra , a quotient algebra by a maximal filter is isomorphic to the simplest nontrivial s-Bunge algebra ;The Lindenbaum algebra of AL is an s-Bunge algebra;AL is complete;AL is decidable.

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)

We have synthesized a 582,970-base pair Mycoplasma genitalium genome. This synthetic genome, named M. genitalium JCVI-1.0, contains all the genes of wild-type M. genitalium G37 except MG408, which was disrupted by an antibiotic marker to block pathogenicity and to allow for selection. To identify the genome as synthetic, we inserted "watermarks" at intergenic sites known to tolerate transposon insertions. Overlapping "cassettes" of 5 to 7 kilobases (kb), assembled from chemically synthesized oligonucleotides, were joined by in vitro recombination to produce intermediate (...) assemblies of approximately 24 kb, 72 kb ("1/8 genome"), and 144 kb ("1/4 genome"), which were all cloned as bacterial artificial chromosomes in Escherichia coli. Most of these intermediate clones were sequenced, and clones of all four 1/4 genomes with the correct sequence were identified. The complete synthetic genome was assembled by transformation-associated recombination cloning in the yeast Saccharomyces cerevisiae, then isolated and sequenced. A clone with the correct sequence was identified. The methods described here will be generally useful for constructing large DNA molecules from chemically synthesized pieces and also from combinations of natural and synthetic DNA segments. 10.1126/science.1151721. (shrink)

Given a locale L and any set-indexed family of continuous mappings , fi:L→Li with compact and completely regular co-domain, a compactification η:L→Lγ of L is constructed enjoying the following extension property: for every a unique continuous mapping exists such that . Considered in ordinary set theory, this compactification also enjoys certain convenient weight limitations.Stone–Čech compactification is obtained as a particular case of this construction in those settings in which the class of [0,1]-valued continuous mappings is a set for all L. (...) This will follow by the proof that–also in the point-free context–a compactification that allows for the extension of [0,1]-valued mappings suffices for deriving the full reflection.A constructive proof that the class is a set whenever L is locally compact and L′ is set-presented and regular is also obtained; together with the described compactification, this makes it possible to characterize the class of locales for which Stone–Čech compactification can be defined constructively. (shrink)

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

Current discussion of scientific realism and antirealism often cites Pierre Duhem’s argument for the underdetermination of theory choice by evidence. Participants draw on an account of his underdetermination thesis that is familiar, but incomplete. The purpose of this article is to complete the familiar account. I argue that a closer look at Duhem’s The aim and structure of physical theory suggests that the rationale for his underdetermination thesis comes from his philosophy of scientific language. I explore how an understanding (...) of physical laws as symbolic is meant to support the thesis. In the course of my argument, I point out that Duhemian underdetermination is not meta-practical but grounded in the practice of science, specifically in the scientist’s use of instruments and measurement techniques. Measurement has a significant limitation, according to Duhem: it always involves approximation and a degree of experimental error. Consequently, it cannot overcome the gap between the ordinary, concrete language of observation and the mathematical language of science. Moreover, Duhem argues that the use of instruments in experiment invokes whole groups of theories. I contend that, ultimately, this reliance on auxiliary assumptions—which makes possible the use of instruments—is the foundation of his thesis and that recognizing this completes the familiar account of his underdetermination argument.Author Keywords: Duhem; Suppes; Underdetermination; Measurement; Physical theory. (shrink)

Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theories from ego- to geo- to helio-centric models to universe and multiverse theories and beyond was accompanied by a dramatic increase in the sizes of the postulated worlds, with humans being expelled from their center to ever more remote and random locations. Rather than leading to a true theory of everything, this trend faces a turning point after (...) which the predictive power of such theories decreases (actually to zero). Incorporating the location and other capacities of the observer into such theories avoids this problem and allows to distinguish meaningful from predictively meaningless theories. This also leads to a truly complete theory of everything consisting of a (conventional objective) theory of everything plus a (novel subjective) observer process. The observer localization is neither based on the controversial anthropic principle, nor has it anything to do with the quantum-mechanical observation process. The suggested principle is extended to more practical (partial, approximate, probabilistic, parametric) world models (rather than theories of everything). Finally, I provide a justification of Ockham's razor, and criticize the anthropic principle, the doomsday argument, the no free lunch theorem, and the falsifiability dogma.", . (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)

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)

We study a modal extension of the Continuous First-Order Logic of Ben Yaacov and Pedersen :168–190, 2010). We provide a set of axioms for such an extension. Deduction rules are just Modus Ponens and Necessitation. We prove that our system is sound with respect to a Kripke semantics and, building on Ben Yaacov and Pedersen, that it satisfies a number of properties similar to those of first-order predicate logic. Then, by means of a canonical model construction, we get that every (...) consistent set of formulas is satisfiable. From the latter result we derive an Approximated Strong Completeness Theorem, in the vein of Continuous Logic, and a Compactness Theorem. (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)

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

Kohlenbach, U., Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Annals of Pure and Applied Logic 64 27–94.We consider uniqueness theorems in classical analysis having the form u ε U, v1, v2 ε Vu = 0 = G→v 1 = v2), where U, V are complete separable metric spaces, Vu is compact in V and G:U x V → is a constructive function.If is proved by arithmetical means from analytical (...) assumptions x εXy ε Yx z ε Z = 0) only , then we can extract from the proof of → an effective modulus of uniqueness, which depends on u, k but not on v1,v2, i.e., u ε U, v1, v2 ε Vu, k εG, G 2-φuk→dv2-itk). Such a modulus φ can e.g. be used to give a finite algorithm which computes the zero of G on Vu with prescribed precision if it exists classically.The extraction of φ uses a proof-theoretic combination of functional interpretation and pointwise majorization. If the proof of → uses only simple instances of induction, then φ is a simple mathematical operation. (shrink)

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)

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation φ/Tφ and conecessitation T φ/φ and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is w-inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give (...) an analysis of its proof theory. (shrink)

This essay explores Aristotle’s description of virtue or excellence as a completion through a contextual reading of two texts: the entry on “the complete” in his philosophical lexicon and the brief discussion of excellence in Physics 7.3. In both Aristotle explores conceptual and ontological issues germane to a general concept of excellence; in both, the key premise is that excellence is best thought of as a completion. His development of this claim draws on two larger themes. In Metaphysics 5, (...) the concept of excellence as a completion belongs to a broad conceptual realm—explored in chapters 16–17 and 25–27—in which intelligible realities are presented metaphorically in terms of shape and size. Within this realm, excellence grows toward a limit set by the powers that make a substance what it is. In the Physics, excellence belongs to a world structured by contraries and therefore also by coming to be and destruction. What it completes is a substance’s power to negotiate such a world while maintaining and developing its own identity. Having grown to full stature through its proper excellence, the substance can keep itself from being affected or altered in ways that would undermine its being; in so doing, it approximates the self-sufficient impassivity that Aristotle attributes to thought. The themes of alteration and identity are also pursued in On the Soul 2.5, which provides an important complement to Physics 7.3. (shrink)

To the axioms of Peano arithmetic formulated in a language with an additional unary predicate symbol T we add the rules of necessitation and conecessitation T and axioms stating that T commutes with the logical connectives and quantifiers. By a result of McGee this theory is -inconsistent, but it can be approximated by models obtained by a kind of rule-of-revision semantics. Furthermore we prove that FS is equivalent to a system already studied by Friedman and Sheard and give an analysis (...) of its proof theory. (shrink)

Vladimir Fock est un scientifique russo-soviétique connu pour diverses contributions à la physique moderne. Il en fut aussi un interprète, développant une position critique face à l’orthodoxie incarnée par Niels Bohr en mécanique quantique et Albert Einstein en relativité générale. Fock ayant adhéré au matérialisme dialectique, l’historiographie sur ses contributions aux débats d’interprétation met généralement l’accent sur sa défense d’une position réaliste, en faveur de l’objectivité du monde extérieur. Le présent article complète cette observation en s’appuyant sur un texte du (...) physicien soviétique jusqu’alors peu connu : « La signification fondamentale des méthodes d’approximation en physique théorique ». En effet, il révèle une forme d’antiréductionnisme essentielle à la compréhension du discours de Fock sur l’interprétation des théories de la physique moderne. (shrink)

This paper reports a case study on a family of American English constructions that will be called the family of approximate comparison constructions. This family has three members, all of which follow the syntactic pattern about as X as Y with X being an adjective, but which allow three related functions: literal comparison, simile and irony. Two cognitive frameworks concern themselves with irony, the cognitive modelling approach and viewpoint approach, and the paper will show that, while the ironic approximate comparison (...) construction calls central assumptions of the cognitive modelling approach to question, the viewpoint account can be refined to handle these cases. In doing so, it furthers our understanding of the cognitive underpinning of irony. The paper provides a corpus-based analysis on the Y slot as well as collostructional analyses on the adjectival X slot in the family of approximate comparison constructions. The results thereof suggest that the ironic approximate comparison construction, in comparison to its literal counterpart, prefers adjectives that convey positively connotated, nuanced attitudes and is formally less variable in the Y slot. The preference for particular adjectives lends further support to the assumption that hearers understand the construction as ironic or literal before speakers complete their utterance. Given that, it is argued that the ironic approximate comparison construction communicates an inherent viewpoint. (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 analysis of the Helmholtz equation is shown to lead to an exact Hamiltonian system describing in terms of ray trajectories, for a stationary refractive medium, a very wide family of wave-like phenomena (including diffraction and interference) going much beyond the limits of the geometrical optics (“eikonal”) approximation, which is contained as a simple limiting case. Due to the fact, moreover, that the time independent Schrödinger equation is itself a Helmholtz-like equation, the same mathematics holding for a classical optical (...) beam turns out to apply to a quantum particle beam moving in a stationary force field, and leads to a system of Hamiltonian equations providing exact and deterministic particle trajectories and dynamical laws, and containing the laws of Classical Mechanics in the eikonal limit. (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 Lee, Oehme and Yang (LOY) theory of time evolution in two state subspace of states of the complete system is discussed. Some inconsistencies in the assumptions and approximations used in the standard derivation of the LOY effective Hamiltonian, HLOY, governing this time evolution are found. Eliminating these inconsistencies and using the LOY method, approximate formulae for the effective Hamiltonian, H||, governing the time evolution in this subspace (improving those obtained by LOY) are derived. It is found, in contradistinction (...) to the standard LOY result, that in the case of neutral kaons (〈K 0 |H|||K 0 〉−〈¯K 0 |H|||¯K 0 〉), cannot take the zero value if the total system the preserves CPT-symmetry. Within the use of the method mentioned above formulae for H|| acting in the three state (three dimensional) subspace of states are also found. (shrink)

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

Studies of categorical induction typically examine how belief in a premise (e.g., Falcons have an ulnar artery) projects on to a conclusion (e.g., Robins have an ulnar artery). We study induction in cases in which the premise is uncertain (e.g., There is an 80% chance that falcons have an ulnar artery). Jeffrey's rule is a normative model for updating beliefs in the face of uncertain evidence. In three studies we tested the descriptive validity of Jeffrey's rule and a related probability (...) theorem, the rule of total probability. Although these rules provided good approximations to mean judgments in some cases, the results from regression and correlation analyses suggest that participants focus on the parts of these rules that are associated with the highest overall probability. We relate our findings to rational models of judgment. (shrink)

We introduce two novel frameworks for choice under complete uncertainty. These frameworks employ intervals to represent uncertain utility attaching to outcomes. In the first framework, utility intervals arising from one act with multiple possible outcomes are aggregated via a set-based approach. In the second framework the aggregation of utility intervals employs multi-sets. On the aggregated utility intervals, we then introduce min–max decision rules and lexicographic refinements thereof. The main technical results are axiomatic characterizations of these min–max decision rules and (...) these refinements. We also briefly touch on the independence of introduced axioms. Furthermore, we show that such characterizations give rise to novel axiomatic characterizations of the well-known min–max decision rule?mnx?mnx in the classical framework of choice under complete uncertainty. (shrink)

ObjectiveAnti-epidemic work against coronavirus disease has become routine work in China. Our study was intended to investigate the emotional and psychological state of healthcare workers and look for the association between sociodemographic factors/profession-related condition and emotional state.MethodsA cross-sectional survey was conducted online among healthcare workers from various backgrounds. Symptoms of anxiety and depression were assessed by the Chinese versions of the seven-item Generalized Anxiety Disorder and the nine-item Patient Health Questionnaire, respectively. Supplementary questions were recorded to describe the participants’ information (...) about workplace violence, profession, and attitude related to the COVID pandemic. Wherever suitable, independent t-test, and one-way ANOVA were performed to detect group differences of GAD-7 and PHQ-9 total scores after grouping by sociodemographic variables, respectively, such as age, gender, marital status, educational level, after-tax income, department category, job title, experience of workplace violence, and anti-epidemic participation. Multiple linear regression analyses were utilized in order to look for the potential associated factors of GAD-7 and PHQ-9 total scores.ResultsA total of 2,139 questionnaires with valid response were completed. Approximately 86.44% of participants had minimal symptoms of anxiety, 11.08% mild, 1.59% moderate, and 0.89% severe. Meanwhile, 81.34% had minimal symptoms of depression, 14.07% mild, 2.90% moderate, 1.17% moderately severe, and 0.51% severe. Student’s t-test showed that participants with female gender, with experience of workplace violence scored higher on both GAD-7 and PHQ-9, and participants with experience of anti-epidemic front-line work during pandemic scored lower on both GAD-7 and PHQ-9. ANOVA showed that participants aging from 31 to 40, with higher educational level, with middle level of annual after-tax income, with department of internal medicine or surgery, or with middle level of job title scored higher on both GAD-7 and PHQ-9. Regression analyses showed that female gender, high job title, and the experience of workplace violence positively were associated with anxiety or depression. Doctoral education, department, job enthusiasm, and professional self-identity were negatively associated with anxiety or depression. Additionally, psychological support was negatively associated with depression.ConclusionAs the epidemic prevention and control against COVID-19 become normalized in China, emotional state of healthcare workers deserves extensive attention. Our study revealed that gender, educational level, department category, job title, the experience of workplace violence, job enthusiasm, and professional self-identity are the most important influencing factors of physician’s anxiety and depression. Self-tailored psychological intervention should be based on the predisposing factors above to mentally prepare healthcare workers for this long-lasting battle against COVID-19. (shrink)

Sorely needed by scholars of nineteenth-century philosophy is a researdh bibliography on Francis Herbert Bradley (1846-1924). The existent bibliographic tools presently available on Bradley are very incomplete, inaccurate, and outdated, making them valueless for serious philosophical research on this very important contemporary philosopher. Every major book, review, doctoral dissertation, article, and note is cited exactly and completely. Approximately a thousand different citations are given indicating the tremendous influence Bradley's thought had on subsequent thinkers and movements. It is no minor thinker (...) who could influence deeply a Russell, James, or Whitehead. Like Plotinus before'him, Bradley's place in philosophy has not been fully appreciated because of the artificial divisions of philosophy proposed by its historians. In any event, this bibliography is offered to scholars whose interests are English Idealism in general and Bradley's philosophic contributions in particular. (shrink)

The ethical question of whether taking blood from normal children for research purposes is justified, is determined in part at least, by whether or not the children are harmed. To try to assess the risks, the effects of venepuncture on a group of healthy subjects were studied, by means of a parental questionnaire completed approximately eighteen months after the venepuncture had taken place. Ninety-two healthy children aged between 6 and 8 had a blood sample taken for non-therapeutic reasons as part (...) of a research study. Questionnaire responses reveal few negative effects, and in some cases positive effects. (shrink)

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called equation image without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this (...) paper a Kripke-style semantics for a subsystem equation image of equation image for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system equation image with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic equation image. We introduce a reational semantics which has the advantage to allow an interpretation of the propositionnal logic equation image using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic equation image. (shrink)

This chapter contains sections titled: Ideals as Standards and their Approximations The Paradox of the Philosopher‐king: Knowledge and Political Power Knowledge and Opinions Platonic Forms and Physical Particulars Plato's Theory of the Form of the Good Knowledge of Good How Elitist is Plato's Completely Good City?

Authenticates approximately 500 lines of Aristotle's lost work the Protrepticus (Exhortation to Philosophy) contained in the circa third century AD work by Iamblichus of Chalcis entitled Protrepticus epi philosophian. Includes a complete English translation of the authenticated material.

1. Approximations of arbitrarily large but finite systems are often mistaken for infinite idealizations in statistical and thermal physics. The problem is illustrated by thermodynamically reversible processes. They are approximations of processes requiring arbitrarily long, but finite times to complete, not processes requiring an actual infinity of time.2. The present debate over whether phase transitions comprise a failure of reduction is confounded by a confusion of two senses of “level”: the molecular versus the thermodynamic level and the few component (...) versus the many component level. (shrink)

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the (...) completeness theorem of the L′T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′T logic and the intuitionistic and classical logics. (shrink)

For approximately four decades now, the social dealings of Central Europe with persons who exhibit long lasting/permanent psychological disturbances, mental-, physical-, or multiple disabilities, have followed the paradigm of integration, which promises conditions of living which are »as normal as possible « and »in the immediate vicinity« of persons without disabilities. To date, this paradigm has not been completely implemented. Nevertheless, with the »Convention on the Rights of Persons with Disabilities «, which is also in effect in Germany since 2009, (...) a new paradigm was placed on the socio-political agenda. This contribution sketches the development, beginning after the Second World War, of the care system for persons with disabilities, describes the basis of the inclusion paradigm and names the connected societal challenges. (shrink)

In order to understand the rise of runaway solutions in the radiation reaction problem a mechanical model is used. An alternative demonstration of Daboul’s theorem, through Hurwitz’s criterion, is given. The origin of runaway solutions in electrodynamics is discussed. They arise when the particle has a negative mechanical mass or when approximations are used in the equation of motion. In the 1-dimensional mechanical model an exact and linear equation of motion for the particle is obtained, the corresponding exact solution is (...) again runaway when the mechanical mass is negative. The exact solution is not runaway when the mechanical mass is positive. However, the use of approximations leads to an equation of motion which has runaway solutions. It is exhibited that the use of approximations in the 3-dimensional mechanical model is completely necessary because the general equation of motion for the particle is non-linear. The analysis of this case proceeds in a very similar way to the one carried out in electrodynamics. This means that the number of dimensions also plays an important role in the analysis. (shrink)

We study the modal logic M L r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L r and show that it is not finitely axiomatizable. Then we describe the finite frames of that logic and show that it has (...) the finite frame property and its satisfiability problem is in EXPTIME. All these results easily extend to temporal and other multi-modal logics. Finally, we show that there are modal formulas which are almost surely valid in the finite, yet fail in the countable random frame, and hence do not follow from the extension axioms. Therefore the analog of Fagin's transfer theorem for almost sure validity in first-order logic fails for modal logic. (shrink)

Thisvolume contains the most complete collection ever assembled of the documentary evidence on Thales of Miletus. Approximately 600 texts, dating from the 6th century BCE to the 14th century CE, are presented in chronological order, both in the original language and in a facing English translation. An index of names as well as extensive glossaries and word indexes of the texts and translations are provided.

Many AI systems that make important decisions are black boxes: how they function is opaque even to their developers. This is due to their high complexity and to the fact that they are trained rather than programmed. Efforts to alleviate the opacity of black box systems are typically discussed in terms of transparency, interpretability, and explainability. However, there is little agreement about what these key concepts mean, which makes it difficult to adjudicate the success or promise of opacity alleviation methods. (...) I argue for a unified account of these key concepts that treats the concept of understanding as fundamental. This allows resources from the philosophy of science and the epistemology of understanding to help guide opacity alleviation efforts. A first significant benefit of this understanding account is that it defuses one of the primary, in-principle objections to post hoc explainable AI (XAI) methods. This “rationalization objection” argues that XAI methods provide mere rationalizations rather than genuine explanations. This is because XAI methods involve using a separate “explanation” system to approximate the original black box system. These explanation systems function in a completely different way than the original system, yet XAI methods make inferences about the original system based on the behavior of the explanation system. I argue that, if we conceive of XAI methods as idealized scientific models, this rationalization worry is dissolved. Idealized scientific models misrepresent their target phenomena, yet are capable of providing significant and genuine understanding of their targets. (shrink)

A complete quantum solution provides all possible knowledge of a system, whereas semiclassical theory provides at best approximate solutions in a limited region. Nevertheless, semiclassical methods based on the work of Martin Gutzwiller can provide stunning physical insights in regimes where quantum solutions are opaque. Furthermore, they can provide a unique bridge between the quantum and classical worlds. We illustrate these ideas with an account of a theoretical and experimental attack on the paradigm problem of the hydrogen atom in (...) strong magnetic and electric fields. (shrink)

Children with specific language impairment show a significant deficit in spoken language that cannot be attributed to neurological damage, hearing impairment, or intellectual disability. More prevalent than autism and at least as prevalent as dyslexia, SLI affects approximately seven percent of all children; it is longstanding, with adverse effects on academic, social, and economic standing. The first edition of this work established _Children with Specific Language Impairment_ as the landmark reference on this condition, considering not only the disorder's history, possible (...) origins, and treatment but also what SLI might tell us about language organization and development in general. This second edition offers a complete update of the earlier volume. Much of the second edition is completely new, reflecting findings and interpretations based on the hundreds of studies that have appeared since the publication of the first edition in 1997. Topics include linguistic details, word and sentence processing findings, genetics, neurobiology, treatment, and comparisons to such conditions as autism spectrum disorders, ADHD, and dyslexia. The book covers SLI in children who speak a wide range of languages, and, although the emphasis is on children, it also includes studies of adults who were diagnosed with SLI as children or are the parents of children with SLI. Written by a leading scholar in the field, Children with Specific Language Impairment offers the most comprehensive, balanced, and unified treatment of SLI available. (shrink)

The literature on the nature of understanding can be divided into two broad camps. Explanationists believe that it is knowledge of explanations that is key to understanding. In contrast, their manipulationist rivals maintain that understanding essentially involves an ability to manipulate certain representations. The aim of this paper is to provide a novel knowledge based account of understanding. More specifically, it proposes an account of maximal understanding of a given phenomenon in terms of fully comprehensive and maximally well-connected knowledge of (...) it and of degrees of understanding in terms of approximations to such knowledge. It is completed by a contextualist semantics for outright attributions of understanding according to which an attribution of understanding is true of one just in case one knows enough about it to perform some contextually determined task. It is argued that this account has an edge over both its explanationist and manipulationist competitors. (shrink)

The starting point of this work is the gap between two distinct traditions in information engineering: knowledge representation and data - driven modelling. The first tradition emphasizes logic as a tool for representing beliefs held by an agent. The second tradition claims that the main source of knowledge is made of observed data, and generally does not use logic as a modelling tool. However, the emergence of fuzzy logic has blurred the boundaries between these two traditions by putting forward fuzzy (...) rules as a Janus-faced tool that may represent knowledge, as well as approximate non-linear functions representing data. This paper lays bare logical foundations of data - driven reasoning whereby a set of formulas is understood as a set of observed facts rather than a set of beliefs. Several representation frameworks are considered from this point of view: classical logic, possibility theory, belief functions, epistemic logic, fuzzy rule-based systems. Mamdani's fuzzy rules are recovered as belonging to the data - driven view. In possibility theory a third set-function, different from possibility and necessity plays a key role in the data - driven view, and corresponds to a particular modality in epistemic logic. A bi-modal logic system is presented which handles both beliefs and observations, and for which a completeness theorem is given. Lastly, our results may shed new light in deontic logic and allow for a distinction between explicit and implicit permission that standard deontic modal logics do not often emphasize. (shrink)