bluuebunny/crossref_metadata_2025 huggingface dataset:
Improvement in Sensitivity of Live Cell-Based Sensor Cells by Co-Transfection of a Reporter Gene Driven by a Modified HSP70B' and HSF1 Expression Vector
Authors: Wada Ken-Ichi , Okuda-Shimazaki Junko , Taniguchi Akiyoshi
Published: December 2007

We previously reported that live cells transfected with a luciferase construct carrying the HSP70B' gene promoter
increases the luciferase activity in response to toxic reagents and can be used as an intelligent cytotoxicity sensor
device (i.e., sensor cells). In the present study, in order to improve the sensitivity of these cytotoxic sensor cells, we cotransfected
the sensor cells with both the luciferase construct carrying the HSP70B' gene promoter (pMCREx3) and an
HSF1 expression vector driven by a modified HSP70B’ promoter (pCRE/HSF). Cells co-transfected with pMCREx3 and
pCRE/HSF showed 2.5 times higher sensitivity for CdCl2 cytotoxicity than cells transfected with pMCREx3 alone, indicating
that sensor cells co-transfected in this way are useful and sensitive tools with which to detect a cytotoxic response.
Thermotolerant Zymomonas mobilis: Comparison of Ethanol Fermentation
Capability with that of an Efficient Type Strain
Authors: Sootsuwan Kaewta , Irie Akira , Murata Masayuki , Lertwattanasakul Noppon , Thanonkeo Pornthap , Yamada Mamoru
Published: December 2007

Zymomonas mobilis is an alternative microorganism to Saccharomyces cerevisiae for ethanol production. To
find a thermotolerant Z. mobilis strain, the growth and ethanol production of four isolates in Thailand were compared with
those of the efficient strain ZM4 (NRRL B-14023) at different temperatures. One of the selected strains, TISTR 405, was
found to grow and produce ethanol even at 39°C to an extent similar to that at 30°C, and the growth and ethanol productivity
at 39°C were better than those of ZM4 at 30°C, suggesting that TISTR 405 is suitable for ethanol fermentation at
high temperatures. Analysis of genes directly related to ethanol formation or degradation, adhA, adhB and pdc, encoding
alcohol dehydrogenase (Adh) A, AdhB and pyruvate decarboxylase, respectively, revealed that these genes were highly
conserved in both strains. Comparison of their gene expression and activity of the products in both TISTR 405 and ZM4
at different temperatures or growth phases indicated that there was not a great difference at the transcriptional level, but
the total activity of AdhA and AdhB in TISTR 405 was higher than that in ZM4. Both strains showed a significant increase
in AdhB activity in the stationary phase.
A Mini Axial and a Permanent Maglev Radial Heart Pump§
Authors: Qian Kun-Xi , Ru Wei-Min , Wang Hao , Jing Teng
Published: December 2007

The implantability and durability have been for decades the focus of artificial heart R&D. A mini axial and a maglev radial pump have been developed to meet with such requirements.

The mini axial pump weighing 27g (incl.5g rotor) has an outer diameter of 21mm and a length of 10mm in its largest point, but can produce a maximal blood flow of 6l/min with 50mmHg pressure increase. Therefore, it is suitable for the patients of 40-60kg body weight. For other patients of 60-80kg or 80-100kg body weight, the mini axial pumps of 23mm and 25mm outer diameter had been developed before, these devices were acknowledged to be the world smallest LVADs by Guinness World Record Center in 2004.

The permanent maglev radial pump weighing 150g is a shaft-less centrifugal pump with permanent magnetic bearings developed by the author. It needs no second coil for suspension of the rotor except the motor coil, different from all other maglev pumps developed in USA, Japan, European, etc. Thus no detecting and controlling systems as well as no additional power supply for maglev are necessary. The pump can produce a blood flow up to as large as 10l/min against 100mmHg pressure.

An implantable and durable blood pump will be a viable alternative to natural donor heart for transplantation.
In Vivo and In Vitro Assessment of Human Saphenous Vein Wall Changes
Authors: Asbeutah Akram M , Asfar Sami K , Safar Hussain , Oriowo Mabayoje A , ElHagrassi Ihab , Abu-Assi Mona A , Cameron James D , McGrath Barry P
Published: December 2007

Purpose: To investigate if noradrenaline (NA) and 5-hydroxyptamine (5-HT) drugs induce responses of isolated control and varicose veins are altered by removal of the endothelium.

Subjects & Methods: Specimens of the great saphenous vein (GSV) were obtained from 12 subjects with primary varicose veins and 12 subjects from donor vessels at cardiac surgery. A total of 10 normal healthy volunteers were selected for comparison. The diameter changes of GSV during the resting phase, at the end of 5 minutes occlusion, and then every 30 seconds post deflation for five minutes were measured using B-mode ultrasound. Post-surgery the vein sample was collected in a tube of Krebs-Henseleit solution.

