bluuebunny/crossref_metadata_2025_split huggingface dataset:
Examining Fragments of the Quantified Propositional Calculus
Authors: Perron Steven 
Published: December 2008

AbstractWhen restricted to proving formulas, the quantified propositional proof system is closely related to the theorems of Buss's theory . Namely, has polynomial-size proofs of the translations of theorems of , and proves that is sound. However, little is known about when proving more complex formulas. In this paper, we prove a witnessing theorem for similar in style to the KPT witnessing theorem for . This witnessing theorem is then used to show that proves is sound with respect to formulas. Note that unless the polynomial-time hierarchy collapses is the weakest theory in the S2 hierarchy for which this is true. The witnessing theorem is also used to show that is p-equivalent to a quantified version of extended-Frege for prenex formulas. This is followed by a proof that Gi, p-simulates with respect to all quantified propositional formulas. We finish by proving that S2 can be axiomatized by plus axioms stating that the cut-free version of is sound. All together this shows that the connection between and does not extend to more complex formulas.
Closed Fragments of Provability Logics of Constructive Theories
Authors: Visser Albert 
Published: December 2008

AbstractIn this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the closed fragment of the provability logic of Heyting's Arithmetic plus Markov's Principle and Heyting's Arithmetic plus Primitive Recursive Markov's Principle.
Unary primitive recursive functions
Authors: Severin Daniel E. 
Published: December 2008

AbstractIn this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone. We reduce certain recursion schemes (mixed/pure iteration without parameters) and we characterize one-argument primitive recursive functions as the closure under substitution and iteration of certain optimal sets.
Measurable chromatic numbers
Authors: Miller Benjamin D. 
Published: December 2008

AbstractWe show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [ℕ]ℕ, although its Borel chromatic number is ℵ0. We also show that if add(null) = c, then the universally measurable chromatic number of every treeing of a measure amenable equivalence relation is at most three. In particular, this holds for “the” minimum analytic graph with uncountable Borel (and Baire measurable) chromatic number. In contrast, we show that for all κ Є6 (2, 3…..ℵ0, c), there is a treeing of E0 with Borel and Baire measurable chromatic number κ. Finally, we use a Glimm–Effros style dichotomy theorem to show that every basis for a non-empty initial segment of the class of graphs of Borel functions of Borel chromatic number at least three contains a copy of (ℝ<ℕ, ⊇).
Analytic and coanalytic families of almost disjoint functions
Authors: Kastermans Bart , Juris Steprāns  , Zhang Yi 
Published: December 2008

AbstractIfis an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable, no member of which is covered by finitely many functions from, there issuch that for allthere are infinitely many integersksuch thatf(k) = h(k). However ifV = Lthen there exists a coanalytic family of pairwise eventually different functions satisfying this strong maximality condition.
A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant
Authors: Poizat Bruno 
Published: December 2008

RésuméNous définissons une classe de suites de polynômes, calculés par des circuits de complexité polynomiale comprenant des additions, des soustractions. des multiplications et des sommations de Valiant. Nous montrons que cette classe est close pour la prise de la fonction-coefficient. définie au paragraphe 3 de cet article; nous en déduisons l'existence d'un circuit de complexité 72.n2, calculant le coefficient binomial de deux nombres de n chiffres, donnés en base 2. Il est par ailleurs facile de construire un circuit de complexité 17.n + 2 calculant la factorielle d'un nombre de n chiffres. La présence de 2.n sommations d'effet exponentiel dans chacun de ces circuits en affecte gravement l'intérêt pratique. II est peu probable, ou du moins peu souhaitable. qu'on puisse éliminer ces sommations sans explosion, car cela provoquerait la catastrophe cryptographique que redoutent tous les banquiers; néanmoins, nous ne savons pas séparer la classe définie ici de celle des suites de polynômes calculables en un nombre polynomial d'opérations arithmétiques. Cela n'a rien de surprenant, vu la très grande affinité qu'elle a avec la classe PSPACE: nous montrons en effet que cette classe est identique à la classe VPSPACE, définie antérieurement par Koiran et Perifel, qui apparaît ici sous une forme bien plus maniable que l'originale.
P-hierarchy on βω
Authors: Starosolski Andrzej 
Published: December 2008

