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

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)

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)

Biobanking is a relatively new concept in Egypt. Building a good relationship with different stakeholders is essential for the social sustainability of biobanks. To establish this relationship, it is necessary to assess the attitude of different groups towards this concept. The objective of this work is to assess the knowledge, attitude, and opinions of Egyptian patients towards biobanking issues. We designed a structured survey to be administered to patients coming to the outpatient clinics in 3 university hospitals in Egypt. The (...) survey included questions estimating the level of knowledge about the term “Biobank”, together with questions about the attitudes and opinions about related issues. Two hundred and fifty-nine patients participated in the survey. Eighty-one percent of participants reported that they never heard about the term before. About 85% expressed that they would be willing to donate their samples for research and about 87% thought that sample donation did not contradict their religious beliefs. Fifty eight percent were willing to participate in a genetic research project, 27.8% supported sharing their sample with pharmaceutical companies, and 32.4% agreed to share their samples with institutions abroad. Although there is limited knowledge about biobanking among Egyptian patients, many had a positive attitude towards sample donation and didn’t show religious concerns against it. However, they showed concerns regarding participation in genetic research and with sharing their samples across borders or with pharmaceutical companies. Public education about biobanking is possible, taking into consideration the specific cultural and legal framework in Egypt. (shrink)

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.

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)

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

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.

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

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.

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)

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)

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)

Fix \. Let \ denote first order logic restricted to the first n variables. Using the machinery of algebraic logic, positive and negative results on omitting types are obtained for \ and for infinitary variants and extensions of \.

We show that there exists an atomic polyadic equality algebra of dimension n that is elementary equivalent to a completely representable algebra, but its diagonal free reduct is not completely representable.

In this note we give an interpretation of cylindric algebras as algebras of sentences of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof.

The quality of the products coming from different lines of production requires some tests called comparative life tests. For lines having the same facility, the lifetime of the product is distributed by Burr XII, the lifetime distribution, and units are tested under type-I generalized hybrid censoring scheme. The observed censoring data are used under maximum likelihood and the Bayes method to estimate the model parameters. The theoretical results are discussed and assessed through data analysis and Monte Carlo simulation study. Finally, (...) we reported some brief comments obtained from numerical computation. (shrink)

In this article, we consider estimation of the parameters of a generalized Pareto distribution and some lifetime indices such as those relating to reliability and hazard rate functions when the failure data are progressive first-failure censored. Both classical and Bayesian techniques are obtained. In the Bayesian framework, the point estimations of unknown parameters under both symmetric and asymmetric loss functions are discussed, after having been estimated using the conjugate gamma and discrete priors for the shape and scale parameters, respectively. In (...) addition, both exact and approximate confidence intervals as well as the exact confidence region for the estimators are constructed. A practical example using a simulated data set is analyzed. Finally, the performance of Bayes estimates is compared with that of maximum likelihood estimates through a Monte Carlo simulation study. (shrink)

Tuberculosis is caused by bacillus Mycobacterium tuberculosis. In this study, a mathematical model of tuberculosis is analyzed. The numerical behaviour of the considered model is analyzed including basic reproduction number and stability. We applied three numerical techniques to this model, i.e., nonstandard finite difference scheme, Runge–Kutta method of order 4, and forward Euler scheme. NSFD scheme preserves all the essential properties of the model. Acquired results corroborate that NSFD scheme converges for each step size. While the other two schemes failed (...) to preserve some properties of the model such as positivity and convergence. A graphical comparison presented in this study confirms the numerical stability of the NSFD technique shown here is maintained over a large area. (shrink)

Drawing on social exchange theory, this study examines a mechanism, namely organizational social capital, through which self-sacrificial leadership is related to two types of employee behaviours: organizational citizenship behaviours and counterproductive behaviours. The results of two different studies in Egypt showed that self-sacrificial leadership is positively related to OSC which, in turn, is positively related to OCBs and negatively related to CPBs. Overall, the findings suggest that self-sacrificial leaders are more likely to achieve desirable employee behaviours through improving the quality (...) of social relationships among employees. (shrink)

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if (...) and only if > 1.From this it easily follows that for 1 , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise. (shrink)

In recent years, scholars have sought to investigate the impact that ethical leaders can have within organisations. Yet, only a few theoretical perspectives have been adopted to explain how ethical leaders influence subordinate outcomes. This study therefore draws on social rules theory (SRT) to extend our understanding of the mechanisms linking ethical leadership to employee attitudes. We argue that ethical leaders reduce disengagement, which in turn promotes higher levels of job satisfaction and organisational commitment, as well as lower turnover intentions. (...) Co-worker social undermining is examined as a moderator of the relationship between ethical leadership and disengagement, as we suggest that it is difficult for ethical leaders to be effective when co-worker undermining prevails. To test the proposed model, questionnaires were administered to 460 nurses in Romanian hospital settings over three time points separated by two-week intervals and the hypotheses were tested using generalised multilevel structural equation modeling (GSEM) with STATA. The findings revealed that ethical leadership has a beneficial effect on employee attitudes by reducing disengagement. However, the relationship between ethical leadership and disengagement was moderated by co-worker social undermining, such that when undermining was higher, the significance of the mediated relationships disappeared. These results suggest that while ethical leaders can promote positive employee attitudes, their effectiveness is reduced in situations where co-worker undermining exists. (shrink)

In this paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved.

We give a new characterization of the class of completely representable cylindric algebras of dimension 2 #lt; n ≤ w via special neat embeddings. We prove an independence result connecting cylindric algebra to Martin's axiom. Finally we apply our results to finite-variable first order logic showing that Henkin and Orey's omitting types theorem fails for Ln, the first order logic restricted to the first n variables when 2 #lt; n#lt;w. Ln has been recently (and quite extensively) studied as a many-dimensional (...) modal logic. (shrink)

We prove that the existence of atomic models for countable atomic theories does not hold for Ln the first order logic restricted to n variables for finite n > 2. Our proof is algebraic, via polyadic algebras. We note that Lnhas been studied in recent times as a multi-modal logic with applications in computer science. 2000 MATHEMATICS SUBJECT CLASSIFICATION. 03C07, 03G15.