Results: The repeated measure ANOVA test for the diameter, percent, and difference changes of GSV diameter from maximum diameter at different time intervals showed significance difference within and between all groups. NA and 5-HT produced concentration-dependent contractions of control and varicose saphenous vein segments. There was no significant difference in the potency of NA and for 5-HT, but the maximum response, normalized for tissue weight, was less in varicose vein segments. Removal of the endothelium had no effect on the potency of NA or 5-HT but significantly (p<0.05) reduced the maximum response to NA and 5-HT in varicose vein segments but not to 5-HT in control veins.

Conclusion: The venous endothelial damage may cause vascular smooth muscle contractions dysfunction that favours dilatation and secondary valvular insufficiency.
2-Exp Time lower bounds for propositional dynamic logics with intersection
Authors: Lange Martin , Lutz Carsten
Published: December 2007

In 1984. Danecki proved that satisfiability in IPDL, i.e., Propositional Dynamic Logic (PDL) extended with an intersection operator on programs, is decidabie in deterministic double exponential time. Since then, the exact complexity of IPDL has remained an open problem: the best known lower bound was the ExpTime one stemming from plain PDL until, in 2004. the first author established ExpSpace-hardness. In this paper, we finally close the gap and prove that IPDL is hard for 2-ExpTime. thus 2-ExpTime-complete. We then sharpen our lower bound, showing that it even applies to IPDL without the test operator interpreted on tree structures.
Induction and inductive definitions in fragments of second order arithmetic
Authors: Aehlig Klaus
Published: December 2007

A fragment with the same provably recursive functions as n iterated inductive definitions is obtained by restricting second order arithmetic in the following way. The underlying language allows only up to n + 1 nested second order quantifications and those are in such a way. that no second order variable occurs free in the scope of another second order quantifier. The amount of induction on arithmetical formulae only affects the arithmetical consequences of these theories, whereas adding induction for arbitrary formulae increases the strength by one inductive definition.
Elimination of imaginaries in expansions of o-minimal structures by generic sets
Authors: Fratarcangeli Sergio
Published: December 2007

LetTPbe the theory obtained by adding a generic predicate to an o-minimal theoryT. We prove that ifTadmits elimination of imaginaries, thenTPalso admits elimination of imaginaries.
A note on orthogonality and stable embeddedness
Authors: Cherlin Gregory , Djordjevic Marko , Hrushovskj Ehud
Published: December 2007

Orthogonality between two stably embedded definable sets is preserved under the addition of constants.
An alternative semantics for quantified relevant logic
Authors: Mares Edwin D. , Goldblatt Robert
Published: December 2007

The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀x(A ⋁ B) → (A ⋁ ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.
Iterates of the core model
Authors: Schindler Ralf
Published: December 2007

LetNbe a transitive model of ZFC such that “N⊂NandP(ℝ) ⊂N. Assume that bothVandNsatisfy “the core modelKexists.” ThenKNis an iterate ofK, i.e., there exists an iteration treeFonKsuch thatFhas successor length and. Moreover, if there exists an elementary embedding π:V→Nthen the iteration map associated to the main branch ofFequals π յK. (This answers a question of W. H. Woodin, M. Gitik, and others.) The hypothesis thatP(ℝ) ⊂Nis not needed if there does not exist a transitive model of ZFC with infinitely many Woodin cardinals.
Structure with fast elimination of quantifiers
Authors: Prunescu Mihai
Published: December 2007

A structure of finite signature is constructed so that: for all existential formulas and for all tuples of elements of the same length as the tuple one can decide in a quadratic time depending only on the length of the formula, if holds in the structure. In other words, the structure satisfies the relativized model-theoretic version of P=N P in the sense of [4]. This is a model-theoretical approach to results of Hemmerling and Gaßner.
Bounded modified realizability
Authors: Ferreira Fernando , Nunes Ana
Published: December 2007

We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The novel form of realizability supports a very general form of the FAN theorem, refutes Markov's principle but meshes well with some classical principles, including the lesser limited principle of omniscience and weak König's lemma. We discuss some applications, as well as some previous results in the literature.
Complexity, decidability and completeness
Authors: Cenzer Douglas , Remmel Jeffrey B.
Published: December 2007

We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory has an exponential time (EXPTIME) complete consistent extension whereas there is a nondeterministic polynomial time (NP) decidable theory which has no polynomial time complete consistent extension when length is measured relative to the binary representation of natural numbers and formulas. It is well known that a propositional theory is axiomatizable (respectively decidable) if and only if it may be represented as the set of infinite paths through a computable tree (respectively a computable tree with no dead ends). We show that any polynomial time decidable theory may be represented as the set of paths through a polynomial time decidable tree. On the other hand, the statement that every polynomial time decidable tree represents the set of complete consistent extensions of some theory which is polynomial time decidable, relative to the tally representation of natural numbers and formulas, is equivalent to P = NP. For predicate logic, we develop a complexity theoretic version of the Henkin construction to prove a complexity theoretic version of the Completeness Theorem. Our results imply that that any polynomial space decidable theory Δ possesses a polynomial space computable model which is exponential space decidable and thus Δ has an exponential space complete consistent extension. Similar results are obtained for other notions of complexity.
Determinacy for games ending at the first admissible relative to the play
Authors: Neeman Itay
Published: December 2007

Let o(k) denote the Mitchell order of k. We show how to reduce long games which run to the first ordinal admissible in the play, to iteration games on models with a cardinal k so that (1) k is a limit of Woodin cardinals: and (2) o(k) = k++. We use the reduction to derive several optimal determinacy results on games which run to the first admissible in the play.
The proper forcing axiom and the singular cardinal hypothesis
Authors: Viale Matteo
Published: December 2007

We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].
Every countably presented formal topology is spatial, classically
Authors: Valentini Silvio
Published: December 2007