AbstractWe classify ultrafilters on ω with respect to sequential contours (see [4]. [5]) of different ranks. In this way we obtain an ω1 sequence of disjoint classes. We prove that non-emptiness of for successor α ≥ 2 is equivalent to the existence of P-point. We investigate relations between P-hierarchy and ordinal ultrafilters (introduced by J. E. Baumgartner in [1]). we prove that it is relatively consistent with ZFC that the successor classes (for α ≥ 2) of P-hierarchy and ordinal ultrafilters intersect but are not the same.
Strongly unfoldable cardinals made indestructible
Authors: Johnstone Thomas A. 
Published: December 2008

AbstractI provide indestructibility results for large cardinals consistent with V = L, such as weakly compact, indescribable and strongly unfoldable cardinals. The Main Theorem shows that any strongly unfoldable cardinal κ can be made indestructible by <κ-closed, κ-proper forcing. This class of posets includes for instance all <κ-closed posets that are either κ−-c.c. or <κ-strategically closed as well as finite iterations of such posets. Since strongly unfoldable cardinals strengthen both indescribable and weakly compact cardinals, the Main Theorem therefore makes these two large cardinal notions similarly indestructible. Finally. I apply the Main Theorem to obtain a class forcing extension preserving all strongly unfoldable cardinals in which every strongly unfoldable cardinal κ is indestructible by <κ-closed, κ-proper forcing.
There exists an uncountable set of pretabular extensions of the relevant logic R and each logic of this set is generated by a variety of finite height
Authors: Swirydowicz Kazimierz 
Published: December 2008

AbstractIn Handbook of Philosophical Logic M. Dunn formulated a problem of describing pretabular extensions of relevant logics (cf. M. Dunn [1984], p. 211; M. Dunn, G. Restall [2002], p. 79). The main result of this paper is described in the title.
Combinatorial images of sets of reals and semifilter trichotomy
Authors: Tsaban Boaz , Zdomskyy Lyubomyr 
Published: December 2008

AbstractUsing a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the interrelations between these properties in ZFC and in the realm of the trichotomy axiom for upward closed families of sets of natural numbers. While it is now known that the answer to the Hurewicz 1927 problem is positive, it is shown here that semifilter trichotomy implies a negative answer to a slightly stronger form of this problem.
Splitting families and the Noetherian type of βω / ω
Authors: Milovich David 
Published: December 2008

AbstractExtending some results of Malykhin, we prove several independence results about base properties of βω / ω and its powers, especially the Noetherian type Nt(βω / ω), the least κ for which βω / ω has a base that is κ-like with respect to containment. For example, Nt(βω / ω) is at least s, but can consistently be ω1, c, c+, or strictly between ω1 and c. Nt(βω / ω) is also consistently less than the additivity of the meager ideal. Nt(βω / ω) is closely related to the existence of special kinds of splitting families.
Completeness and incompleteness for intuitionistic logic
Authors: Mccarty Charles 
Published: December 2008

AbstractWe call a logicregularfor a semantics when the satisfaction predicate for at least one of its nontheorems is closed under double negation. Such intuitionistic theories as second-order Heyting arithmeticHASand the intuitionistic set theoryIZFprove completeness for no regular logics, no matter how simple or complicated. Any extensions of those theories proving completeness for regular logics are classical, i.e., they derive thetertium non datur. When an intuitionistic metatheory features anticlassical principles or recognizes that a logic regular for a semantics is nonclassical, it proves explicitly that the logic is incomplete with respect to that semantics. Logics regular relative to Tarski, Beth and Kripke semantics form a large collection that includes propositional and predicate intuitionistic, intermediate and classical logics. These results are corollaries of a single theorem. A variant of its proof yields a generalization of the Gödel-Kreisel Theorem linking weak completeness for intuitionistic predicate logic to Markov's Principle.
Borel complexity of isomorphism between quotient Boolean algebras
Authors: Gao Su , Oliver Michael Ray 
Published: December 2008

