We study the notion of polynomial-time relation reducibility among computable equivalence relations. We identify some benchmark equivalence relations and show that the reducibility hierarchy has a rich structure. Specifically, we embed the partial order of all polynomial-time computable sets into the polynomial-time relation reducibility hierarchy between two benchmark equivalence relations Eλ and id. In addition, we consider equivalence relations with finitely many nontrivial equivalence classes and those whose equivalence classes (...) are all finite. (shrink)

The degree structure of functions induced by a polynomial-time reducibility first introduced in G. Miller's work on the complexity of prime factorization is investigated. Several basic results are established including the facts that the degrees restricted to the sets do not form an upper semilattice and there is a minimal degree, as well as density for the low degrees, a weak form of the exact pair theorem, the existence of minimal pairs and the decidability of the Π2 (...) theory of the low degrees. (shrink)

We have two polynomial time results for the uniform word problem for a quasivariety Q: The uniform word problem for Q can be solved in polynomial time iff one can find a certain congruence on finite partial algebras in polynomial time. Let Q* be the relational class determined by Q. If any universal Horn class between the universal closure S and the weak embedding closure S̄ of Q* is finitely axiomatizable then the uniform word (...) problem for Q is solvable in polynomial time. This covers Skolem's 1920 solution to the uniform word problem for lattices and Evans' 1953 applications of the weak embeddability property for finite partial V algebras. (shrink)

The central problem considered in this paper is whether a given recursive structure is recursively isomorphic to a polynomial-time structure. Positive results are obtained for all relational structures, for all Boolean algebras and for the natural numbers with addition, multiplication and the unary function 2x. Counterexamples are constructed for recursive structures with one unary function and for Abelian groups and also for relational structures when the universe of the structure is fixed. Results are also given which distinguish primitive (...) recursive structures, exponential-time structures and structures with honest witnesses. (shrink)

if and only if for every W in V, W is independent of the set of all its non-descendants conditional on the set of its parents. One natural question that arises with respect to DAGs is when two DAGs are “statistically equivalent”. One interesting sense of “statistical equivalence” is “d-separation equivalence” (explained in more detail below.) In the case of DAGs, d-separation equivalence is also corresponds to a variety of other natural senses of statistical equivalence (such as representing the same (...) set of distributions). Theorems characterizing d-separation equivalence for directed acyclic graphs and that can be used as the basis for polynomial time algorithms for checking d-separation equivalence were provided by Verma and Pearl (1990), and Frydenberg (1990). The question we will examine is how to extend these results to cases where a DAG may have latent (unmeasured) variables or selection bias (i.e. some of the variables in the DAG have been conditioned on.) D-separation equivalence is of interest in part because there are algorithms for constructing DAGs with latent variables and selection bias that are based on observed conditional independence relations. For this class of algorithms, it is impossible to determine which of two d-separation equivalent causal structures generated a given probability distribution, given only the set of conditional independence and dependence relations true of the observed distribution. We will describe a polynomial (in the number of vertices) time algorithm for determining when two DAGs which may have latent variables or selection bias are d-separation equivalent. (shrink)

A structure is automatic if its domain, functions, and relations are all regular languages. Using the fact that every automatic structure is decidable, in the literature many decision problems have been solved by giving an automatic presentation of a particular structure. Khoussainov and Nerode asked whether there is some way to tell whether a structure has, or does not have, an automatic presentation. We answer this question by showing that the set of Turing machines that represent automata-presentable structures is ${\rm{\Sigma (...) }}_1^1 $-complete. We also use similar methods to show that there is no reasonable characterisation of the structures with a polynomial-time presentation in the sense of Nerode and Remmel. (shrink)

The bounded arithmetic theory S2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T2i equals S2i + 1 then T2i is equal to S2 and proves that the polynomial time hierarchy collapses to ∑i + 3p, and, in fact, to the Boolean hierarchy over ∑i + 2p and to ∑i + 1p/poly.

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.

In an attempt to give a unified account of common properties of various resource bounded reducibilities, we introduce conditions on a binary relation ≤r between subsets of the natural numbers, where ≤r is meant as a resource bounded reducibility. The conditions are a formalization of basic features shared by most resource bounded reducibilities which can be found in the literature. As our main technical result, we show that these conditions imply a result about exact pairs which has been (...) previously shown by Ambos-Spies [2] in a setting of polynomial time bounds: given some recursively presentable ≤r-ideal I and some recursive ≤r-hard set B for I which is not contained in I, there is some recursive set C, where B and C are an exact pair for I, that is, I is equal to the intersection of the lower ≤r-cones of B and C, where C is not in I. In particular, if the relation ≤r is in addition transitive and there are least sets, then every recursive set which is not in the least degree is half of a minimal pair of recursive sets. (shrink)