By using some classical reasoning we show that any countably presented formal topology, namely, a formal topology with a countable axiom set, is spatial.
Enumerations of the Kolmogorov function
Authors: Beigel Richard , Buhrman Harry , Fejer Peter , Fortnow Lance , Grabowski Piotr , Longpré Luc , Muchnik Andrej , Stephan Frank , Torenvliet Leen
Published: December 2007

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n. h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.
Strongly minimal groups in the theory of compact complex spaces
Authors: Aschenbrenner Matthias , Moosa Rahim , Scanlon Thomas
Published: December 2007

We characterise strongly minimal groups interpretable in elementary extensions of compact complex analytic spaces.
Shelah's categoricity conjecture from a successor for tame abstract elementary classes
Authors: Grossberg Rami , Vandieren Monica
Published: December 2007

We prove a categoricity transfer theorem for tame abstract elementary classes.

Suppose thatKis a χ-tame abstract elementary class and satisfies the amalgamation and joint embedding properties and has arbitrarily large models. Letλ ≥ Max{χ, LS(K+}.If K is categorical in λ and λ+, then K is categorical in λ++.

Combining this theorem with some results from [37]. we derive a form of Shelah's Categoricity Conjecture for tame abstract elementary classes:

Suppose K is χ-tame abstract elementary class satisfying the amalgamation and joint embedding properties. Letμ0≔ Hanf(K).Ifand K is categorical in somethen K is categorical in μ for allμ.
0-D-valued fields
Authors: Guzy Nicolas
Published: December 2007

In [12]. T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theorem in a different language which was introduced by F. Delon in her thesis. This language allows us to lift the quantifier elimination result to a one-sorted language by a process described in the Appendix. As a byproduct, we state and prove a “positivstellensatz” theorem for the differential analogue of the theory of real-series closed fields in the valued D-field setting.
On the degeneracy of the full AGM-theory of theory-revision
Authors: Tennant Neil
Published: December 2007

A general method is provided whereby bizarre revisions of consistent theories with respect to contingent sentences that they refute can be delivered by revision-functions satisfying both the basic and the supplementary postulates of the AGM-theory of theory-revision.
The proof-theoretic analysis of transfinitely iterated quasi least fixed points
Authors: Probst Dieter
Published: December 2007

The starting point of this article is an old question asked by Feferman in his paper on Hancock's conjecture [6] about the strength of . This theory is obtained from the well-known theory ID1 by restricting fixed point induction to formulas that contain fixed point constants only positively. The techniques used to perform the proof-theoretic analysis of also permit to analyze its transfinitely iterated variants . Thus, we eventually know that
The complexity of analytic tableaux
Authors: Arai Noriko H. , Pitassi Toniann , Urquhart Alasdair
Published: December 2007

The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial.
Finite satisfiability and ℵ0-categorical structures with trivial dependence
Authors: Djordjević Marko
Published: December 2007

The main subject of the article is the finite submodel property for ℵ0-categorical structures, in particular under the additional assumptions that the structure is simple, 1-based and has trivial dependence. Here, a structure has the finite submodel property if every sentence which is true in the structure is true in a finite substructure of it. It will be useful to consider a couple of other finiteness properties, related to the finite submodel property, which are variants of the usual concept of saturation.

For the rest of the introduction we will assume that M is an ℵ0-categorical (infinite) structure with a countable language. We also assume that there is an upper bound to the arity of the function symbols in M:s language and that, for every 0 < n < ℵ0 and R ⊆ Mn which is definable in M without parameters, there exists a relation symbol, in the language of M, which is interpreted as R; these assumptions are not necessary for most results to be presented, but it simplifies the statement of a result which I mention in this introduction.

First we will consider ‘canonically embedded’ substructures of Meq. Here, a structure N is canonically embedded in Meq if N's universe is a subset of Meq which is definable without parameters and, for every 0 < n < ℵ0 and R ⊆ Nn which is ε-definable in Meq there is a relation symbol in the language of N which is interpreted as R; we also assume that the language of N has no other relation (or function or constant) symbols.
n–localization property
Authors: Rosłanowski Andrzej
Published: December 2007

This paper is concerned with n–localization property introduced by Newelski and Roslanowski in [10] and getting it for CS iterations of forcing notions.
Univers positifs
Authors: Poizat Bruno
Published: December 2007

We define elementary extension and elementary equivalence in Positive Logic.
Counterexamples to the unique and cofinal branches hypotheses
Authors: Neeman Itay , Steel John
Published: December 2007

We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than) the existence of a cardinal which is strong past a Woodin cardinal.
Universal spaces for classes of scattered eberlein compact spaces
Authors: Bell Murray , Marciszewski Witold
Published: December 2007

