Binary transitive closure logic (FO∗ for short) is the extension of first-order predicate logic by a transitive closure operator of binary relations. It is known that this logic is more powerful than FO on arbitrary structures and on finite ordered trees. It is also known that it is at most as powerful as monadic second-order logic (MSO) on arbitrary structures and on finite trees. We will stud...

BACKGROUND The aim of this review is to summarize the effects of krill oil (KO) or fish oil (FO) on eicosapentaenoic acid (EPA) and docosahexaenoic acid (DHA) incorporation in plasma phospholipids or membrane of red blood cells (RBCs) as shown in human and animal studies. Furthermore, we discuss the findings in relation to the possible different health effects, focusing on lipids, inflammatory ...

Many carcinogenic polycyclic aromatic hydrocarbons (PAHs) and their metabolites can bind covalently to DNA. Carcinogen-DNA adducts may lead to mutations in critical genes, eventually leading to cancer. In this study we report that fish oil (FO) blocks the formation of DNA adducts by detoxification of PAHs. B6C3F1 male mice were fed a FO or corn oil (CO) diet for 30 days. The animals were then t...

The present work aimed to study in rats whether substitution of a low level of fish oil (FO; 2.2% of calories) into a low-fat diet (6.6% of calories from fat as peanut-rape oil or control diet) 1) has a tissue-specific effect on insulin signaling pathway and 2) prevents dexamethasone-induced alteration of insulin signaling in liver, muscle, and adipose tissue. Sixteen rats were used for study o...

The mechanization of many verification tasks relies on efficient implementations of decision procedures for fragments of first-order logic. Interactive theorem provers like pvs also make use of such decision procedures to increase the level of automation. Our tool lira3 implements decision procedures based on automata-theoretic techniques for first-order logics with linear arithmetic, namely, f...

I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in sense that they do not increase its expressive power over sentences when added to it. show some dependencies, like totality, non-constancy and non-emptiness, all logics other constancy, FO(D) choices D despite being strongly first order (that is, FO(∅)). furthermore possibility operator ⋄ϕ, holds t...

We have previously demonstrated that a low dose of live myeloma FO cells induced a cellular immunity against tumor without additional modulating factors. In the present study, lyophilized myeloma FO cells were used to induce anti-tumor immunity. In a myeloma vaccination model, immunization with lyophilized myeloma FO cells alone induced a slight response. However, the immunity was dramatically ...

This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-order logic (MSO): in FO(R) one can demand that a node is reachably from another by some sequence of edges, whereas in FO(Reg) a regular set of allowed edge sequences can be given additionally. We study FO(Reg) logic in...