The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations R and S on natural numbers, R is computably reducible to S if there is a computable function f:ω→ω that induces an injective map from R-equivalence classes to S-equivalence classes. In order to compare the complexity of equivalence relations which are computable, researchers considered also feasible variants of computable reducibility, such as the (...) polynomial-time reducibility. In this work, we explore Peq, the degree structure generated by primitive recursive reducibility on primitive recursive equivalence relations with infinitely many equivalence classes. In contrast with all other known degree structures on equivalence relations, we show that Peq has much more structure: e.g., we show that it is a dense distributive lattice. On the other hand, we also offer evidence of the intricacy of Peq, proving, e.g., that the structure is neither rigid nor homogeneous. (shrink)

The scattering number and isolated scattering number of a graph have been introduced in relation to Hamiltonian properties and network vulnerability, and the isolated scattering number plays an important role in characterizing graphs with a fractional 1-factor. Here we investigate the computational complexity of one variant, namely, the weighted isolated scattering number. We give a polynomial time algorithm to compute this parameter of interval graphs, an important subclass of perfect graphs.

Enumeration reducibility is a notion of relative computability between sets of natural numbers where only positive information about the sets is used or produced. Extending e‐reducibility to partial functions characterises relative computability between partial functions. We define a polynomial time enumeration reducibility that retains the character of enumeration reducibility and show that it is equivalent to conjunctive non‐deterministic polynomial time reducibility. We define the polynomial time e‐degrees as the equivalence (...) classes under this reducibility and investigate their structure on the recursive sets, showing in particular that the pe‐degrees of the computable sets are dense and do not form a lattice, but that minimal pairs exist. We define a jump operator and use it to produce a characterisation of the polynomial hierarchy. (shrink)

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relationsR,S, a componentwise reducibility is defined byR≤S⇔ ∃f∀x, y[x R y↔fS f].Here,fis taken from a suitable class of effective functions. For us the relations will be on natural numbers, andfmust be computable. We show that there is a${\rm{\Pi }}_1^0$-complete equivalence relation, but no${\rm{\Pi }}_k^0$-complete fork≥ 2. We show that${\rm{\Sigma }}_k^0$preorders arising naturally in the above-mentioned areas are${\rm{\Sigma }}_k^0$-complete. This includes (...) class='Hi'>polynomial timem-reducibility on exponential time sets, which is${\rm{\Sigma }}_2^0$, almost inclusion on r.e. sets, which is${\rm{\Sigma }}_3^0$, and Turing reducibility on r.e. sets, which is${\rm{\Sigma }}_4^0$. (shrink)

We introduce an analogue of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time (...) generalization of the countable Borel equivalence relations, a key subclass of the Borel equivalence relations, and again show that several key properties carry over to the larger class. Lastly, we collect together several results from the literature regarding Borel reducibility which apply also to absolutely $\Delta^1_2$ reductions, and hence to the infinite time computable reductions. (shrink)

This article states that the concept of time we generally hold is a spatial version of time.However, a spatial time concept creates a series of problems,with unfortunate consequences for education.The problems become particularly obvious when the spatial time concept is used as a basis for the education function that is connected to the individuality of the pupils. In order to examine this problem more closely, the article turns to literature in order to get a new and (...) different insight into education. In part four of the novel Ada or Ardor: A family chronicle (1969) the Russian-American author Vladimir Nabokov claims, by way of the protagonistVanVeen, that a spatial notion of time will lead to a determinate and reduced view of the future. Not only does one in this way sweep the very notion of time under the carpet, but one will moreover hinder the possibility of appearing as a unique and individualised person.Van is preoccupied with a pedagogic question: viz., the question of how one can become individualised through time.This is also the reason he attempts to re-create a time concept that can give him the status of a free and independent individual. With a background in Van’s analysis of time, the article attempts to derive two forms for education. First, formal education, which bases itself on a spatial time concept. Secondly, non-formal education, which bases itself on a time concept that has freed itself in the greatest possible manner from space. Neither of these two solutions is appropriate in regard to education’s individualising function. Therefore, the article draws on Nabokov’s best-known novel, Lolita (1955), so as to broadenVan’s understanding of time. In the end, then, the article articulates a time concept that introduces a notion of education where time occurs through acts of responsibility. Not until education has such a time concept as a basis, can one, so the article argues, attain the education function that has as its goal to individualise and make responsible children and young people. (shrink)

To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a number less than or equal to x was enumerated into A. One c.e. set A is settling time dominated by another set B (B >st A) if for every computable function f, for all but finitely many x, mB(x) > f(m₄(x)). This settling-time ordering, which is a natural extension to an ordering (...) of the idea of domination, was first introduced by Nabutovsky and Weinberger in [3] and Soare [6]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the <st ordering. We show that it is not invariant under computable isomorphism, that any countable partial ordering embeds into it, that there are maximal and minimal sets, and that two c.e. sets need not have an inf or sup in the ordering. We also examine a related ordering, the strong settling-time ordering where we require for all computable f and g, for almost all x, mB(x) > f(mA(g(x))). (shrink)