We discuss the existence of universal spaces (either in the sense of embeddings or continuous images) for some classes of scattered Eberlein compacta. Given a cardinal κ, we consider the class δκof all scattered Eberlein compact spaces K of weight ≤ κ and such that the second Cantor-Bendixson derivative of K is a singleton. We prove that if κ is an uncountable cardinal such that κ = 2≤κ, then there exists a space X in δκ such that every member of δκ is homeomorphic to a retract of X. We show that it is consistent that there does not exist a universal space (either by embeddings or by mappings onto) in . Assuming that = ω1, we prove that there exists a space X ∈ which is universal in the sense of embeddings. We also show that it is consistent that there exists a space X bΕ, universal in the sense of embeddings, but δω1 does not contain an universal element in the sense of mappings onto.
On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy
Authors: Yang Yue , Yu Liang
Published: December 2007

We show that the structure of recursively enumerable degrees is not a Σ1-elementary substructure of , where (n > 1) is the structure of n-r.e. degrees in the Ershov hierarchy.
Degrees of monotone complexity
Authors: Calhoun William C.
Published: December 2007

Levin and Schnorr (independently) introduced the monotone complexity, Km (α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2ω by α ≤Km β iff there is a constant c such that Km(α | n) ≤ Km(β | n)+ c for all n. The monotone degree of α is the set of all β such that α Km β and β Km α. We show the monotone degrees contain an antichain of size , a countable dense linear ordering (of degrees of cardinality ), and a minimal pair.

Downey, Hirschfeldt, LaForte, Nies and others have studied a similar structure, the K-degrees, where K is the prefix-free Kolmogorov complexity. A minimal pair of K-degrees was constructed by Csima and Montalban. Of particular interest are the noncomputable trivial reals, first constructed by Solovay. We defineareal to be (Km,K)-trivial if for some constant c, Km(α | n) ≤ K(n) + c for all n. It is not known whether there is a Km-minimal real, but we show that any such real must be (Km,K)-trivial.

Finally, we consider the monotone degrees of the computably enumerable (c.e.) and strongly computably enumerable (s.c.e.) reals. We show there is no minimal c.e. monotone degree and that Solovay reducibility does not imply monotone reducibility on the c.e. reals. We also show the s.c.e. monotone degrees contain an infinite antichain and a countable dense linear ordering.
A polarized partition relation for weakly compact cardinals using elementary substructures
Authors: Jones Albin L.
Published: December 2007

We show that if κ is a weakly compact cardinal, then

for any ordinals α < κ+ and μ < κ, and any finite ordinals m and n. This polarized partition relation represents the statement that for any partition

of κ × κ+ into m + μ pieces either there are A ∈ [κ]κ, B ∈ [κ]+]α and i < m with A × B ⊆ Ki or there are C ∈ [κ]κ, , and j < μ with C × D ⊆ Lj. Related results for measurable and almost measurable κ are also investigated. Our proofs of these relations involve the use of elementary substructures of set models of large fragments of ZFC.
Corrigendum to: ‘A constructive view on ergodic theorems’
Authors: Spitters Bas
Published: December 2007

Jeremy Avigad kindly pointed out to me that the proof of Theorem 2 in [3] is incomplete. At the very end it assumes that when is located, so is . This is not correct. In fact, Avigad explained that the construction in the proof of Theorem 15.3 in [1] can be read as a recursive counterexample to the statement: ‘If , then Anx converges for every x’. As a result the conclusion of Theorem 2 should be that An converges if and only if is located. Similar changes have to be made in the abstract, Lemma 4, and Theorem 16. Finally, the paragraph on ergodic measure preserving transformations should be removed.

As an unrelated point we would like to mention that in the last two displayed equations of the proof of theorem 1 the term should be replaced by .
On finite approximations of topological algebraic systems
Authors: Glebsky L. Yu. , Gordon E. I. , Henson C. Ward
Published: December 2007

We introduce and discuss a concept of approximation of a topological algebraic systemAby finite algebraic systems from a given class. IfAis discrete, this concept agrees with the familiar notion of alocal embeddingofAin a classof algebraic systems. One characterization of this concept states thatAis locally embedded iniff it is a subsystem of an ultraproduct of systems from. In this paper we obtain a similar characterization of approximability of a locally compact systemAby systems fromusing the language of nonstandard analysis.

