Background The enhancement of nursing care quality is closely related to the clinical competence of nurses, making it a crucial component within health systems. Objective The present study investigated the relationship between nurses’ clinical competence, moral identity, and moral injury during the COVID-19 outbreak. Research design This cross-sectional study was carried out among frontline nurses, using the Moral Identity Questionnaire (MIQ), the Moral Injury Symptom Scale-Healthcare Professionals version (MISS-HP), and the Competency Inventory for Registered Nurse (CIRN) as data collection tools. (...) Participants and research context: The research population for this study consisted of all frontline nurses ( n = 251) employed in a hospital in southern Iran. Sampling was conducted between May 1, 2021 and September 30, 2021, during the COVID-19 outbreak. Ethical considerations The present study received approval from the research ethics committee of Rafsanjan University of Medical Sciences, with project No. 99267 and code of ethics ID No. IR. RUMS.REC.1399.262, dated 15.02.2021. Results According to the study findings, 42.2% of the nurses demonstrated high clinical competence, while 51.4% exhibited moderate clinical competence. The results indicated a positive correlation between moral identity and clinical competence but a negative correlation between moral injury and clinical competence. Furthermore, the variables of moral identity and moral injury were found to predict 10% of the variance in clinical competence. Conclusion According to the results, moral identity and moral injury had an impact on the clinical competence of nurses. Therefore, implementing a program aimed at enhancing moral identity and providing training strategies to address moral injury during crises like the COVID-19 pandemic can lead to improvements in nurses’ clinical competence and the overall quality of care they provide. (shrink)

While organizational deviance has become a popular research topic in the past two decades, deviant behavior remains a contested concept, with several research studies being done to better define the term. As a result, researchers have introduced various definitions and constructs which seem to overlap one another. Such proliferation might backfire and could lead to more confusion. Looking at deviance from an ontological aspect, therefore, will help to decrease such confusion among researchers. Another advantage to ontologically viewing deviance is that (...) it provides a better understanding of the concept. To prevent deviance occurring within an organization, the first step is learning more about it. This study therefore aims to discover how researchers can use ontological view to provide a better understanding of deviance, thus creating a deviance-free climate within an organization. This study looks at the role of storytelling in sharing norms within an organization to provide such a deviance-free climate. (shrink)

The central focus of this essay is Isaiah Berlin’s arguments about the concepts of negative freedom and positive freedom, developed in his philosophical work Two Concepts of Liberty. By adopting a philosophical standpoint, this essay explores the application of Berlin’s notions of freedom at the organizational level, within the workplace, and in the management field. This essay presents three philosophical arguments that provide some clarifications about the potential challenges associated with autonomy in organizations. These arguments incorporate Berlin’s ideas of freedom (...) with philosophical insights from Heidegger, Sartre, Frankfurt, and Confucius to highlight the missing elements of autonomy in management literature and its implementation in organizations, explaining the challenges of autonomy and the reasons for some unexpected results. Recommendations for future studies and managerial implications are discussed. (shrink)

Anxiety is a common unpleasant reaction among patients undergoing surgery. Many non-pharmacological methods such as spiritual strength are effective in preoperative anxiety management. This study aimed to assess the effects of listening to Quran recitation on reducing preoperative anxiety. A systematic review was performed in Medline, EMBASE, Cochrane Library, PsycINFO, Arab World Research Source, and other relevant databases to collect the data. Randomized controlled trials about the effects of listening to Quran recitation on preoperative anxiety reduction in elective surgery were (...) selected without any language and date restriction. Interventions with self-reading/self-recitation were excluded. The Cochran’s Q statistic and the I2 index with 50% threshold were used for calculating the heterogeneity and inconsistency index. Subgroup analysis was conducted based on the surgery type. The funnel plot was used to evaluate the possibility of publication bias. Twelve studies were included in the qualitative synthesis and nine studies in the quantitative synthesis. The meta-analysis showed a significant anxiety reduction with listening to Quran recitation. The heterogeneity between the included studies was statistically significant. The pooled effect size of anxiety was d = −8.893 = −10.763 to −7.022). The subgroup analysis showed that listening to Quran recitation reduces anxiety in major and minor surgeries. There was no publication bias in the studies. The findings indicated that listening to Quran recitation can be considered a non-invasive and peaceful intervention to reduce preoperative anxiety in elective surgery. (shrink)

Punctuation has so far attracted attention within the linguistics community mostly from a syntactic perspective. In this paper, we give a preliminary account of the information-based aspects of punctuation, drawing our points from assorted, naturally occurring sentences. We present our formal models of these sentences and the semantic contributions of punctuation marks. Our formalism is a simplified analogue of an extension --- due to Nicholas Asher --- of Discourse Representation Theory.

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEAT that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality set (...) algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEAT is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEAT are completely representable and that CPEAT has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEAT is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented. (shrink)