This article states that the concept of time we generally hold is a spatial version of time.However, a spatial time concept creates a series of problems,with unfortunate consequences for education.The problems become particularly obvious when the spatial time concept is used as a basis for the education function that is connected to the individuality of the pupils. In order to examine this problem more closely, the article turns to literature in order to get a new and (...) different insight into education. In part four of the novel Ada or Ardor: A family chronicle (1969) the Russian-American author Vladimir Nabokov claims, by way of the protagonistVanVeen, that a spatial notion of time will lead to a determinate and reduced view of the future. Not only does one in this way sweep the very notion of time under the carpet, but one will moreover hinder the possibility of appearing as a unique and individualised person.Van is preoccupied with a pedagogic question: viz., the question of how one can become individualised through time.This is also the reason he attempts to re-create a time concept that can give him the status of a free and independent individual. With a background in Van’s analysis of time, the article attempts to derive two forms for education. First, formal education, which bases itself on a spatial time concept. Secondly, non-formal education, which bases itself on a time concept that has freed itself in the greatest possible manner from space. Neither of these two solutions is appropriate in regard to education’s individualising function. Therefore, the article draws on Nabokov’s best-known novel, Lolita (1955), so as to broadenVan’s understanding of time. In the end, then, the article articulates a time concept that introduces a notion of education where time occurs through acts of responsibility. Not until education has such a time concept as a basis, can one, so the article argues, attain the education function that has as its goal to individualise and make responsible children and young people. (shrink)

The perception of time cannot be reduced to a simple percept produced by an internal clock. The aim of the present study was therefore to investigate the role of the individual consciousness of time on temporal judgments. In the present study, the participants’ awareness of attention-related time distortions was assessed using a metacognitive questionnaire. The participants were also required to verbally judge a series of stimulus durations in a single or a dual task condition. The results revealed (...) that time was underestimated in the dual task compared to the single task. However, the accuracy of time judgments improved in line with the participants’ individual awareness of attentional time distortion: The more aware they were of the role of attention in time perception, the lower the time distortions they exhibited. Conscious awareness of time therefore plays a role in the accuracy of the time judgments made by human beings. (shrink)

Space, Time, and Stuff is an attempt to show that physics is geometry: that the fundamental structure of the physical world is purely geometrical structure. Along the way, he examines some non-standard views about the structure of spacetime and its inhabitants, including the idea that space and time are pointless, the idea that quantum mechanics is a completely local theory, the idea that antiparticles are just particles travelling back in time, and the idea that time has (...) no structure whatsoever. The main thrust of the book, however, is that there are good reasons to believe that spaces other than spacetime exist, and that it is the existence of these additional spaces that allows one to reduce all of physics to geometry. Philosophy, and metaphysics in particular, plays an important role here: the assumption that the fundamental laws of physics are simple in terms of the fundamental physical properties and relations is pivotal."--P. [4] of cover. (shrink)

Background Retraction is a mechanism for alerting readers to unreliable material and other problems in the published scientific and scholarly record. Retracted publications generally remain visible and searchable, but the intention of retraction is to mark them as “removed” from the citable record of scholarship. However, in practice, some retracted articles continue to be treated by researchers and the public as valid content as they are often unaware of the retraction. Research over the past decade has identified a number of (...) factors contributing to the unintentional spread of retracted research. The goal of the Reducing the Inadvertent Spread of Retracted Science: Shaping a Research and Implementation Agenda (RISRS) project was to develop an actionable agenda for reducing the inadvertent spread of retracted science. This included identifying how retraction status could be more thoroughly disseminated, and determining what actions are feasible and relevant for particular stakeholders who play a role in the distribution of knowledge. -/- Methods These recommendations were developed as part of a year-long process that included a scoping review of empirical literature and successive rounds of stakeholder consultation, culminating in a three-part online workshop that brought together a diverse body of 65 stakeholders in October–November 2020 to engage in collaborative problem solving and dialogue. Stakeholders held roles such as publishers, editors, researchers, librarians, standards developers, funding program officers, and technologists and worked for institutions such as universities, governmental agencies, funding organizations, publishing houses, libraries, standards organizations, and technology providers. Workshop discussions were seeded by materials derived from stakeholder interviews (N = 47) and short original discussion pieces contributed by stakeholders. The online workshop resulted in a set of recommendations to address the complexities of retracted research throughout the scholarly communications ecosystem. -/- Results The RISRS recommendations are: (1) Develop a systematic cross-industry approach to ensure the public availability of consistent, standardized, interoperable, and timely information about retractions; (2) Recommend a taxonomy of retraction categories/classifications and corresponding retraction metadata that can be adopted by all stakeholders; (3) Develop best practices for coordinating the retraction process to enable timely, fair, unbiased outcomes; and (4) Educate stakeholders about pre- and post-publication stewardship, including retraction and correction of the scholarly record. -/- Conclusions Our stakeholder engagement study led to 4 recommendations to address inadvertent citation of retracted research, and formation of a working group to develop the Communication of Retractions, Removals, and Expressions of Concern (CORREC) Recommended Practice. Further work will be needed to determine how well retractions are currently documented, how retraction of code and datasets impacts related publications, and to identify if retraction metadata (fails to) propagate. Outcomes of all this work should lead to ensuring retracted papers are never cited without awareness of the retraction, and that, in public fora outside of science, retracted papers are not treated as valid scientific outputs. (shrink)