In the signature ofAwe introducepositive boundedformulas and theirapproximations;these are similar to those introduced by Henson [14] for Banach space structures (see also [15, 16]). We prove that a positive bounded formula φ holds inAif and only if all precise enough approximations of φ hold in all precise enough approximations ofA.

We also prove that a locally compact field cannot be approximated arbitrarily closely by finite (associative) rings (even if the rings are allowed to be non-commutative). Finite approximations of the field ℝ can be considered as possible computer systems for real arithmetic. Thus, our results show that there do not exist arbitrarily accurate computer arithmetics for the reals that are associative rings.
Type-definable and invariant groups in o-minimal structures
Authors: Maříková Jana
Published: December 2007

Let M be a big o-minimal structure and G a type-definable group in Mn. We show that G is a type-definable subset of a definable manifold in Mn that induces on G a group topology. If M is an o-minimal expansion of a real closed field, then G with this group topology is even definably isomorphic to a type-definable group in some Mk with the topology induced by Mk. Part of this result holds for the wider class of so-called invariant groups: each invariant group G in Mn has a unique topology making it a topological group and inducing the same topology on a large invariant subset of the group as Mn.
Non-branching degrees in the Medvedev lattice of Π10 classes
Authors: Alfeld Christopher P.
Published: December 2007

A class is the set of paths through a computable tree. Given classes P and Q, P is Medvedev reducible to Q, P ≤MQ, if there is a computably continuous functional mapping Q into P. We look at the lattice formed by subclasses of 2ω under this reduction. It is known that the degree of a splitting class of c.e. sets is non-branching. We further characterize non-branching degrees, providing two additional properties which guarantee non-branching: inseparable and hyperinseparable. Our main result is to show that non-branching iff inseparable if hyperinseparable if homogeneous and that all unstated implications do not hold. We also show that inseparable and not hyperinseparable degrees are downward dense.
A question of van den Dries and a theorem of Lipshitz and Robinson; Not everything is standard
Authors: Hrushovski Ehud , Peterzil Ya'acov
Published: December 2007

We use a new construction of an o-minimal structure, due to Lipshitz and Robinson, to answer a question of van den Dries regarding the relationship between arbitrary o-minimal expansions of real closed fields and structures over the real numbers. We write a first order sentence which is true in the Lipshitz-Robinson structure but fails in any possible interpretation over the field of real numbers.
Completeness of MLL proof-nets w.r.t. weak distributivity
Authors: Joinet Jean-Baptiste
Published: December 2007

We examine ‘weak-distributivity’ as a rewriting rule defined on multiplicative proofstructures (so, in particular, on multiplicative proof-nets: MLL). This rewriting does not preserve the type of proof-nets, but does nevertheless preserve their correctness. The specific contribution of this paper, is to give a direct proof of completeness for : starting from a set of simple generators (proof-nets which are a n-ary ⊗ of Ց-ized axioms), any mono-conclusion MLL proof-net can be reached by rewriting (up to ⊗ and Ց associativity and commutativity).
Red fields
Authors: Baudisch A. , Martin-Pizarro A. , Ziegler M.
Published: December 2007

We apply Hrushovski-Fraïsseé's amalgamation procedure to obtain a theory of fields of prime characteristic of Morley rank 2 equipped with a definable additive subgroup of rank 1.
The logic of interactive turing reduction
Authors: Japaridze Giorgi
Published: December 2007

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic reduction. This concept — more precisely, the associated concept of reducibility — is a generalization of Turing reducibility from the traditional, input/output sorts of problems to computational tasks of arbitrary degrees of interactivity.
Simplicial structures in MV-algebras and logic
Authors: Belluce L. P. , Di Nola A.
Published: December 2007

Classical logic, as is well known, can be analyzed in a great part by algebraic methods using the Lindenbaum algebra obtained from the formal system. For example the completeness theorem for this logic becomes equivalent to the semisimplicity of the obtained Lindenbaum algebra.

Since Chang [4, 5], Łukasiewicz logic has also been analyzed algebraically through the associated Lindenbaum type algebra, that is the algebra of equivalence classes obtained from the relation of provable equivalence. In this case this algebra is an MV-algebra [4]. Once again logical notions have an algebraic counterpart, for example, completeness relates strongly to semisimplicity [4, 5]. However, unlike the classical case where the algebras in question are Boolean and always semisimple, not all MV-algebras are semisimple. This fact, in a sense, enriches the theory of MV-algebras.

Now every MV-algebra can be considered a Lindenbaum type algebra, namely an algebra associated to Łukasiewicz logic with additional axioms. Thus we can carry over to any MV-algebra various logical notions such as (in) completeness, consistency, satisfiability, etc.

Two important logical notions are those of “formal consequence” and “semantical consequence”. The former just says that a wff α is deducible from a set of wff via the axioms and rules of inference, while the latter just says that every evaluation that “satisfies” all the members of also “satisfies” α.