We take em-dash as our sample punctuation mark and examine its usage from a discourse perspective, using sentences from well-known corpora. We particularly comment on how dashes can give hints on information structure, focus, and anaphora. Throughout the paper Discourse Representation Theory is used as a framework.

We offer a preliminary account of the information-based aspects of punctuation marks. We give our initial treatment within the Discourse Representation Theory and its segmented version. We hypothesize that this work will be useful in classifying the informational contributions of punctuation marks and bringing them to bear on the semantic characterization of written discourse.

An interpolation Theorem is proved for first order logic with infinitary predicates. Our proof is algebraic via cylindric algebras.1.

We generalize two classical results on cylindric algebra to certain expansions of cylindric algebras where the extra operations are defined via first order formulas. The first result is the Neat Embedding Theorem of Henkin and the second is Monk's classical non-finitizability result of the class of representable algebras. As a corollary we obtain known classical results of Johnson and Biro published in the Journal of Symbolic logic.

SC, CA, QA and QEA denote the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasi-polyadic algebras and quasi-polyadic equality algebras, respectively. Let ω ≤ α < β and let K ∈ {SC,CA,QA,QEA}. We show that the class of α -dimensional neat reducts of algebras in Kβ is not elementary. This solves a problem in [3]. Also our result generalizes results proved in [2] and [3].

We prove an Omitting Types Theorem for certain algebraizable extensions of first order logic without equality studied in [SAI 00] and [SAY 04]. This is done by proving a representation theorem preserving given countable sets of infinite meets for certain reducts of ?- dimensional polyadic algebras, the so-called G polyadic algebras (Theorem 5). Here G is a special subsemigroup of (?, ? o) that specifies the signature of the algebras in question. We state and prove an independence result connecting our (...) representation theorem to Martin's axiom (Theorem 6). Also we show that the countable atomic G polyadic algebras are completely representable (Corollary 16) contrasting results on cylindric algebras. Several related results are surveyed. (shrink)

We survey various results on the relationship among neat embeddings (a notion special to cylindric algebras), complete representations, omitting types, and amalgamation. A hitherto unpublished application of algebraic logic to omitting types of first-order logic is given.

We present a property of neat reducts commuting with forming subalgebras as a definability condition.

Looking at the operation of forming neat $\alpha $ -reducts as a functor, with $\alpha $ an infinite ordinal, we investigate when such a functor obtained by truncating $\omega $ dimensions, has a right adjoint. We show that the neat reduct functor for representable cylindric algebras does not have a right adjoint, while that of polyadic algebras is an equivalence. We relate this categorial result to several amalgamation properties for classes of representable algebras. We show that the variety of cylindric (...) algebras of infinite dimension, endowed with the merry go round identities, fails to have the amalgamation property answering a question of Németi’s. We also study two variants of the so-called cylindric polyadic algebras introduced by Ferenczi (all are reducts of polyadic equality algebras, that are also varieties). We show that one is more cylindric than polyadic, and that the other is more polyadic than cylindric. Our classification is determined by results on neat embeddings and amalgamation expressed from the point of view of category theory, thereby witnessing, and, indeed, further emphasizing, the dichotomy between the cylindric and polyadic paradigms. For example, the first class does not have the unique neat embedding property, fails to have the amalgamation property and the neat reduct functor does not have a right adjoint, while the second class has the unique neat emdedding property, the superamalgamation property and the neat reduct functor is strongly invertible. Other results, like first order definability of the class of neat reducts and the class of completely representable algebras, confirming our classification along these lines are presented. (shrink)

We review, and in the process unify two techniques , for proving results concerning amalgamation in several classes studied in algebraic logic. The logical counterpart of these results adress interpolation and definability properties in modal and algebraic logic. Presenting them in a functorial context as adjoint situations, we show that both techniques can indeed be seen as instances of the use of the Keisler-Shelah ultrapower Theorem in proving Robinson's Joint Consistency Theorem. Some new results are surveyed. The results of this (...) paper are presented in such a way that further establishes the hitherto existing well developed duality theory between boolean algebras with operators and modal logic. (shrink)

As climate change continues to be a pressing issue affecting businesses, firms are taking proactive measures by integrating carbon considerations into their overall strategic planning for environmental sustainability. Nonetheless, the question of whether it pays to be green remains inconclusively answered. Based on an analysis of the 200 largest public listed firms by market capitalisation in Malaysia, the findings indicated that most of the firms are still reactive in managing their carbon activities; however, corporate carbon strategy does, indeed, lead to (...) better financial performance. The findings reaffirmed that going green pays off, particularly for firms with higher levels of foreign ownership. Interestingly, an inverse relationship was observed among firms with higher levels of government shareholdings. Additionally, the firms have been categorised into six different groups based on their scope and level of corporate carbon strategies, ranging from “wait-and-see” to “all-round explorer” classifications. Taken together, these findings enrich corporate carbon and sustainability literature and offer insights into theoretical and policy implications, along with suggestions for future research. (shrink)