Let ${\cal T}$ be any of the three canonical truth theories CT^− (compositional truth without extra induction), FS^− (Friedman–Sheard truth without extra induction), or KF^− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA. We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA. Theorem.${\cal T}$is feasibly reducible to PA, in the sense that there is a polynomial time computable function f such that for (...) every ${\cal T}$-proof π of an arithmetical sentence ϕ, f(π) is a PA-proof of ϕ. (shrink)

We investigate the question of whether one can characterize complexity classes in terms of efficient reducibility to the set of Kolmogorov-random strings . This question arises because and , and no larger complexity classes are known to be reducible to in this way. We show that this question cannot be posed without explicitly dealing with issues raised by the choice of universal machine in the definition of Kolmogorov complexity. What follows is a list of some of our main results.• (...) Although Kummer showed that, for every universal machine U there is a time bound t such that the halting problem is disjunctive truth-table reducible to in time t, there is no such time bound t that suffices for every universal machine U. We also show that, for some machines U, the disjunctive reduction can be computed in as little as doubly-exponential time.• Although for every universal machine U, there are very complex sets that are -reducible to , it is nonetheless true that . • Any decidable set that is polynomial-time monotone-truth-table reducible to is in .• Any decidable set that is polynomial-time truth-table reducible to via a reduction that asks at most f queries on inputs of size n lies in. (shrink)

Negative self-referential processing has fruitfully been studied in unipolar depressed patients, but remarkably less in patients with bipolar disorder (BD). This exploratory study examines the relation between task-based self-referential processing and depressive symptoms in BD and their possible importance to the working mechanism of mindfulness-based cognitive therapy (MBCT) for BD. The study population consisted of a subsample of patients with BD (n = 49) participating in an RCT of MBCT for BD, who were assigned to MBCT + TAU (n (...) = 23) or treatment as usual (TAU) (n = 26). Patients performed the self-referential encoding task (SRET), which measures (1) positive and (2) negative attributions to oneself as well as (3) negative self-referential memory bias, before and after MBCT + TAU or TAU. At baseline, all three SRET measures were significantly related to depressive symptoms in patients with BD. Moreover, repeated measures analyses of variance revealed that negative self-referential memory bias diminished over time in the MBCT + TAU group, compared with the TAU group. Given the preliminary nature of our findings, future research should explore the possibly mediating role of reducing negative self-referential memory bias in preventing and treating depressive symptoms in BD through MBCT. (shrink)

The idea that causation can be reduced to transmission of an amount of some conserved quantity between events is spelled out and defended against important objections. Transmission is understood as a symmetrical relation of copresence in two distinct events. The actual asymmetry of causality has its origin in the asymmetrical character of certain irreversible physical processes and then spreads through the causal net. This conception is compatible with the possibility of backwards causation and with a causal theory of (...) class='Hi'>time. Genidentity, the persistence of concrete objects, can be given an explanation in causal terms. The transmission theory is shown to escape difficulties faced by two important alternative theories of causation: Salmon's (1984) Mark Transmission Theory and Dowe's (1992a) Conserved Quantities Theory. (shrink)

Individuals often face administrative hurdles in attempting to access health care, public programmes, and other legal statuses and entitlements. These ordeals are the products, directly or indirectly, of institutional and policy design choices. I argue that evaluating whether such ordeals are justifiable or desirable instruments of social policy depends on assessing, beyond their targeting effects, the process-related burdens they impose on those attempting to navigate them and these burdens’ distributive effects. I here examine specifically how ordeals that levy time (...) costs reduce and constrain individuals’ free time, and how such time-cost ordeals may thereby create, deepen and compound disadvantages. (shrink)

A common approach to explaining the perception of form is through the use of static features. The weakness of this approach points naturally to dynamic definitions of form. Considering dynamical form, however, leads inevitably to the need to explain how events are perceived as time-extended—a problem with primacy over that even of qualia. Optic flow models, energy models, models reliant on a rigidity constraint are examined. The reliance of these models on the instantaneous specification of form at an instant, (...) t, or across a series of such instants forces the consideration of the primary memory supporting both the perception of time-extended events and the time-extension of consciousness. This cannot be reduced to an integration over space and time. The difficulty of defining the basis for this memory is highlighted in considerations of dynamic form in relation to scales of time. Ultimately, the possibility is raised that psychology must follow physics in a more profound approach to time and motion. (shrink)

