The results of an exploratory study examining the role of trust in stakeholder satisfaction are reported. Customers, stockholders, and employees of financial institutions were surveyed to identify management behaviors that lead to stakeholder satisfaction. The factors critical to satisfaction across stakeholder groups are the timeliness of communication, the honesty and completeness of the information and the empathy and equity of treatment by management.

Ethical controversy over transplantation of human fetal tissue has arisen because the source of tissue is induced abortions. Opposition to such transplants has been based on various arguments, including the following: rightful informed consent cannot be obtained for use of fetal tissue from induced abortions, and fetal tissue transplantation might result in an increase in the number of abortions. These arguments were not accepted by the National Institutes of Health (NIH) Human Fetal Tissue Transplantation Research Panel. The majority opinion of (...) the panel stated that abortion and fetal tissue use are entirely separate issues, and that tissue use is ethically acceptable because it can be morally insulated from the issue of abortion. In support of this view, panel members and others have replied to the arguments put forward by opponents of fetal tissue use. However, replies to the two arguments mentioned above have been unsatisfactory, and the shortcomings of those replies are identified herein. Examination of the arguments pro and con suggests that fetal tissue use cannot be completely insulated from the issue of abortion. Thus, in seeking an ethical justification for fetal tissue transplantation we must consider reasons other than those put forward by the NIH panel. In this paper it is argued that whatever wrong is involved in using fetal tissue from induced abortions must be balanced against the benefits for patients, and it is on this basis that fetal tissue transplantation can be ethically justified. (shrink)

Background: Physicians sometimes are asked by co-workers for prescriptions to deal with their medical problems. These “hallway” requests typically occur outside a formal doctor-patient relationship. There are professional guidelines on serving as physician for family members and friends, but no guidelines address writing prescriptions for co-workers. The frequency of these requests and the factors physicians consider in responding to them have not been examined.Objectives: To obtain data on the frequency of these requests and physicians’ attitudes and practices in responding to (...) them, and to explore the ethical considerations in writing prescriptions for co-workers.Design: A survey was administered to all physician faculty and residents in an academic department of internal medicine. The questions included whether the respondent had ever been asked for a prescription by a co-worker and how often the respondent had received such requests and written such prescriptions in the previous three months. Respondents also were asked to rate how likely they would be to write such a prescription in 15 hypothetical scenarios.Results: Of the 113 respondents who completed surveys, 68 percent reported having been asked for a prescription by a co-worker. Among those who had ever been asked, 59 percent had been asked one or more times during the previous three months and 88 percent had ever written such a prescription. Also, 88 percent of all respondents stated they were “very likely” or “likely” to write the prescription in one or more of the hypothetical scenarios.Conclusions: Most physicians in our sample had been asked for prescriptions by co-workers, and most had written such prescriptions. Many respondents indicated a willingness to write such prescriptions in a variety of scenarios, despite the absence of a formal doctor-patient relationship. Further discussion of the ethical considerations in writing prescriptions for co-workers is needed. (shrink)

Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with (...) common knowledge. Also, we show that the universal canonical model of $$\mathsf{PDL}$$ lacks the property of modal harmony, the analogue of the Truth lemma for modal operators. (shrink)

We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.

Chris Meek. Strong-Completeness and Faithfulness in Belief Networks.

In the topological semantics for modal logic, S4 is well-known to be complete for the rational line, for the real line, and for Cantor space: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete, but also strongly complete, for the rational line. But no similarly easy amendment is available for the real line or for Cantor space and (...) the question of strong completeness for these spaces has remained open, together with the more general question of strong completeness for any dense-in-itself metric space. In this paper, we prove that S4 is strongly complete for any dense-in-itself metric space. (shrink)

ABSTRACT In this paper we study consequence relations on the set of many sided sequents over a propositional language. We deal with the consequence relations axiomatized by the sequent calculi defined in [2] and associated with arbitrary finite algebras. These consequence relations are examples of what we call Gentzen systems. We define a semantics for these systems and prove a Strong Completeness Theorem, which is an extension of the Completeness Theorem for provable sequents stated in [2]. For (...) the special case of the finite linear MV-algebras, the Strong Completeness Theorem was proved in [10], as a consequence of McNaughton's Theorem. The main tool to prove this result for arbitrary algebras is the deduction-detachment theorem for Gentzen systems. (shrink)

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.