In response to a question of Farah, “How many Boolean algebras are there?” [Far04], one of us (Oliver) proved that there are continuum-many nonisomorphic Boolean algebras of the form with I a Borel ideal on the natural numbers, and in fact that this result could be improved simultaneously in two directions:(i) “Borel ideal” may be improved to “analytic P-ideal”(ii) “continuum-many” may be improved to “E0-many”; that is, E0 is Borel reducible to the isomorphism relation on quotients by analytic P-ideals.See [Oli04].In [AdKechOO], Adams and Kechris showed that the relation of equality on Borel sets (and therefore, any Borel equivalence relation whatsoever) is Borel reducible to the equivalence relation of Borel bireducibility. (In somewhat finer terms, they showed that the partial order of inclusion on Borel sets is Borel reducible to the quasi-order of Borel reducibility.) Their technique was to find a collection of, in some sense, strongly mutually ergodic equivalence relations, indexed by reals, and then assign to each Borel set B a sort of “direct sum” of the equivalence relations corresponding to the reals in B. Then if B1, ⊆ B2 it was easy to see that the equivalence relation thus induced by B1 was Borel reducible to the one induced by B2, whereas in the opposite case, taking x to be some element of B / B2, it was possible to show that the equivalence relation corresponding to x, which was part of the equivalence relation induced by B1, was not Borel reducible to the equivalence relation corresponding to B2.
Π10 classes with complex elements
Authors: Binns Stephen 
Published: December 2008

AbstractAn infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every Y ⊆ ω there is an X in P such that X ≥wttY. We show that this is also equivalent to the class's being large in some sense. We give an example of how this result can be used in the study of scattered linear orders.
A continuity principle, a version of Baire's theorem and a boundedness principle
Authors: Ishihara Hajime , Schuster Peter 
Published: December 2008

AbstractWe deal with a restricted form WC-N′ of the weak continuity principle, a version BT′ of Baire's theorem, and a boundedness principle BD-N. We show, in the spirit of constructive reverse mathematics, that WC-N′, BT′ + ¬LPO and BD-N + ¬LPO are equivalent in a constructive system, where LPO is the limited principle of omniscience.
A model for a very good scale and a bad scale
Authors: Sinapova Dima 
Published: December 2008

AbstractGiven a supercompact cardinalκand a regular cardinalλ<κ, we describe a type of forcing such that in the generic extension the cofinality ofκisλ, there is a very good scale atκ, a bad scale atκ, and SCH atκfails. When creating our model we have great freedom in assigning the value of 2κ, and so we can make SCH hold or fail arbitrarily badly.
Prime models of computably enumerable degree
Authors: Epstein Rachel 
Published: December 2008

AbstractWe examine the computably enumerable (c.e.) degrees of prime models of complete atomic decidable (CAD) theories. A structure has degree d if d is the degree of its elementary diagram. We show that if a CAD theory T has a prime model of c.e. degree c, then T has a prime model of strictly lower c.e. degree b, where, in addition, b is low (b′ = 0′), This extends Csima's result that every CAD theory has a low prime model. We also prove a density result for c.e. degrees of prime models. In particular, if c and d are c.e. degrees with d < c and c not low2 (c″ > 0″), then for any CAD theory T, there exists a c.e. degree b with d < b < c such that T has a prime model of degree b, where b can be chosen so that b′ is any degree c.e. in c with d′ ≤ b′. As a corollary, we show that for any degree c with 0 < c < 0′, every CAD theory has a prime model of low c.e. degree incomparable with c. We show also that every CAD theory has prime models of low c.e. degree that form a minimal pair, extending another result of Csima. We then discuss how these results apply to homogeneous models.
A characterization of the δ20 hyperhyperimmune sets
Authors: Omanadze Roland Sh. , Sorbi Andrea 
Published: December 2008