The relativized propositional calculus is a system of Boolean formulas with query symbols. A formula in this system is called a one-query formula if the number of occurrences of query symbols is just one. If a one-query formula is a tautology with respect to a given oracle A then it is called a one-query tautology with respect to A. By extending works of Ambos-Spies (1986) and us (2002), we investigate the measure of the class of all oracles A such that (...) the set of all one-query tautologies with respect to A does not p-btt-reduce to A, where p-btt denotes polynomial-time bounded-truth-table. We show that certain Dowd-type generic oracles all belong to the class, and hence measure of the class is one. (shrink)

This book offers a defense of the tensed theory of time, a critique of the New Theory of Reference, and an argument that simultaneity is absolute. Although Smith rejects ordinary language philosophy, he shows how it is possible to argue from the nature of language to the nature of reality. Specifically, he argues that semantic properties of tensed sentences are best explained by the hypothesis that they ascribe to events temporal properties of futurity, presentness, or pastness and do not (...) merely ascribe relations of earlier than or simultaneity. He criticizes the New Theory of Reference, which holds that "now" refers directly to a time and does not ascribe the property of presentness. Smith does not adopt the old or Fregean theory of reference but develops a third alternative, based on his detailed theory of de re and de dicto propositions and a theory of cognitive significance. He concludes the book with a lengthy critique of Einstein's theory of time. Smith offers a positive argument for absolute simultaneity based on his theory that all propositions exist in time. He shows how Einstein's relativist temporal concepts are reducible to a conjunction of absolutist temporal concepts and relativist nontemporal concepts of the observable behavior of light rays, rigid bodies, and the like. (shrink)

Institutional investors, policy makers, and researchers have advocated for greater director independence in hopes of improving corporate governance and discouraging unethical behaviors such as corporate frauds, accounting irregularities, and other organizational failures. However, increasing demands upon directors and sitting CEOs, as well as constraints on the number of boards on which they can serve, has resulted in a dramatic increase in the use of retired independent directors. Compared to other directors with full-time job demands, we argue that RIDs have (...) lesser time constraints and greater attentional capacities with which to discharge their responsibilities, thereby improving overall board “bandwidth.” Using S&P 1500 firms for the period of 2000–2012, we find that enhanced board bandwidth associated with an increased proportion of RIDs on the board relates to greater resource provisioning through reducing costs of capital, improved monitoring through reducing disclosure-related weaknesses, and better accounting and market performance. We thereby advance traditional board bandwidth research by contemplating the available time that independent directors would have by virtue of being retired and relating this to board effectiveness. (shrink)

Turing machines define polynomial time on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time ? Earlier, one of us conjectured a negative answer. The problem motivated a quest (...) for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines . The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime. (shrink)

Disorders of consciousness and the self are at the forefront of schizophrenia symptomatology. Patients are impaired in feeling themselves as the authors of their thoughts and actions. In addition, their flow of consciousness is disrupted, and thought fragmentation has been suggested to be involved in the patients’ difficulties in feeling as being one unique, unchanging self across time. Both impairments are related to self disorders, and both have been investigated at the experimental level. Here we review evidence that both (...) mechanisms of motor control and the temporal structure of signal processing are impaired in schizophrenia patients. Based on this review, we propose that the sequencing of action and perception plays a key role in the patients’ impairments. Furthermore, the millisecond time scale of the disorders, as well as the impaired sequencing, highlights the cooperation between brain networks including the cerebellum, as proposed by Andreasen (1999). We examine this possibility in the light of recent knowledge on the anatomical and physiological properties of the cerebellum, its role in timing, and its involvement in known physiological impairments in patients with schizophrenia, e.g., resting states and brain dynamics. A disruption in communication between networks involving the cerebellum, related to known impairments in dopamine, glutamate and GABA transmission, may help to better explain why patients experience reduced attunement with the external world and possibly with themselves. (shrink)

Organizations have long struggled to find ways to reduce the occurrence of unethical behaviors by employees. Unfortunately, time theft, a common and costly form of ethical misconduct at work, has been understudied by ethics researchers. In order to remedy this gap in the literature, we used the theory of planned behavior (TPB) to investigate the antecedents of time theft, which includes behaviors such as arriving later to or leaving earlier from work than scheduled, taking additional or longer breaks (...) than is acceptable, and on-the-job daydreaming. We surveyed 135 employed undergraduate business students regarding the TPB variables at Time 1. Two months later, participants reported the frequency they engaged in time theft since Time 1. Results indicate that behavioral, normative, and control beliefs significantly predicted attitudes, subjective norms, and perceived behavioral control, respectively. Attitudes, subjective norms, and perceived behavioral control, in turn, were significantly related to time theft intentions, which predicted later enactment of time theft. Thus, employers can decrease time theft by primarily focusing on altering employees’ attitudes toward time theft, followed by reducing social pressures to engage in it, and lastly, by implementing organizational practices that make it difficult to commit time theft. (shrink)