Strong completeness of S. Titani's system for lattice valued logic is shown by means of Dedekind cuts.

We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra.

In the topological semantics for modal logic, S4 is well known to be complete for the rational line and for the real line: these are special cases of S4’s completeness for any dense-in-itself metric space. The construction used to prove completeness can be slightly amended to show that S4 is not only complete but strongly complete, for the rational line. But no similarly easy amendment is available for the real line. In an earlier paper, we proved a general (...) theorem: S4 is strongly complete for any dense-in-itself metric space. Strong completeness for the real line is a special case. In the current paper, we give a proof of strong completeness tailored to the special case of the real line: the current proof is simpler and more accessible than the proof of the more general result and involves slightly different techniques. We proceed in two steps: first, we show that S4 is strongly complete for the space of finite and infinite binary sequences, equipped with a natural topology; and then we show that there is an interior map from the real line onto this space. (shrink)

The present work, which was inspired by Kripke and McCarthy, is about a non-classical predicate logic system containing a truth predicate symbol. In this system, each sentence A is referred to not by a Gödel number but by its quotation name 'A'.

independence facts implied by a particular directed acyclic graph; an alternative equivalent rule has been proposed by Lauritzen et al. (1990). Geiger et al. (1990) have shown that d-separation is atomic-complete for independence statements..

By using algebraic-categorical tools, we establish four criteria in order to disprove canonicity, strong completeness, w-canonicity and strong w-completeness, respectively, of an intermediate propositional logic. We then apply the second criterion in order to get the following result: all the logics defined by extra-intuitionistic one-variable schemata, except four of them, are not strongly complete. We also apply the fourth criterion in order to prove that the Gabbay-de Jongh logic D1 is not strongly w-complete.

The paper offers a formalization of reasoning about distributed multi-agent systems. The presented propositional probabilistic temporal epistemic logic |$\textbf {PTEL}$| is developed in full detail: syntax, semantics, soundness and strong completeness theorems. As an example, we prove consistency of the blockchain protocol with respect to the given set of axioms expressed in the formal language of the logic. We explain how to extend |$\textbf {PTEL}$| to axiomatize the corresponding first-order logic.

IPC, the intuitionistic predicate calculus, has the property(i) Vc(A c /x) xA.Furthermore, for certain important , IPC has the converse property (ii) xA Vc(A c /x). (i) may be given up in various ways, corresponding to different philosophic intuitions and yielding different systems of intuitionistic free logic. The present paper proves the strong completeness of several of these with respect to Kripke style semantics. It also shows that giving up (i) need not force us to abandon the analogue (...) of (ii). (shrink)

In [8] it is proved that all the intermediate logics axiomatizable by formulas in one variable, except four of them, are not strongly complete. We considerably improve this result by showing that all the intermediate logics axiomatizable by formulas in one variable, except eight of them, are not strongly ω-complete. Thus, a definitive classification of such logics with respect to the notions of canonicity, strong completeness, ω-canonicity and strong ω-completeness is given.

In, a deontic logic is proposed which explicates the idea that a formulaφis obligatory if and only if it is the weakest permission. We give a sound and strongly complete, Hilbert style axiomatization for this logic. As a corollary, it is compact, contradicting earlier claims from Anglbergeret al.. In addition, we prove that our axiomatization is equivalent to Anglberger et al.’s infinitary proof system, and show that our results are robust w.r.t. certain changes in the underlying semantics.

A classical result by Słupecki states that a logic L is functionally complete for the 3-element set of truth-values THREE if, in addition to functionally including Łukasiewicz’s 3-valued logic Ł3, what he names the ‘$T$-function’ is definable in L. By leaning upon this classical result, we prove a general theorem for defining binary expansions of Kleene’s strong logic that are functionally complete for THREE.

A strongly independent preorder on a possibly in finite dimensional convex set that satisfi es two of the following conditions must satisfy the third: (i) the Archimedean continuity condition; (ii) mixture continuity; and (iii) comparability under the preorder is an equivalence relation. In addition, if the preorder is nontrivial (has nonempty asymmetric part) and satisfi es two of the following conditions, it must satisfy the third: (i') a modest strengthening of the Archimedean condition; (ii') mixture continuity; and (iii') completeness. (...) Applications to decision making under conditions of risk and uncertainty are provided. (shrink)