AbstractLet A be an infinite set and let K be creative: we show that K ≤QA if and only if KA. (Here ≤Q denotes Q-reducibility, and is the subreducibility of ≤Q obtained by requesting that Q-reducibility be provided by a computable function f such that Wf(x) ∩ Wf(y) = ∅. if x ≠ y.) Using this result we prove that A is hyperhyperimmune if and only if no subset B of A is s-complete, i.e., there is no subset B of A such that ≤sB, where ≤s denotes s-reducibility, and denotes the complement of K.
Strictly positive measures on Boolean algebras
Authors: Džamonja Mirna , Plebanek Grzegorz 
Published: December 2008

AbstractWe investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable strictly positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the algebra satisfies that its space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA + ¬ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA + ¬ CH every atomless ccc Boolean algebra satisfies this stronger chain condition.
Power-collapsing games
Authors: Kurilić Miloš S. , Šobot Boris 
Published: December 2008

AbstractThe game is played on a complete Boolean algebra , by two players. White and Black, in κ-many moves (where κ is an infinite cardinal). At the beginning White chooses a non-zero element p ∈ . In the α-th move White chooses pα ∈ (0, p) and Black responds choosing iα ∈{0, 1}. White winsthe play iff . where and .The corresponding game theoretic properties of c.B.a.'s are investigated. So, Black has a winning strategy (w.s.) if κ ≥ π() or if contains a κ-closed dense subset. On the other hand, if White has a w.s., then κ ∈ . The existence of w.s. is characterized in a combinatorial way and in terms of forcing. In particular, if 2<κ = κ ∈ Reg and forcing by preserves the regularity of κ, then White has a w.s. iff the power 2κ is collapsed to κ in some extension. It is shown that, under the GCH, for each set S ⊆ Reg there is a c.B.a. such that White (respectively. Black) has a w.s. for each infinite cardinal κ ∈ S (resp. κ ∉ S). Also it is shown consistent that for each κ ∈ Reg there is a c.B.a. on which the game is undetermined.
Progressive Decline of Partial Pressure of Carbon dioxide and Bicarbonate levels in Arterial Blood of Pregnant Women
Authors: Sunyal Dipok Kumar , Amin Md Ruhul , Molla MH , Talukder MA Momen , Ahmed Abida , Begum Momotaj 
Published: January 2009

Â In the present study the partial pressure of carbon dioxide (PaCO2) and bicarbonate ion (HCO3-) in arterial blood was estimated in 32 women in Dhaka city. For this purpose a total 32 women subjects with age ranged from 25 years to 35 years without any recent history of respiratory diseases were selected and divided into 8 healthy non-pregnant women as control and 24 normal pregnant women as experimental group. Experimental group was further divided into 8 first trimester, 8 second trimester & 8 third trimester of pregnant women. The PaCO2 and HCO3- were estimated by using "Easy Blood Gas Auto Analyzer". The PaCO2 and HCO3- were estimated during the 1st, 2nd, 3rd trimesters of pregnant women and non-pregnant women. The mean of measured values of PaCO2 and HCO3-were analyzed statistically in relation to 1st, 2nd, 3rd trimesters of pregnant women & non-pregnant women. The PaCO2 and HCO3- were significantly lower in 1st trimester, 2nd trimester & 3rd trimester of pregnant women than that of non-pregnant women. There were no statistically significant difference of PaCO2 and HCO3- between the 1st trimester and 2nd trimester; between the 1st trimester and 3rd trimester; and between the 2nd trimester and 3rd trimester of pregnant women. It may be concluded that the causes of progressively decreased PaCO2 and HCO3- throughout the pregnancy were most likely to be due to effect of progesterone causing hyperventilation. Hyperventilation in pregnancy is due to hypersensitivity of respiratory centre. Due to hyperventilation, there is expelling out CO2 and HCO3- causing decreases PaCO2 and HCO3- during pregnancy. doi: 10.3329/jbsp.v3i0.1788 J Bangladesh Soc Physiol.2008 Dec;(3):13-16.
Anti-diarrhoeal and CNS Depressant Activity of Methanolic Extract of <i>Saccharum spontaneum</i> Linn.
Authors: Vhuiyan Md Mynol Islam , Biva Israt Jahan , Saha Moni Rani , Islam Muhammad Shahidul 
Published: January 2009