One of the central characteristics of the causal relation is that it is asymmetric. This chapter looks at possible relations between the direction of time and the causal asymmetry. It first presents a discussion on a causal theory of the temporal asymmetry that takes the causal asymmetry to be basic. It then examines two kinds of accounts that take asymmetric causal relations to be further reducible. The first kind is a subjectivist account of causation that argues that the (...) fact that we describe the world in asymmetric causal terms has its origins in a more fundamental asymmetry of deliberation. The author here focuses on the more recent defense of such an account in Price and Weslake. The second kind is an entropy account of the causal asymmetry. A more recent version of such an account, the account developed by David Albert and Barry Loewer, is discussed in the chapter. (shrink)

This paper is a continuation of the authors' work , where the main problem considered was whether a given recursive structure is recursively isomorphic to a polynomial-time structure. In that paper, a recursive Abelian group was constructed which is not recursively isomorphic to any polynomial-time Abelian group. We now show that if every element of a recursive Abelian group has finite order, then the group is recursively isomorphic to a polynomial-time group. Furthermore, if the (...) orders are bounded, then the group is recursively isomorphic to a polynomial-time group with universe A being the set of tally representations of natural numbers Tal = s{;1s};* or the set of binary representations of the natural numbers Bin. We also construct a recursive Abelian group with all elements of finite order but which has elements of arbitrary large finite order which is not isomorphic to any polynomial-time group with universe Tal or Bin. Similar results are obtained for structures , where f is a permutation on the set A. (shrink)

Quantum electrodynamics presents intrinsic limitations in the description of physical processes that make it impossible to recover from it the type of description we have in classical electrodynamics. Hence one cannot consider classical electrodynamics as reducing to quantum electrodynamics and being recovered from it by some sort of limiting procedure. Quantum electrodynamics has to be seen not as a more fundamental theory, but as an upgrade of classical electrodynamics, which permits an extension of classical theory to the description of phenomena (...) that, while being related to the conceptual framework of the classical theory, cannot be addressed from the classical theory. (shrink)

The current work investigated whether differences in phonological overlap between the past- and present-tense forms of regular and irregular verbs can account for the graded neurophysiological effects of verb regularity observed in past-tense priming designs. Event-related potentials were recorded from 16 healthy participants who performed a lexical-decision task in which past-tense primes immediately preceded present-tense targets. To minimize intra-modal phonological priming effects, cross-modal presentation between auditory primes and visual targets was employed, and results were compared to a companion intra-modal auditory (...) study (Justus, T., Larsen, J., de Mornay Davies, P., Swick, D. (2008). Interpreting dissociations between regular and irregular past-tense morphology: evidence from event-related potentials. Cognitive, Affective, Behavioral Neuroscience, 8, 178–194.). For both regular and irregular verbs, faster response times and reduced N400 components were observed for present-tense forms when primed by the corresponding past-tense forms. Although behavioral facilitation was observed with a pseudopast phonological control condition, neither this condition nor an orthographic-phonological control produced significant N400 priming effects. Instead, these two types of priming were associated with a post-lexical anterior negativity (PLAN). Results are discussed with regard to dual- and single-system theories of inflectional morphology, as well as intra- and cross-modal prelexical priming. (shrink)

We consider Choiceless Polynomial Time , a language introduced by Blass, Gurevich and Shelah, and show that it can express a query originally constructed by Cai, Fürer and Immerman to separate fixed-point logic with counting from image. This settles a question posed by Blass et al. The program we present uses sets of unbounded finite rank: we demonstrate that this is necessary by showing that the query cannot be computed by any program that has a constant bound on (...) the rank of sets used, even in image, an extension of image with counting. (shrink)

IntroductionNew nurses struggled with time management, which was a prominent theme in safety care for patients. However, the transition training of time management for new nurses was complicated and ignored by clinical managers. The purpose of this study was to understand the level of new nurses’ TMD from a nationwide perspective and detect the influencing factors of the TMD.Materials and methodsA cross-sectional study design with a stratified sampling method was sampled in China. Six hundred and seventy new nurses (...) within the first year of employment were recruited. New nurses’ time management disposition, job stressors, self-efficacy, clinical communication competence, and safety behavior were measured by corresponding scales.ResultsNew nurses showed the best sense of time’s value, followed by the sense of time efficacy and time monitoring view for time management disposition. The related factors of time management disposition were communication skills, safety behavior, job stressors, and being without a preceptor. New nurses’ time management disposition was at a moderate level and they performed worse in time allocation. The highest education, with or without a preceptor, the experience of part-time jobs, and class cadre were significantly influencing the time management disposition of new nurses.ConclusionNursing managers should pay attention to new nurses’ time management disposition. Reducing the job stressors, improving communication ability, and safe behavior were important measures to improve the time management disposition. (shrink)