Informally call these relations F, S respectively; consider them as binary relations, Fα and Sα.

Now the completeness theorem just states F = S. Thus we can talk about an MV-algebra being “complete” provided the associated relations F, S are equal.
Successor-invariant first-order logic on finite structures
Authors: Rossman Benjamin
Published: December 2007

We consider successor-invariant first-order logic (FO + succ)inv, consisting of sentences Φ involving an “auxiliary” binary relation S such that (, S1) ⊨ Φ ⇔ (, S2) ⊨ Φ for all finite structures and successor relations S1, S2 on . A successor-invariant sentence Φ has a well-defined semantics on finite structures with no given successor relation: one simply evaluates Φ on (, S) for an arbitrary choice of successor relation S. In this article, we prove that (FO + succ)inv is more expressive on finite structures than first-order logic without a successor relation. This extends similar results for order-invariant logic [8] and epsilon-invariant logic [10].
NP search problems in low fragments of bounded arithmetic
Authors: Krajíček Jan , Skelley Alan , Thapen Neil
Published: December 2007

We give combinatorial and computational characterizations of the NP search problems definable in the bounded arithmetic theories and .
Which structural rules admit cut elimination? An algebraic criterion
Authors: Terui Kazushige
Published: December 2007

Consider a general class of structural inference rules such as exchange, weakening, contraction and their generalizations. Among them, some are harmless but others do harm to cut elimination. Hence it is natural to ask under which condition cut elimination is preserved when a set of structural rules is added to a structure-free logic. The aim of this work is to give such a condition by using algebraic semantics.

We consider full Lambek calculus (FL), i.e., intuitionistic logic without any structural rules, as our basic framework. Residuated lattices are the algebraic structures corresponding to FL. In this setting, we introduce a criterion, called the propagation property, that can be stated both in syntactic and algebraic terminologies. We then show that, for any set ℛ of structural rules, the cut elimination theorem holds for FL enriched with ℛ if and only if ℛ satisfies the propagation property.

As an application, we show that any set ℛ of structural rules can be “completed” into another set ℛ*, so that the cut elimination theorem holds for FL enriched with ℛ*. while the provability remains the same.
Models of non-well-founded sets via an indexed final coalgebra theorem
Authors: van den Berg Benno , de Marchi Federico
Published: December 2007

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on finitely complete and cocomplete categories. As an instance of this result, we build the final coalgebra for the powerclass functor, in the context of a Heyting pretopos with a class of small maps. This is then proved to provide models for various non-well-founded set theories, depending on the chosen axiomatisation for the class of small maps.
Some results in polychromatic Ramsey theory
Authors: Abraham Uri , Cummings James , Smyth Clifford
Published: December 2007

Classical Ramsey theory(at least in its simplest form) is concerned with problems of the following kind: given a setXand a colouring of the set[X]nof unorderedn-tuples fromX, find a subsetY ⊆ Xsuch that all elements of[Y]nget the same colour. Subsets with this property are calledmonochromaticorhomogeneous, and a typical positive result in Ramsey theory has the form that whenXis large enough and the number of colours is small enough we can expect to find reasonably large monochromatic sets.

Polychromatic Ramsey theoryis concerned with a “dual” problem, in which we are given a colouring of[X]nand are looking for subsetsY ⊆ Xsuch that any two distinct elements of[Y]ngetdifferentcolours. Subsets with this property are calledpolychromaticorrainbow. Naturally if we are looking for rainbow subsets then our task becomes easier when there are many colours. In particular given an integerkwe say that a colouring isk-boundedwhen each colour is used for at mostkmanyn-tuples.

At this point it will be convenient to introduce a compact notation for stating results in polychromatic Ramsey theory. We recall that in classical Ramsey theory we writeto mean “every colouring of[κ]ninkcolours has a monochromatic set of order type α”. We will writeto mean “everyk-bounded colouring of[κ]nhas a polychromatic set of order type α”. We note that whenκis infinite andkis finite ak-bounded colouring will use exactlyκcolours, so we may as well assume thatκis the set of colours used.
Lower bounds for modal logics
Authors: Hrubeš Pavel
Published: December 2007

We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies ψ1, ψ2, … s.t. every K-proof of ψi must have a number of proof-lines exponential in terms of the size of ψi. The result extends, for the same sequence of K-tautologies, to the systems K4, Gödel–Löb's logic, S andS4. We also determine some speed-up relations between different systems of modal logic on formulas of modal-depth one.
Computable embeddings and strongly minimal theories
Authors: Chisholm J. , Knight J. F. , Miller S.
Published: December 2007

Here we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over ℚ, and ZS is the class of models of Th(ℤ, S). Similarly, we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0.
Broken English, Broken Bones? Mechanisms Linking Language Proficiency and Occupational Health in a Montreal Garment Factory
Authors: Premji Stéphanie , Messing Karen , Lippel Katherine
Published: December 2007