Preliminary phytochemical screening of the methanolic extract of the whole plant of Saccharum spontaneum Linn. (Family- Gramineae) revealed the presence of alkaloids, flavonoids, reducing sugar, tannins and saponins. The antidiarrhoeal activity of the extract (200 and 400 mg/kg) was assessed on experimental animal and a dose dependent decrease in the total number of faecal dropping was obsereved in castor oil induced diarrhoea in mice. The plant extract was also assessed for effect on the central nervous system (CNS) using a number of neuropharmacological experimental models in mice. The extract produced a dosedependent reduction of the onset and duration of pentobarbitone-induced hypnosis, reduction of locomotor and exploratory activities in the open field and hole cross tests. These results suggest that the extract possesses antidiarrhoeal and CNS depressant activity. Key Words: Saccharum spontaneum, Castor oil, Loperamide, Pentobarbitone. Â Â Â doi:10.3329/sjps.v1i1.1810 S. J. Pharm. Sci. 1(1&2): 63-68
Kant, Marx et la question de la morale
Authors: Collin Denis 
Published: December 2008

Marx, Kant and the Moral Question.	We have not to choose between Marx and Kant. Kant’s ethics is not an abstract thought to which one could oppose Marx’s practical thought. In addition, a normative dimension appears constantly in Marx’s works, legitimating the communist prospect, as an achievement and a liberation of mankind, forming an effective community. Lastly, the old historical materialism, conceived as both a scientific method of analysis and a teleological philosophy, cannot be accepted any more. The power of Marx’s scientific analysis invites us to reconsider the standards of justice and law in conformity with his emancipatory objectives.
La rationalité du religieux selon Max Weber
Authors: Boudon Raymond 
Published: December 2008

RéSUMé. — L’un des traits les plus frappants des écrits de Weber sur la religion, c’est la fréquence avec laquelle il emploie le mot rationalité. Cela résulte de son adhésion à la métathéorie fondant la méthode compréhensive. Elle pose que le sens pour un individu de ses croyances doit être interprété comme en étant la cause principale. La sociologie de la religion de Weber doit sa force à ce cadre théorique. Sa conception « rationnelle » des croyances religieuses n’implique pas que les croyances soient le produit du raisonnement. Mais, si elles sont transmises par la socialisation, elles doivent apparaître au sujet comme fondées pour être acceptées. Ces principes inspirent les pages de Weber sur la magie, l’animisme, les grandes religions, la diffusion du monothéisme, la théodicée ou le désenchantement du monde. Il y montre que la pensée religieuse est soucieuse de cohérence, attentive à la vérification et à la falsification du dogme par le réel. Il y développe un évolutionnisme complexe, expliquant les irréversibilités dont témoigne l’histoire des religions, mais évitant tout fatalisme. Il écarte toute psychologie des profondeurs et toute psychologie causaliste, la psychologie rationnelle étant la seule compatible avec la notion de « compréhension ». Il analyse l’évolution des idées religieuses en supposant qu’elle obéit aux mêmes mécanismes que l’évolution des idées juridiques, économiques ou scientifiques.
Sept dimensions du changement social
Authors: Forsé Michel 
Published: December 2008

RéSUMé. — En 1990, le groupe « Louis Dirn » avait dégagé soixante tendances de transformation de la société française pour la période 1965-1985. Une matrice avait été construite afin d’analyser systématiquement les relations causales entre ces tendances. Dix ans plus tard, les tendances ont été revues, afin de porter sur la période 1975-1995, et une nouvelle matrice a été construite. De la comparaison de ces deux matrices, il ressort une forte impression de stabilité. Sur la base d’une analyse de similitude, sept grands groupes de tendances se dégagent pour chaque période. Ils ne sont pas totalement identiques entre les deux dates, mais la logique d’ensemble se maintient. Outre les enseignements méthodologiques qui peuvent en être tirés, il en résulte que les transformations élémentaires de la société française s’agencent en un schéma global reflétant un certain équilibre.