This book deals with solving a pressing organizational challenge of bringing employees up to speed faster. In the fast-paced business world, organizations need faster readiness of employees to handle the complex responsibilities of their jobs. The author conducted an extensive doctoral research study with 85 global experts across 66 project cases to explore the practices and strategies that were proven to reduce time to proficiency of employees in a range of organizations worldwide. This book provides the readers with a (...) first-hand account of findings exclusively related to training and learning strategies, instructional methods, and curriculum design. This book delivers over 21 training and learning strategies across online learning, classroom instructions, and on-the-job learning. These strategies will allow training designers and learning specialists to design workplace training programs that hold the potential to shorten time to proficiency of employees. The book not only describes findings of the study and theoretical underpinnings, but it also provides practical guidance for implementation to equip corporate learning specialists, HR professionals, training leaders, performance consultants, and direct managers. (shrink)

We present a general relativistic model of a spherical shell of matter with a perfect fluid on its surface coupled to an internal oscillator, which generalizes a model recently introduced by the authors to construct a self-gravitating interferometer. The internal oscillator evolution is defined with respect to the local proper time of the shell, allowing the oscillator to serve as a local clock that ticks differently depending on the shell’s position and momentum. A Hamiltonian reduction is performed on the (...) system, and an approximate quantum description is given to the reduced phase space. If we focus only on the external dynamics, we must trace out the clock degree of freedom, and this results in a form of intrinsic decoherence that shares some features with a proposed “universal” decoherence mechanism attributed to gravitational time dilation. We note that the proposed decoherence remains present in the limit of flat spacetime, emphasizing that the effect can be attributed entirely to proper time differences, and thus is not necessarily related to gravity. Whereas the effect described in vanishes in the absence of an external gravitational field, our approach bootstraps the gravitational contribution to the time dilation decoherence by including self-interaction, yielding a fundamentally gravitational intrinsic decoherence effect. (shrink)

This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time (...) from fixpoint plus counting. We show that the examples in a paper of Cai, Fürer, and Immerman, when suitably padded, are in choiceless polynomial time yet not in fixpoint plus counting. Without padding, they remain in polynomial time but appear not to be in choiceless polynomial time plus counting. Similar results hold for the multipede examples of Gurevich and Shelah, except that their final version of multipedes is, in a sense, already suitably padded. Finally, we describe another possible candidate, involving determinants, for the task of separating polynomial time from choiceless polynomial time plus counting. (shrink)

Working memory limits are best defined in terms of the complexity of the relations that can be processed in parallel. Complexity is defined as the number of related dimensions or sources of variation. A unary relation has one argument and one source of variation; its argument can be instantiated in only one way at a time. A binary relation has two arguments, two sources of variation, and two instantiations, and so on. Dimensionality is related to the number (...) of chunks, because both attributes on dimensions and chunks are independent units of information of arbitrary size. Studies of working memory limits suggest that there is a soft limit corresponding to the parallel processing of one quaternary relation. More complex concepts are processed by or In segmentation, tasks are broken into components that do not exceed processing capacity and can be processed serially. In conceptual chunking, representations are to reduce their dimensionality and hence their processing load, but at the cost of making some relational information inaccessible. Neural net models of relational representations show that relations with more arguments have a higher computational cost that coincides with experimental findings on higher processing loads in humans. Relational complexity is related to processing load in reasoning and sentence comprehension and can distinguish between the capacities of higher species. The complexity of relations processed by children increases with age. Implications for neural net models and theories of cognition and cognitive development are discussed. (shrink)

