Self is difficult to define because of its multiple, constitutive streams of functional existence. A more comprehensive and expanded definition of self is proposed. The standard bio-psycho-social model of psyche is expanded to biophysical-mental-social and existential self. The total human experience is better understood and explained by adding the existential component. Existential refers to l...

Query answering under existential rules — implications with existential quantifiers in the head — is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [Baget et al., 2010; 2011a]. Query answering is also decidable for description logics [Baader, 2003], which further allow disjunction and functionality constraints (assert that certain relations are ...

Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the Classic system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one...

This paper shows (1) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with negation, product, and existential types, (2) the undecidability of the typability problem in the domain-free polymorphic lambda calculus, and (3) the undecidability of the type checking and the typability problems in the domain-free lambda calculus with function and ...

We suggest a new formalization of the existential termination problem of logic programs under the PROLOG leftmost selection rule and depth-rst computation rule. First of all, we give a characterization of the problem in terms of occurrence sets, by proving that a hprogram; goali existentially terminates if and only if there exists a nite correct occurrence set. Then we show that in order to stu...

We study the following natural variation on the classical universality problem: given an automaton M of some type (DFA/NFA/PDA), does there exist an integer l ≥ 0 such that Σl ⊆ L(M)? The case of an NFA was an open problem since 2009. Here, using a novel and deep construction, we prove that the problem is NEXPTIME-complete, and the smallest such l can be doubly exponential in the number of stat...

Universal/existential quantifiers can be seen as generalization of logical conjunction/disjunction. The universal (existential) quantification of an open proposition is the conjunction (disjunction) of all its possible instantiations. In other words, conjunction (disjunction) is a special kind of universal (existential) quantification where the domain of the variable is restricted to the set of...

A structure M is pregeometric if the algebraic closure is a pregeometry in all M ′ elementarily equivalent to M . We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power of ω and d-minimal expansion of fields. Ultraproducts of pregeometric structures expanding a field, while not pregeometric in general, do have an unique exi...

Background and Objectives: Infertility, particularly female infertility, can threat women's psychological health. Spiritual health can play a significant role in increasing people's abilities especially in tough conditions. The aim of this study was to investigate the effect of psychotherapy on existential health in infertile women. Methods: The study population of this experimental controlled...

Background: Nurses' direct exposure to COVID-19 patients and resulting health anxiety can threaten their performance of human and moral duties. Materials and Methods: This work was a descriptive correlational study. The statistical population was all nurses working in the intensive care unit of COVID-19 patients in Ardabil hospitals in the 2021 year, from which 150 people were selected by con...