Some recent studies in computational linguistics have aimed to take advantage of various cues presented by punctuation marks. This short survey is intended to summarise these research efforts and additionally, to outline a current perspective for the usage and functions of punctuation marks. We conclude by presenting an information-based framework for punctuation, influenced by treatments of several related phenomena in computational linguistics.

Let \(2 (...) It is shown that \(\mathbf{K_n}\) is not finitely axiomatizable and that it coincides with the class of atomic algebras in the elementary closure of \(\mathbf{S_c}{\sf Nr}_n{\sf CA}_{\omega}\) where \(\mathbf{S_c}\) is the operation of forming complete subalgebras. For any class \(\mathbf{L}\) such that \({\sf At}{\sf Nr}_n{\sf CA}_{\omega}\subseteq \mathbf{L}\subseteq {\sf At}\mathbf{K_n}\), it is proved that \({\bf SP}\mathfrak{Cm}\mathbf{L}={\sf RCA}_n\), where \({\sf Cm}\) is the dual operator to \(\sf At\); that of forming complex algebras. It is also shown that any class \(\mathbf{K}\) between \({\sf CRCA}_n\cap \mathbf{S_d}{\sf Nr}_n{\sf CA}_{\omega}\) and \(\mathbf{S_c}{\sf Nr}_n{\sf CA}_{n+3}\) is not first order definable, where \(\mathbf{S_d}\) is the operation of forming dense subalgebras, and that for any \(2shrink)

The philosophy of Bruno Latour has given us one of the most important statements on the part played by technology in the ordering of the human collective. Typically presented as a radical departure from mainstream social thought, Latour is not without his intellectual creditors: Michel Serres and, through him, René Girard. By tracing this development, we are led to understand better the relationship of Latour’s work, and Actor-Network Theory more generally, to traditional sociological concerns. By doing so we can also (...) hope to understand better the role that objects play in structuring society. (shrink)

We construct an atomic uncountable theory with no prime models. This contrasts with the countable case.

Fix 2 < n < ω. Let CA n denote the class of cylindric algebras of dimension n, and let RCA n denote the variety of representable CA n ’s. Let L n denote first-order logic restricted to the first n variables. Roughly, CA n, an instance of Boolean algebras with operators, is the algebraic counterpart of the syntax of L n, namely, its proof theory, while RCA n algebraically and geometrically represents the Tarskian semantics of L n. Unlike Boolean (...) algebras having a Stone representation theorem, RCA n ⊊ CA n. Using combinatorial game theory, we show that the existence of certain finite relation algebras RA, which are algebras whose domain consists of binary relations, implies that the celebrated Henkin omitting types theorem fails in a very strong sense for L n. Using special cases of such finite RA ’s, we recover the classical nonfinite axiomatizability results of Monk, Maddux, and Biro on RCA n and we re-prove Hirsch and Hodkinson’s result that the class of completely representable CA n ’s is not first-order definable. We show that if T is an L n countable theory that admits elimination of quantifiers, λ is a cardinal < 2 ℵ 0, and F = 〈 Γ i : i < λ 〉 is a family of complete nonprincipal types, then F can be omitted in an ordinary countable model of T. (shrink)

We formulate several statements in Algebraic Logic that turn out to be independent of ZFC. We relate such statements to Martin's axiom, omitting types for variants of first order logic and topological properties of Baire spaces.

Following research initiated by Tarski, Craig and Nemeti, and futher pursued by Sain and others, we show that for certain subsets G of $^\omega \omega $ , atomic countable G poiyadic algebras are completely representable. G polyadic algebras are obtained by restricting the similarity type and axiomatization of ω-dimensional polyadic algebras to finite quantifiers and substitutions in G. This contrasts the cases of cylindric and relation algebras.

Fix a finite ordinal \ and let \ be an arbitrary ordinal. Let \ denote the class of cylindric algebras of dimension \ and \ denote the class of relation algebras. Let \\) stand for the class of polyadic algebras of dimension \. We reprove that the class \ of completely representable \s, and the class \ of completely representable \s are not elementary, a result of Hirsch and Hodkinson. We extend this result to any variety \ between polyadic algebras (...) of dimension \ and diagonal free \s. We show that that the class of completely and strongly representable algebras in \ is not elementary either, reproving a result of Bulian and Hodkinson. For relation algebras, we can and will, go further. We show the class \ is not closed under \. In contrast, we show that given \, and an atomic \, then for any \, \ is a completely representable \. We show that for any \, the class of completely representable algebras in certain reducts of \s, that happen to be varieties, is elementary. We show that for \, the the class of polyadic-cylindric algebras dimension \, introduced by Ferenczi, the completely representable algebras coincide with the atomic ones. In the last algebras cylindrifications commute only one way, in a sense weaker than full fledged commutativity of cylindrifications enjoyed by classical cylindric and polyadic algebras. Finally, we address closure under Dedekind-MacNeille completions for cylindric-like algebras of dimension \ and \s for \ an infinite ordinal, proving negative results for the first and positive ones for the second. (shrink)