The disciplinary enterprises engaged in the study of consciousness now extend beyond their original paradigms providing additional knowledge toward an overall understanding of the fundamental meaning and scope of consciousness. A new transdisciplinary domain has resulted from the syncretism of several approaches bringing about a new paradigm. The background for this overarching enterprise draws from a variety of traditions. In this paper however elaboration is restricted to the quantum-mechanical account in David Bohm’s theoretical work in relation to his ideas (...) about “active information”, “protointelligence”, and “non-locality”. This leads to an adapted version of Bohm’s thesis concerning the implicate order and explicate order of the Universe - the Impression Order and the Expression Order, respectively. On this view, the Universe is formed on an actual-material level, the apparent properties of things, and a potential-material level, a constant process of becoming that exerts an attractive force on the present. The central thesis emerges from a radical reformulation of certain core concepts that transforms many ontological assumptions about the material basis of consciousness. That is, the above platform inclusively connects to a hypothesis that the concepts of ‘space’, ‘time’, ‘event’, and ‘motion’ can be unified to capture the notion of simultaneous activity at reducing levels to the Impression order. This notion coheres with a physical-theoretical model of Signature-Energy-Frequency which has been well demonstrated in the atomic, chemical, and information fields. This study embraces a holistic and creative worldview based on a triadic model wherein consciousness itself is postulated as the most basic, primordial stratum. Importantly, both orders are constantly conjoined since the Impression Order exists as potential energy of the quantum vacuum. The physical realm is formed by the proposed Triangulate-Three conditions as a principle of animation and ‘being’: Consciousness, Body-of-Experience and Intellect-Reflective in the Expression Order, one aspect of which emerge as lifelike properties. This Triangulate-Three principle inheres in every particle and organism to which it guides its development, adaptation, and survival. The conscious being thus possesses all three conditions in Expression Order through STEM-interactions via SEF transmissions, as a self-organising organism. (shrink)

The principle of individual medical confidentiality is one of the moral principles that Africa inherited unquestioningly from the West as part of Western medicine. The HIV/AIDS pandemic in Southern Africa has reduced the relevance of the principle of individual medical confidentiality. Individual medical confidentiality has especially presented challenges for practitioners among the Bantu communities that are well known for their social inter-connectedness and the way they value their extended family relations. Individual confidentiality has raised several unforeseen problems for persons living (...) with HIV/AIDS, ranging from stigma and isolation to feelings of dejection as it drives them away from their families as a way of trying to keep information about their conditions confidential. The involvement of family members in treatment decisions is in line with the philosophy of Ubuntu and serves to respect patients’ and families’ autonomy while at the same time benefiting the individual patient. (shrink)

Time is one of the most enigmatic notions philosophers have ever dealt with. Once subjected to close examination, almost any feature usually ascribed to time, leads to a plethora of fundamental and hard to resolve questions. Just as philosophers of the eighteenth-century attempted to take account of revolutionary developments in the physical sciences in understanding space, life, and a host of other fundamental aspects of nature (see Jones, Gaukroger, and Smith in this volume) they also engaged in fundamental (...) and fruitful controversies about the nature of time spurred by Newton and others (see Schliesser and Schabas in this volume). In this article, I will attempt to trace the general outlines of these controversies. Special attention will be given to a question that was central for many eighteenth century philosophers and is somewhat less prominent in contemporary, twenty-first century, debates on the nature of time, i.e., whether time can be reduced to, grounded by, or explained through other more basic elements. The concept of time is commonly discussed – both in eighteenth and twenty first century philosophy – in analogy to space. Here I will attempt to focus on time and address the analogies to space only when relevant. This attitude is motivated both by the need to provide as detailed an account as possible of time in the allocated textual space, and by the various dissimilarities between space and time. While space and time can be fruitfully compared and contrasted, the use of metaphors taken from one domain to clarify features belonging to the other domain has the real potential of leading us astray by unconsciously and seamlessly taking metaphorical language in a literal sense. In the first part of this essay, I will discuss the famous debate between Newton, Leibniz and Clarke on the nature of space and time. The second part will address Hume’s understanding of time and the relation between time and causation. In the third and final part, I will discuss Kant’s views on the relation between time and causality, place them in the context of his predecessors, and then examine Salomon Maimon’s attempt to revive the Leibnizian program of reducing time to concepts, within the framework of Kantian philosophy, broadly conceived. (shrink)

This volume addresses the question of time from the perspective of the time of nature. Its aim is to provide some insights about the nature of time on the basis of the different uses of the concept of time in natural sciences. Presenting a dialogue between philosophy and science, it features a collection of papers that investigate the representation, modeling and understanding of time as they appear in physics, biology, geology and paleontology. It asks questions (...) such as: whether or not the notions of time in the various sciences are reducible to the same physical time, what status should be given to timescale differences, or what are the specific epistemic issues raised by past facts in natural sciences. The book first explores the experience of time and its relation to time in nature in a set of chapters that bring together what human experience and physics enable metaphysicians, logicians and scientists to say about time. Next, it studies time in physics, including some puzzling paradoxes about time raised by the theory of relativity and quantum mechanics. The volume then goes on to examine the distinctive problems and conceptions of time in the life sciences. It explores the concept of deep time in paleontology and geology, time in the epistemology of evolutionary biology, and time in developmental biology. Each scientific discipline features a specific approach to time and uses distinctive methodologies for implementing time in its models. This volume seeks to define a common language to conceive of the distinct ways different scientific disciplines view time. In the process, it offers a new approach to the issue of time that will appeal to a wide range of readers: philosophers and historians of science, metaphysicians and natural scientists - be they scholars, advanced students or readers from an educated general audience. (shrink)