Language barriers are often cited as a factor contributing to ethnic inequalities in occupational health; however, little information is available about the mechanisms at play. The authors describe the multiple ways in which language influences occupational health in a large garment factory employing many immigrants in Montreal. Between 2004 and 2006, individual, semi-structured interviews were conducted with 15 women and 10 men from 14 countries of birth. Interviews were conducted in French and English, Canada's official languages, as well as in non-official languages with the help of colleague-interpreters. Observation within the workplace was also carried out at various times during the project. The authors describe how proficiency in the official languages influences occupational health by affecting workers' ability to understand and communicate information, and supporting relationships that can affect work-related health. They also describe workers' strategies to address communication barriers and discuss the implications of these strategies from an occupational health standpoint. Along with the longer-term objectives of integrating immigrants into the linguistic majority and addressing structural conditions that can affect health, policies and practices need to be put in place to protect the health and well-being of those who face language barriers in the short term.
The Right to Vacation: An International Perspective
Authors: Ray Rebecca , Schmitt John
Published: December 2007

This report reviews international vacation and holiday laws and finds that the United States is the only advanced economy that does not guarantee its workers any paid vacation or holidays. As a result, one in four U.S. workers do not receive any paid vacation or paid holidays. The lack of paid vacation and paid holidays in the United States is particularly acute for lower-wage and part-time workers, and for employees of small businesses. This report also includes a comparative appendix with information on paid leave and holiday laws in Australia, Austria, Belgium, Canada, Denmark, Finland, France, Germany, Greece, Ireland, Italy, Japan, the Netherlands, New Zealand, Norway, Portugal, Spain, Sweden, Switzerland, and the United Kingdom.
Shaping Public Policy and Population Health in the United States: Why is the Public Health Community Missing in Action?
Authors: Raphael Dennis
Published: December 2007

Renewed international interest in the structural determinants of health manifests itself in a focus on the social determinants of health and the public policy antecedents that shape their quality. This increased international interest in public policy in support of the structural determinants of health has had little traction in the United States. This should be surprising since the United States presents one of the worst population health profiles and public policy environments in support of health among wealthy developed nations. The U.S. position as a health status and policy outlier results from long-term institutional changes that are shaped by political, economic, and social forces. U.S. public health researchers' and workers' neglect of these structural and public policy issues conforms to the dominant ideological discourses that serve to justify these changes. The author presents some means by which public health researchers and workers can challenge these dominant discourses.
A Case with Euprolactinemic Galactorrhea Induced by Escitalopram
Authors: Gulsun Murat , Algul Ayhan , Semiz Umit Basar , Ates Mehmet Alpay , Doruk Ali , Ebrinc Servet , Basoglu Cengiz , Cetin Mesut
Published: December 2007

Endocrine and reproductive side effects of serotonergic antidepressants are uncommon and galactorrhea is only rarely mentioned among SSRI-related side effects. Perhaps through suppression of dopamine neurotransmission releasing prolactin from tonic inhibitor control of dopamine, serotonin-enhancing antidepressants may result in a rise in prolactin levels. However, we here describe a case of euprolactinemic galactorrhea induced by the SSRI escitalopram and discuss potential mechanisms of action.
Psychopathology and Clinical Features in an Italian Sample of Patients with Myofascial and Temporomandibular Joint Pain: Preliminary Data
Authors: Nifosi F. , Violato E. , Pavan C. , Sifari L. , Novello G. , Nardini L. Guarda , Manfredini D. , Semenzin M. , Pavan L. , Marini M.
Published: December 2007

Objective:

Aim of this study was to provide data on the relationships between psychopathological variables and temporomandibular disorders (TMD). Sixty-three TMD patients were investigated using clinical and anamnestical psychiatric informations and psychopathological measures.

Methods:

Three groups of TMD patients were recruited according to the Research Diagnostic Criteria for TMD guidelines: a group of patients presenting myofascial pain alone (RDC/TMD axis I group I), a group with temporomandibular joint (TMJ) pain alone (RDC/TMD axis I group IIIa, IIIb), and a group presenting both myofascial and TMJ pain. Two secondary groups were identified on the basis of the presence/absence of myofascial pain. The study design provided a psychiatric interview and psychometric assessment including the Symptom Check List-90-Revised (SCL-90-R), the Hamilton Depression Rating Scale (HDRS), and the Hamilton Anxiety Rating Scale (HARS).

Results:

-Psychiatric evaluation: Myofascial pain patients had higher scores for personal psychiatric history and a history of more frequent psychotropic drug use. -HDRS and HARS: The sample presented scores indicating mild depressive symptoms and moderate anxiety symptoms. -SCL-90-R: The global sample showed acute levels of psychological distress as measured by the GSI score (Global Severity Index). Myofascial pain patients scored higher than TMJ pain patients in the GSI ( p = .028), PAR (paranoia; p = .015), PSY (psychoticism; p = .032), and HOS (hostility; p = .034) subscales.

Conclusions:

TMD patients showed elevated levels of depression, somatization, and anxiety. These characteristics did not differ significantly between patients with myofascial or TMJ pain. Other specific psychopathological dimensions, detected with SCL-90-R, appeared to be closely associated to the myofascial component.
Primary Care Physicians' Discussion of Emotional Distress and Patient Satisfaction
Authors: Gross Revital , Brammli-Greenberg Shuli , Tabenkin Hava , Benbassat Jochanan
Published: December 2007

Objectives:

To assess: a) the prevalence and determinants of self-reported emotional distress in the Israeli population; b) the rate of self-reported discussion of emotional distress with family physicians; and c) the association between such discussions and patient satisfaction with care.

Method:

Design: Retrospective, cross-sectional survey that was conducted through structured telephone interviews in Hebrew, Arabic, and Russian. This study was part of a larger study assessing patients' perceptions of the quality of health services. Participants: A representative sample of 1,849 Israeli citizens aged 22 to 93 (response rate: 84%). Independent variables: Gender, age, ethnicity (spoken language), education, income, self-reported chronic disease, self-reported episode(s) of emotional distress during the last year, and having discussed emotional distress with the family physician. Outcome measure: satisfaction with care.

Results:

28.4% reported emotional distress and 12.5% reported discussion of emotional distress with a primary care physician in the past year. Logistic regression identified female gender, Arab ethnicity, low income, and chronic illness as independent correlates of emotional distress. These as well as Russian speakers and having experienced emotional distress during the past year were identified as independent correlates of discussion of emotional distress with the family physician. Patients who reported discussion of emotional distress with their family physician were significantly more satisfied with care.

Conclusions:

Encouraging physicians to detect and discuss emotional distress with their patients may increase patient satisfaction with care, and possibly also improve patients' well-being and reduce health care costs.
A comparative seasonal pollution assessment study on Ennore Estuary with respect to metal accumulation in the grey mullet, Mugil cephalus
Authors: Padmini E. , Geetha B.
Published: December 2007

Environmental pollution is currently a major concern due to unorganised and increased industrialization and urban development. In the Tamilnadu state of India, on the Bay of Bengal, lies the Ennore estuary, which is an important industrial centre. The main industries in the region include a fertilizer company, refineries, a rubber factory, paint industry and a thermal power station. Investigations into the seasonal pollution impacts on the distribution of various metals in the waters of the Ennore estuary, situated in North Chennai, Tamilnadu, India, and the concentrations of some of the toxic metals in the tissue of the grey mullet, Mugil cephalus L., inhabiting in the same estuary were conducted during the period of April 2004 to March 2006.

The results were compared to those of the Kovalam estuary, which is unpolluted. In the water at one sample site of the Ennore estuary, heavy metal concentrations ranged between: Pb 0.15-0.23, Hg 0.05-0.06, Cd 0.01-0.03, and Cr 3.33-1.093 ppm for summer and monsoon seasons, and were significantly related to the seasonal rains (p<0.01). In contrast, heavy metal concentrations in the Kovalam estuary ranged between: Pb 0.043-0.039, Hg non-detectable-0.001, Cd 0.01-0.098, and Cr 0.063-0.052 ppm, and were not significantly related to the rainy season. The metal concentrations found in the muscle tissues of Mugil cephalus L., at the same site on the Ennore estuary were: Fe 11.06 ±0.29, Zn 1.67 ±0.14, Cr 2.98 ±0.15, and Pb 1.26 ±0.11 ppm, which were also significantly related to season (p<0.01). The metal concentrations in fish inhabiting the Kovalam estuary were: Fe 2.17 ±0.15, Zn 0.42 ±0.05, Cr 0.63 ±0.04, and Pb 0.31 ±0.04, and showed no significant seasonal difference. The highest metal concentrations found in the tissues of the Ennore estuary fish which lead to the oxidative stress and shorten the lifespan of the fish are postulated to primarily result from anthropogenic activities and effluent discharge from the local industrial activities.
Osseous cyst‐like lesions in the feet of lame horses: Diagnosis by standing low‐field magnetic resonance imaging
Authors: Mair T. S. , Sherlock C. E.
Published: December 2007

Osseous cyst‐like lesions (OCLLs) were diagnosed by standing low‐field magnetic resonance (MR) imaging in 9 mature horses (age range 6–17 years). All horses had been subjected to a routine lameness evaluation (including standard foot radiographs) with no diagnosis being reached prior to MR imaging. The duration of lameness ranged from one month to one year. OCLLs were diagnosed in 12 feet. The site of the lesions included the distal phalanx in 11 feet (subchondral bone in 4, insertion of collateral ligaments of the distal interphalangeal joint in 4, insertion of the distal sesamoidean impar ligament in 3) and the subchondral bone of the distal aspect of the middle phalanx in one foot. OCLLs were characterised by discrete spherical or elliptical areas of high or intermediate signal in all MR sequences. In most cases the lesion was surrounded by a rim of bone with abnormally low signal.