Log in

Relevant bibliographies by topics / Philosophy, n.e.c / Journal articles

Journal articles on the topic 'Philosophy, n.e.c'

To see the other types of publications on this topic, follow the link: Philosophy, n.e.c.

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Philosophy, n.e.c.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

TSAPROUNIS, KONSTANTINOS. "ON C(n)-EXTENDIBLE CARDINALS." Journal of Symbolic Logic 83, no. 3 (September 2018): 1112–31. http://dx.doi.org/10.1017/jsl.2018.31.

Full text

Abstract:

AbstractThe hierarchies of C(n)-cardinals were introduced by Bagaria in [1] and were further studied and extended by the author in [18] and in [20]. The case of C(n)-extendible cardinals, and of their C(n)+-extendibility variant, is of particular interest since such cardinals have found applications in the areas of category theory, of homotopy theory, and of model theory (see [2], [3], and [4], respectively). However, the exact relation between these two notions had been left unclarified. Moreover, the question of whether the Generalized Continuum Hypothesis (GCH) can be forced while preserving C(n)-extendible cardinals (for n1) also remained open. In this note, we first establish results in the direction of exactly controlling the targets of C(n)-extendibility embeddings. As a corollary, we show that every C(n)-extendible cardinal is in fact C(n)+-extendible; this, in turn, clarifies the assumption needed in some applications obtained in [3]. At the same time, we underline the applicability of our arguments in the context of C(n)-ultrahuge cardinals as well, as these were introduced in [20]. Subsequently, we show that C(n)-extendible cardinals carry their own Laver functions, making them the first known example of C(n)-cardinals that have this desirable feature. Finally, we obtain an alternative characterization of C(n)-extendibility, which we use to answer the question regarding forcing the GCH affirmatively.

APA, Harvard, Vancouver, ISO, and other styles

2

Garnica, Antonio Vicente Marafioti, Leandro Josué de Souza, and Maria Ednéia Martins Salandim. "On C. S. Peirce´s primary arithmetic." Revista Pesquisa Qualitativa 8, no. 18 (October 7, 2020): 454–77. http://dx.doi.org/10.33361/rpq.2020.v.8.n.18.340.

Full text

Abstract:

his paper presents the initial studies on Peirce´s Primary Arithmetic, a set of manuscripts, never published by the author, written at the end of the XIX century. The originals – organized and published by Carolyn Eisele in 1976 – was translated to Portuguese and some initial studies are being developed focusing on the possibility that some features of Peirce´s Philosophy could be pragmatically – but implicitly – present in such manuscripts. Our partial conclusions, now, show that Peirce´s life circumstances, more than his Philosophy, characterize the texts under examination. Keywords: Charles S. Peirce; Primary Arithmetic; Mathematics Education; History; Philosophy; Peirce´s Mathematical Writings.

APA, Harvard, Vancouver, ISO, and other styles

3

Tsaprounis, Konstantinos. "Elementary chains and C (n)-cardinals." Archive for Mathematical Logic 53, no. 1-2 (October 3, 2013): 89–118. http://dx.doi.org/10.1007/s00153-013-0357-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fremlin, D. H., and P. J. Nyikos. "Saturating ultrafilters on N." Journal of Symbolic Logic 54, no. 3 (September 1989): 708–18. http://dx.doi.org/10.2307/2274735.

Full text

Abstract:

AbstractWe discuss saturating ultrafilters on N, relating them to other types of non-principal ultrafilter. (a) There is an (ω, c)-saturating ultrafllter on N iff 2λ ≤ c for every λ < c and there is no cover of R by fewer than c nowhere dense sets, (b) Assume Martin's axiom. Then, for any cardinal κ, a nonprincipal ultrafllter on N is (ω, κ)-saturating iff it is almost κ-good. In particular, (i) p(κ)-point ultrafilters are (ω, κ)-saturating, and (ii) the set of (ω, κ)-saturating ultrafilters is invariant under homeomorphisms of βN/N. (c) It is relatively consistent with ZFC to suppose that there is a Ramsey p(c)-point ultrafilter which is not (ω, c)-saturating.

APA, Harvard, Vancouver, ISO, and other styles

5

Toohey, Jeanette M., and David Michaelis. "N. C. Wyeth: A Biography." Journal of American History 86, no. 3 (December 1999): 1363. http://dx.doi.org/10.2307/2568671.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shi, Yu, and David Waxman. "C. N. Yang on Teaching and Research in Physics." International Journal of Modern Physics A 31, no. 12 (April 28, 2016): 1630016. http://dx.doi.org/10.1142/s0217751x16300167.

Full text

Abstract:

This document is based on five conversations between Prof. C. N. Yang and others in Beijing in 1986. In the conversations, Yang gave his views on the state and development of physics at that time, and the relationship between physics and philosophy. The conversations also contain Yang’s reminiscences on the creation of Yang–Mills theory and his advice to young people, especially those in China.

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, D. Z. "C. N. Yang and contemporary mathematics." Mathematical Intelligencer 15, no. 4 (September 1993): 13–21. http://dx.doi.org/10.1007/bf03024319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kalimullin, I. S. "Elementary differences between the (2p)-C. E. and the (2p +1)-c. e. enumeration degrees." Journal of Symbolic Logic 72, no. 1 (March 2007): 277–84. http://dx.doi.org/10.2178/jsl/1174668395.

Full text

Abstract:

AbstractIt is proved that the (2p)-c. e. e-degrees are not elementarily equivalent to the (2p + 1)-c. e. e-degrees for each nonzero p ∈ ω. It follows that m-c. e. e-degrees are not elementarily equivalent to the n-c e. e-degrees if 1 <m < n.

APA, Harvard, Vancouver, ISO, and other styles

9

BAUWENS, B., and A. SHEN. "COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY." Journal of Symbolic Logic 79, no. 2 (June 2014): 620–32. http://dx.doi.org/10.1017/jsl.2014.15.

Full text

Abstract:

AbstractPéter Gács showed (Gács 1974) that for every n there exists a bit string x of length n whose plain complexity C(x) has almost maximal conditional complexity relative to x, i.e., $C\left( {C\left( x \right)|x} \right) \ge {\rm{log}}n - {\rm{log}}^{\left( 2 \right)} n - O\left( 1 \right)$ (Here ${\rm{log}}^{\left( 2 \right)} i = {\rm{loglog}}i$.) Following Elena Kalinina (Kalinina 2011), we provide a simple game-based proof of this result; modifying her argument, we get a better (and tight) bound ${\rm{log}}n - O\left( 1 \right)$ We also show the same bound for prefix-free complexity.Robert Solovay showed (Solovay 1975) that infinitely many strings x have maximal plain complexity but not maximal prefix complexity (among the strings of the same length): for some c there exist infinitely many x such that $|x| - C\left( x \right) \le c$ and $|x| + K\left( {|x|} \right) - K\left( x \right) \ge {\rm{log}}^{\left( 2 \right)} |x| - c{\rm{log}}^{\left( 3 \right)} |x|$ In fact, the results of Solovay and Gács are closely related. Using the result above, we provide a short proof for Solovay’s result. We also generalize it by showing that for some c and for all n there are strings x of length n with $n - C\left( x \right) \le c$ and $n + K\left( n \right) - K\left( x \right) \ge K\left( {K\left( n \right)|n} \right) - 3K\left( {K\left( {K\left( n \right)|n} \right)|n} \right) - c.$ We also prove a close upper bound $K\left( {K\left( n \right)|n} \right) + O\left( 1 \right)$Finally, we provide a direct game proof for Joseph Miller’s generalization (Miller 2006) of the same Solovay’s theorem: if a co-enumerable set (a set with c.e. complement) contains for every length a string of this length, then it contains infinitely many strings x such that$|x| + K\left( {|x|} \right) - K\left( x \right) \ge {\rm{log}}^{\left( 2 \right)} |x| - O\left( {{\rm{log}}^{\left( 3 \right)} |x|} \right).$

APA, Harvard, Vancouver, ISO, and other styles

10

Girard, Jean-Yves, and Dag Normann. "Embeddability of ptykes." Journal of Symbolic Logic 57, no. 2 (June 1992): 659–76. http://dx.doi.org/10.2307/2275298.

Full text

Abstract:

The notion of a ptyx (plural, ptykes) is obtained by generalising the ordinals On and the dilators Dil introduced by Girard [1] into a typed hierarchy. The notion is due to Girard, and a detailed treatment will appear in Girard [2].In this Introduction we will give a summary of the theory of ptykes. It will be an advantage to be familiar with the theory of dilators as introduced in Girard [1] or as presented in Girard and Normann [3].The class On of ordinals is organised into a category ON by using strictly increasing maps f: x → y as morphisms. A dilator will be a functor F: ON → ON commuting with pullbacks and direct limits. Associated with each dilator F there is a denotation system DF, obtained as follows: For each x ∈ On and y ∈ F(x), y can be given a unique denotation (c; x0,…, xn−1;x)F, where c∈F(n) (n = {0,…, n − 1}), y = F(ϕ)(c) (where ϕ is defined by ϕ(i) = xi for i < n), and for no m < n and ψ: m → n do we have c ∈ im(ψ).We let the trace Tr(F) be the set of pairs (c, n) occurring in a denotation.

APA, Harvard, Vancouver, ISO, and other styles

11

Heinrich, S., C. Ward Henson, and L. C. Moore. "A note on elementary equivalence of C(K) spaces." Journal of Symbolic Logic 52, no. 2 (June 1987): 368–73. http://dx.doi.org/10.2307/2274386.

Full text

Abstract:

In this paper we give a closer analysis of the elementary properties of the Banach spaces C(K), where K is a totally disconnected, compact Hausdorff space, in terms of the Boolean algebra B(K) of clopen subsets of K. In particular we sharpen a result in [4] by showing that if B(K1) and B(K2) satisfy the same sentences with ≤ n alternations of quantifiers, then the same is true of C(K1) and C(K2). As a consequence we show that for each n there exist C(K) spaces which are elementarily equivalent for sentences with ≤ n quantifier alternations, but which are not elementary equivalent in the full sense. Thus the elementary properties of Banach spaces cannot be determined by looking at sentences with a bounded number of quantifier alternations.The notion of elementary equivalence for Banach spaces which is studied here was introduced by the second author [4] and is expressed using the language of positive bounded formulas in a first-order language for Banach spaces. As was shown in [4], two Banach spaces are elementarily equivalent in this sense if and only if they have isometrically isomorphic Banach space ultrapowers (or, equivalently, isometrically isomorphic nonstandard hulls.)We consider Banach spaces over the field of real numbers. If X is such a space, Bx will denote the closed unit ball of X, Bx = {x ϵ X∣ ∣∣x∣∣ ≤ 1}. Given a compact Hausdorff space K, we let C(K) denote the Banach space of all continuous real-valued functions on K, under the supremum norm. We will especially be concerned with such spaces when K is a totally disconnected compact Hausdorff space. In that case B(K) will denote the Boolean algebra of all clopen subsets of K. We adopt the standard notation from model theory and Banach space theory.

APA, Harvard, Vancouver, ISO, and other styles

12

Moloney, James J. "An existence theorem for a special ultrafilter when 𝔡 = 𝔠." Journal of Symbolic Logic 58, no. 4 (December 1993): 1359–64. http://dx.doi.org/10.2307/2275148.

Full text

Abstract:

For an ultrafilter , consider the ultrapower NN/. 〈an〉/ is in the top sky of NN/ if there exists a sequence 〈bn〉 ∈ NN such thatandIn [M2] we showed, assuming the Continuum Hypothesis, that there are exactly 10 c/p's (where c is the ring of real convergent sequences and p is a prime ideal of c). To get the lower bound we showed that there will be at least 10 c/p's in any model of ZFC where there exist both of the following kinds of ultrafilter:(i) nonprincipal P-points,(ii) non-P-points such that when the top sky is removed from NN/, the remaining model has countable cofinality.In [M2] we showed that the Continuum Hypothesis implies the existence of the ultrafilter in (ii). In this paper we show that its existence is implied by an axiom weaker than the Continuum Hypothesis, in fact weaker than Martin's Axiom, namely,(*) If is a subset of NN such that for any f: N → N there exists g ∈ such that g(n) > f(n) for all n, then ∣∣ = .

APA, Harvard, Vancouver, ISO, and other styles

13

Murray, Jacqueline. "Religion and Devotion in Europe, c. 1215-c. 1515.R. N. Swanson." Speculum 73, no. 2 (April 1998): 603–5. http://dx.doi.org/10.2307/2887249.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

BROCKLYN, J. R., L. C. EDSALL, G. PIRIANOV, Z. OLAH, B. KLEUSER, O. CUVILLIER, A. OLIVERA, T. KOHAMA, R. MENZELEEV, and S. SPIEGEL. "N,N-Dimethylsphingosine Induces Apoptosis by Inhibiting Sphingosine Kinase but Not Protein Kinase C." Annals of the New York Academy of Sciences 845, no. 1 SPHINGOLIPIDS (June 1998): 427. http://dx.doi.org/10.1111/j.1749-6632.1998.tb09714.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Calhoun, William C. "Degrees of monotone complexity." Journal of Symbolic Logic 71, no. 4 (December 2006): 1327–41. http://dx.doi.org/10.2178/jsl/1164060458.

Full text

Abstract:

AbstractLevin 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.

APA, Harvard, Vancouver, ISO, and other styles

16

GREBÍK, JAN, and CARLOS UZCÁTEGUI. "BASES AND BOREL SELECTORS FOR TALL FAMILIES." Journal of Symbolic Logic 84, no. 1 (January 30, 2019): 359–75. http://dx.doi.org/10.1017/jsl.2018.66.

Full text

Abstract:

AbstractGiven a family${\cal C}$of infinite subsets of${\Bbb N}$, we study when there is a Borel function$S:2^{\Bbb N} \to 2^{\Bbb N} $such that for every infinite$x \in 2^{\Bbb N} $,$S\left( x \right) \in {\Cal C}$and$S\left( x \right) \subseteq x$. We show that the family of homogeneous sets (with respect to a partition of a front) as given by the Nash-Williams’ theorem admits such a Borel selector. However, we also show that the analogous result for Galvin’s lemma is not true by proving that there is an$F_\sigma $tall ideal on${\Bbb N}$without a Borel selector. The proof is not constructive since it is based on complexity considerations. We construct a${\bf{\Pi }}_2^1 $tall ideal on${\Bbb N}$without a tall closed subset.

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Yong, and Angsheng Li. "A hierarchy for the plus cupping Turing degrees." Journal of Symbolic Logic 68, no. 3 (September 2003): 972–88. http://dx.doi.org/10.2178/jsl/1058448450.

Full text

Abstract:

AbstractWe say that a computably enumerable (c. e.) degree a is plus-cupping, if for every c.e. degree x with 0 < x ≤ a, there is a c. e. degree y ≠ 0′ such that x ∨ y = 0′. We say that a is n-plus-cupping, if for every c. e. degree x, if 0 < x ≤ a, then there is a lown c. e. degree I such that x ∨ I = 0′. Let PC and PCn be the set of all plus-cupping, and n-plus-cupping c. e. degrees respectively. Then PC1 ⊆ PC2 ⊆ PC3 = PC. In this paper we show that PC1 ⊂ PC2, so giving a nontrivial hierarchy for the plus cupping degrees. The theorem also extends the result of Li, Wu and Zhang [14] showing that LC1 ⊂ LC2, as well as extending the Harrington plus-cupping theorem [8].

APA, Harvard, Vancouver, ISO, and other styles

18

Nies, André, Frank Stephan, and Sebastiaan A. Terwijn. "Randomness, relativization and Turing degrees." Journal of Symbolic Logic 70, no. 2 (June 2005): 515–35. http://dx.doi.org/10.2178/jsl/1120224726.

Full text

Abstract:

AbstractWe compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martin-Löf random relative to ∅(n − 1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) ≥ ∣x∣ − c. The ‘only if’ direction was obtained independently by Joseph Miller. This characterization can be extended to the case of time-bounded C-complexity.Next we prove some results on lowness. Among other things, we characterize the 2-random sets as those l-random sets that are low for Chaitin's Ω. Also, 2-random sets form minimal pairs with 2-generic sets. The r.e. low for Ω. sets coincide with the r.e. K-trivial ones.Finally we show that the notions of Martin-Löf randomness, recursive randomness, and Schnorr randomness can be separated in every high degree while the same notions coincide in every non-high degree. We make some remarks about hyperimmune-free and PA-complete degrees.

APA, Harvard, Vancouver, ISO, and other styles

19

McAllister, Alex M. "Completions of PA: Models and enumerations of representable sets." Journal of Symbolic Logic 63, no. 3 (September 1998): 1063–82. http://dx.doi.org/10.2307/2586727.

Full text

Abstract:

AbstractWe generalize a result on True Arithmetic (ℐA) by Lachlan and Soare to certain other completions of Peano Arithmetic (PA). If ℐ is a completion of PA, then Rep(ℐ) denotes the family of sets X ⊆ ω for which there exists a formula φ(x) such that for all n ∈ ω, if n ∈ X, then ℐ ⊢ φ(S(n) (0)) and if n ∉ X, then ℐ ⊢ ┐φ(S(n)(O)). We show that if S, J ⊆ P(ω) such that S is a Scott set, J is a jump ideal, S ⊂ J and for all X ∈ J, there exists C ∈ S such that C is a “coding” set for the family of subtrees of 2<ω computable in X, and if ℐ is a completion of PA Such that Rep(ℐ) = S, then there exists a model A of ℐ such that J is the Scott set of A and no enumeration of Rep(ℐ) is computable in A. The model A of ℐ is obtained via a new notion of forcing.Before proving our main result, we demonstrate the existence of uncountably many different pairs (S, J) satisfying the conditions of our theorem. This involves a new characterization of 1-generic sets as coding sets for the computable subtrees of 2<ω. In particular, C C ⊆ ω is a coding set for the family of subtrees of 2<ω computable in X if and only if for all trees T ⊆ 2<ω computable in X, if χc is a path through T, then there exists σ ∈ T such that σ ⊂ χc and every extension of σ is in T. Jockusch noted a connection between 1-generic sets and coding sets for computable subtrees of 2<ω. We show they are identical.

APA, Harvard, Vancouver, ISO, and other styles

20

YEH, W. K., S. K. GHAG, and S. W. QUEENER. "Enzymes for Epimerization of Isopenicillin N, Ring Expansion of Penicillin N, and 3'-Hydroxylation of Deacetoxycephalosporin C." Annals of the New York Academy of Sciences 672, no. 1 Enzyme Engine (November 1992): 396–408. http://dx.doi.org/10.1111/j.1749-6632.1992.tb32705.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Lynch, James F. "Infinitary logics and very sparse random graphs." Journal of Symbolic Logic 62, no. 2 (June 1997): 609–23. http://dx.doi.org/10.2307/2275550.

Full text

Abstract:

AbstractLet be the infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided only finitely many distinct variables occur among the formulas. Let p(n) be the edge probability of the random graph on n vertices. It is shown that if p(n) ≪ n−1 satisfies certain simple conditions on its growth rate, then for every , the probability that σ holds for the random graph on n vertices converges. In fact, if p(n) = n−α, α > 1, then the probability is either smaller than for some d > 0, or it is asymptotic to cn−d for some c > 0, d ≥ 0. Results on the difficulty of computing the asymptotic probability are given.

APA, Harvard, Vancouver, ISO, and other styles

22

Choudhuri, Arnab Rai, and Rajinder Singh. "The FRS nomination of Sir Prafulla C. Ray and the correspondence of N. R. Dhar." Notes and Records: the Royal Society Journal of the History of Science 72, no. 1 (September 13, 2017): 57–73. http://dx.doi.org/10.1098/rsnr.2017.0030.

Full text

Abstract:

Sir Prafulla Chandra Ray (1861–1944) was the first Indian chemist to achieve high international reputation. Originally trained at the University of Edinburgh, he worked for many years at Presidency College in Calcutta and then at Calcutta University. He built up a remarkable school of chemical research by attracting many outstanding students to work with him and published about 150 papers—many of them in leading British and German journals. Ray was highly respected by his British peers and was the first Indian of that era to be nominated for FRS, in 1913. At the time when his nomination was being considered by the Royal Society, Ray's favourite student, Nil Ratan Dhar (1892–1986), who was to become the second Indian chemist to achieve high international reputation, worked in London and Paris for a few years. Even when Dhar was merely a 24-year-old student, he lobbied with several leading British chemists for the election of Ray and kept Ray informed in a series of fascinating letters—giving us a rare glimpse of what election to the Royal Society meant for Indian scientists of that era. During this time, Ray received a knighthood for his contributions to chemistry, and Nature published a front-page article on Ray's ‘life-work’. Many British chemists felt strongly that Ray should be elected FRS and were willing to discuss Ray's case with the young Dhar quite openly. But, rather mysteriously, Ray never got elected.

APA, Harvard, Vancouver, ISO, and other styles

23

Meliakova, Yuliia Vasylivna, Inna Igorivna Kovalenko, Svitlana Borysivna Zhdanenko, Eduard Anatolievich Kalnytskyi, and Tetiana Vasyliivna Krasiuk. "Posthuman Freedom as the Right to Unlimited Pleasure." Revista Amazonia Investiga 10, no. 39 (May 5, 2021): 62–75. http://dx.doi.org/10.34069/ai/2021.39.03.6.

Full text

Abstract:

Berdyaev, N. A. (1951). The kingdom of the spirit and the kingdom of Caesar. Paris: Umca-Press. Recovered from: https://vtoraya-literatura.com/pdf/berdyaev_tsarstvo_dukha_i_tsastvo_kesarya_1951__ocr.pdf. Berlinger, N., & Solomon, M. Z. (2018). Becoming Good Citizens of Aging Societies. Hastings center report, Vol. 48(3), 2–9. Bostrom, N. (2003). Are You Living in a Simulation? Philosophical Quarterly, Vol. 53(211), 243–255. Bostrom, N. (2016). Development of values. Artificial Intelligence: Stages. Threats. Strategies. Moscow: Publishing House "Mann, Ivanov and Ferber". Recovered from: https://element.ru/bookclub/chapters/433044/Iskusstvennyy_intellekt_Glava_iz_knigi. Goryachkovskaya, A. N. (2014). Philosophy of transhumanism: on the surrogates of being, the abduction of identity and euthanasia of humanity. Bulletin of V. N. Karazin Kharkiv National University. Series: Theory of Culture and Philosophy of Science, Vol. 1092, Issue 50. Recovered from: http://periodicals.karazin.ua/thcphs/issue/view/209. Gould, C. C. (2018). Solidarity and the problem of structural injustice in healthcare. Bioethics, Vol. 32(9), 541–552. Guerrini, C., Lewellyn, M., Majumder, M. et al. (2019). Donors, authors, and owners: how is genomic citizen science addressing interests in research outputs? BMC Medical Ethics, Vol. 20, Issue 1, Article number 84. Habermas, J. (2002). The future of human nature. Towards liberal eugenics. Moskva: Ves' Mir. Haker, H. (2019). Habermas and the Question of Bioethics. European journal for Philosophy of Religion, Issue 4, 61–86. Heidegger, M. (1967). Being And Time. Max Niemeyer loading facility in Tübinge. Recovered from: https://taradajko.org/get/books/sein_und_zeit.pdf. Kakkori, L. (2018). Postmodern as Secularization in Philosophy of Education. Educational Philosophy and Theory, Vol. 50(14), Special issue: SI, 1639–1640. Kroker, A., & Cook, D. (1986). The Postmodern Scene. Excremental Culture and Hyper-Aesthetics. Montreal: New World Perspectives. Kurzweil, R. (2012). How to create a mind: the secret of human thought revealed. New York: Penguin Books. Lipovetsky, G. (2015). Time Against Time, or The Hypermodern Society. In D. Rudrum and N. Stavris (Ed.), Supplanting the Postmodern. An Anthology of Writings on the Arts and Culture of the Early 21st Century (p. 191–208). New York; London; New Delhi; Sydney: Bloomsbury Academic. Lobanov, V.A (2020). Transhumanism in the interpretation of V. A. Lobanov. Samizdat Magazine. Recovered from: http://samlib.ru/l/lobanow_w_a/samlibrullobanow_w_amsworddocshtml-2.shtml. Meliakova, Y., Kovalenko, I., Zhdanenko, S., & Kalnytskyi, E. (2020). Performance in the Postmodern Culture and Law. Amazonia Investiga, 9(27), 340–348. https://amazoniainvestiga.info/index.php/amazonia/article/view/1247 Melyakova, Yu. V. (2018). Being of law and being in law: from performative to performance. Bulletin of the National University "Yaroslav the Wise Law Academy of Ukraine". Series: Philosophy, Vol. 1(36), 90–113. Odorcak, J. (2019). Exorganic Posthumanism and Brain-Computer Interface Technologies (BCI). Postmodern openings, Vol. 10(4), 193-208. Pavlov, A. V. (2019). Images of modernity in the 21st century: hypermodernism. Philosophical Journal, Vol. 12(2), 20–33. Piarce, D. (2015). The Hedonistic Imperative. eBook. Recovered from: https://ubq124.wordpress.com/2019/12/22/the-hedonistic-imperative-pdf. Polyakova, O. V. (2017). Commodification of the dead body: ethical and legal aspects. Bulletin of the RSUH. Series "Psychology. Pedagogy. Education", Vol. 2(8), 118–128. Recovered from: http://cyberleninka.ru/article/n/kommodifikatsiya-mertvogo-tela-etiko-pravovye-aspekty Popova, O. V. (2016). Man, its price and value: to the problem of body commodification in scientific knowledge. Epistemology and philosophy of science, Vol. 49(3), 140-157. Recovered from: http://cyberleninka.ru/article/n/chelovek-ego-tsena-i-tsennost-k-probleme-kommodifikatsii-tela-v-nauchnom-poznanii. Popova, O. V., Tishchenko, P. D., & Shevchenko, S. Yu. (2018). Neuroethics and biopolitics of biotechnology for cognitive improvement of human improvement. Philosophy questions, Vol. 7, 96–108. Russian Transhumanist Movement (2020). About the possibilities of self-upgrade and life extension. Recovered from: http://transhumanism-russia.ru/content/view/629/94/ Sandu, A., Vlad, L. (2018). Beyond Technological Singularity – the Posthuman Condition. Postmodern openings, Vol. 9(1), 91-102. Sartre, J.P. (1989). Existentialism is humanism. In: Twilight of the Gods. Moscow: Politizdat, 319-344. Strandbrink, P. (2018). Nostalgia and Shrinkage: Philosophy and culture under post-postmodern conditions. Educational Philosophy and Theory, Vol. 50(14), 1407–1408. Twenge, J. M. (2006). Generation Me: Why Today’s Young Americans Are More Confident, Assertive, Entitled – and More Miserable Than Ever Before. New York: ATRIA paperback. Retrieved from http://www.amazon.co.uk/Generation-Americans-Confident-Assertive-Entitled/dp/1476755566. Twenge, J. M. (2017). iGen: Why Today’s Super-Connected Kids Are Growing Up Less Rebellious, More Tolerant, Less Happy – and Completely Unprepared for Adulthood. New York: ATRIA books. Retrieved from http://www.amazon.com/iGen-Super-Connected-Rebellious-Happy-Adulthood/dp/1501151983. United Nations (1997). Universal Declaration on the Human Genome and Human Rights. Recovered from http://www.un.org/ru/documents/decl_conv/declarations/human_genome.shtml United Nations (2005). Universal Declaration on Bioethics and Human Rights. Recovered from: http://www.un.org/ru/documents/decl_conv/declarations/bioethics_and_hr.shtml Yong, L. (2019). Moral Ambivalence: Relativism or Pluralism? Acta analytica-international periodical for Philosophy in the analytical tradition, Vol. 34(4), 473–491. Zinovyev, A. (2006). Global Human. Booksonline. Recovered from: http://booksonline.com.ua/view.php?book=97560 (in Russian).

APA, Harvard, Vancouver, ISO, and other styles

24

NEŠETŘIL, JAROSLAV, and PATRICE OSSONA DE MENDEZ. "EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES." Journal of Symbolic Logic 84, no. 02 (March 7, 2019): 452–72. http://dx.doi.org/10.1017/jsl.2018.32.

Full text

Abstract:

AbstractA sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel. It was known that FO-convergent sequence of graphs do not always admit a modeling limit, but it was conjectured that FO-convergent sequences of sufficiently sparse graphs have a modeling limits. Precisely, two conjectures were proposed:1.If a FO-convergent sequence of graphs is residual, that is if for every integer d the maximum relative size of a ball of radius d in the graphs of the sequence tends to zero, then the sequence has a modeling limit.2.A monotone class of graphs ${\cal C}$ has the property that every FO-convergent sequence of graphs from ${\cal C}$ has a modeling limit if and only if ${\cal C}$ is nowhere dense, that is if and only if for each integer p there is $N\left( p \right)$ such that no graph in ${\cal C}$ contains the pth subdivision of a complete graph on $N\left( p \right)$ vertices as a subgraph.In this article we prove both conjectures. This solves some of the main problems in the area and among others provides an analytic characterization of the nowhere dense–somewhere dense dichotomy.

APA, Harvard, Vancouver, ISO, and other styles

25

Hajko, Dalimír, and Ľuboš Török. "The ethical context of social philosophy in contemporary India." Ethics & Bioethics 8, no. 1-2 (June 1, 2018): 121–38. http://dx.doi.org/10.2478/ebce-2018-0009.

Full text

Abstract:

Abstract Public and academic philosophical thinking in contemporary India provides evidence that philosophy and religion have never been truly separated, although there have been attempts to bring philosophy closer to science and, thus, create two autonomous systems. In light of these changes, P. V. Athavale, C. T. K. Chari, N. S. Prasad and some other authors have formed and are developing modern ethical and social theories. Moreover, feminism and gender studies have appeared in the panorama of changing philosophical and sociological thinking in India, embracing gender equality in contemporary Indian society. There has been increasing interest in sociological research and a critical interpretation of Mahatma Gandhi’s spiritual message in the cause of India’s independence, whose thoughts authors engaged in contemporary ethical problems believe to be impractical and useless today. Existentialism as a philosophical stream earned broad public acceptance and played a significant role in the history of modern philosophical thinking in India in the second half of the 20th century.

APA, Harvard, Vancouver, ISO, and other styles

26

Kumabe, Masahiro. "Minimal complementation below uniform upper bounds for the arithmetical degrees." Journal of Symbolic Logic 61, no. 4 (December 1996): 1158–92. http://dx.doi.org/10.2307/2275810.

Full text

Abstract:

This paper was inspired by Lerman [15] in which he proved various properties of upper bounds for the arithmetical degrees. We discuss the complementation property of upper bounds for the arithmetical degrees. In Lerman [15], it is proved that uniform upper bounds for the arithmetical degrees are jumps of upper bounds for the arithmetical degrees. So any uniform upper bound for the arithmetical degrees is not a minimal upper bound for the arithmetical degrees. Given a uniform upper bound a for the arithmetical degrees, we prove a minimal complementation theorem for the upper bounds for the arithmetical degrees below a. Namely, given such a and b < a which is an upper bound for the arithmetical degrees, there is a minimal upper bound for the arithmetical degrees c such that b ∪ c = a. This answers a question in Lerman [15]. We prove this theorem by different methods depending on whether a has a function which is not dominated by any arithmetical function. We prove two propositions (see §1), of which the theorem is an immediate consequence.Our notation is almost standard. Let A ⊕ B = {2n∣n ∈ A} ∪ {2n + 1∣n + 1∣n ∈ B} for any sets A and B. Let ω be the set of nonnegative natural numbers.

APA, Harvard, Vancouver, ISO, and other styles

27

Shami, Ziv. "Coordinatisation by binding groups and unidimensionality in simple theories." Journal of Symbolic Logic 69, no. 4 (December 2004): 1221–42. http://dx.doi.org/10.2178/jsl/1102022220.

Full text

Abstract:

Abstract.In a simple theory with elimination of finitary hyperimaginaries if tp(a) is real and analysable over a definable set Q, then there exists a finite sequence (ai \ i ≤ n*) ⊆ dcleq(a) with an* = a such that for every i ≤ n* if pi = tp(ai/{aj |j < i}) then Aut(pi / Q) is type-definable with its action on . A unidimensional simple theory eliminates the quantifier ∃∞ and either interprets (in Ceq) an infinite type-definable group or has the property that ACL(Q) = C for every infinite definable set Q.

APA, Harvard, Vancouver, ISO, and other styles

28

Jockusch, Carl G., and Robert I. Soare. "Boolean algebras, Stone spaces, and the iterated Turing jump." Journal of Symbolic Logic 59, no. 4 (December 1994): 1121–38. http://dx.doi.org/10.2307/2275695.

Full text

Abstract:

AbstractWe show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, is a countable structure with finite signature, and d is a degree, we say that has αth-jump degreed if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of with universe ω in which the functions and relations have degree at most c. We show that every degree d ≥ 0(ω) is the ωth jump degree of a Boolean algebra, but that for n < ω no Boolean algebra has nth-jump degree d < 0(n). The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties.

APA, Harvard, Vancouver, ISO, and other styles

29

SCHÄR, HANS-PETER, WALTER MÄRKI, ORESTE GHISALBA, HANS-BEAT JENNY, and HANS RINK. "Modification of Recombinant N?-Acetyl-Eglin c by Novel Proteases from Nocardia mediterranei." Annals of the New York Academy of Sciences 542, no. 1 Enzyme Engine (December 1988): 302–6. http://dx.doi.org/10.1111/j.1749-6632.1988.tb25847.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Jones, Albin L. "A polarized partition relation for weakly compact cardinals using elementary substructures." Journal of Symbolic Logic 71, no. 4 (December 2006): 1342–52. http://dx.doi.org/10.2178/jsl/1164060459.

Full text

Abstract:

AbstractWe show that if κ is a weakly compact cardinal, thenfor any ordinals α < κ+ and μ < κ, and any finite ordinals m and n. This polarized partition relation represents the statement that for any partitionof κ × κ+ 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.

APA, Harvard, Vancouver, ISO, and other styles

31

Copestake, Kate. "1-genericity in the enumeration degrees." Journal of Symbolic Logic 53, no. 3 (September 1988): 878–87. http://dx.doi.org/10.2307/2274578.

Full text

Abstract:

The structure of the Turing degrees of generic and n-generic sets has been studied fairly extensively, especially for n = 1 and n = 2. The original formulation of 1-generic set in terms of recursively enumerable sets of strings is due to D. Posner [11], and much work has since been done, particularly by C. G. Jockusch and C. T. Chong (see [5] and [6]).In the enumeration degrees (see definition below), attention has previously been restricted to generic sets and functions. J. Case used genericity for many of the results in his thesis [1]. In this paper we develop a notion of 1-generic partial function, and study the structure and characteristics of such functions in the enumeration degrees. We find that the e-degree of a 1-generic function is quasi-minimal. However, there are no e-degrees minimal in the 1-generic e-degrees, since if a 1-generic function is recursively split into finitely or infinitely many parts the resulting functions are e-independent (in the sense defined by K. McEvoy [8]) and 1-generic. This result also shows that any recursively enumerable partial ordering can be embedded below any 1-generic degree.Many results in the Turing degrees have direct parallels in the enumeration degrees. Applying the minimal Turing degree construction to the partial degrees (the e-degrees of partial functions) produces a total partial degree ae which is minimal-like; that is, all functions in degrees below ae have partial recursive extensions.

APA, Harvard, Vancouver, ISO, and other styles

32

Rivero García, Luis. "N. HEINSIUS'S FRAGMENTVM CAESENAS OF OVID'S METAMORPHOSES REDISCOVERED." Classical Quarterly 66, no. 1 (April 20, 2016): 384–94. http://dx.doi.org/10.1017/s0009838816000264.

Full text

Abstract:

Among the manuscripts of Ovid's Metamorphoses used by N. Heinsius (1620–1681) and as yet unidentified or given up for lost is the so-called fragmentum Caesenas (Cs), the collation of which was not carried out by Heinsius himself but provided for him by the Hamburg jurist Lucas Langermann (1625–1686), who was a correspondent of Heinsius, Gronovius and Vossius, among others. According to M.D. Reeve, he was also responsible for adding these notes, using the siglum c, to Oxon. Bodl. Auct. S.V.5, which also includes the collations—by another hand—of A (= Vrbinas ueterrimus, our V2) and B (= Berneggerianus, our P2). The variants provided by this fragment affect lines 9.235–11.169 and 13.1–403, although this does not imply that these were the exact limits of its content, as we shall see below. Some of these variants ended up in the notes of the editions by Heinsius himself and by those who continued his work (the most prominent example being the admirable edition of Ovid by P. Burman, in 1727), and it was D.A. Slater who rescued the collation of Bodl. Auct. S.V.5 from obscurity when he included the greater part of the readings of c (the siglum he himself retains) among the rich store of information presented in his work. F. Munari included the fragment in his catalogue, clearly pointing to the uncertainty surrounding its dating (‘aetatis incertae’, the same expression as used by Slater) while adding the information that it was not at that time to be found in Cesena. The succinct information offered by Slater is used by I. Marahrens for her dissertation and by W.S. Anderson for his edition. R.J. Tarrant, in turn, explicitly states that the fragment is now lost. In the following pages, however, I will attempt to show that this fragment is not lost, but still preserved in the Biblioteca Malatestiana in Cesena.

APA, Harvard, Vancouver, ISO, and other styles

33

Marker, David. "Non Σn axiomatizable almost strongly minimal theories." Journal of Symbolic Logic 54, no. 3 (September 1989): 921–27. http://dx.doi.org/10.2307/2274752.

Full text

Abstract:

Recall that a theory is said to be almost strongly minimal if in every model every element is in the algebraic closure of a strongly minimal set. In 1970 Hodges and Macintyre conjectured that there is a natural number n such that every ℵ0-categorical almost strongly minimal theory is Σn axiomatizable. Recently Ahlbrandt and Baldwin [A-B] proved that if T is ℵ0-categorical and almost strongly minimal, then T is Σn axiomatizable for some n. This result also follows from Ahlbrandt and Ziegler's results on quasifinite axiomatizability [A-Z]. In this paper we will refute Hodges and Macintyre's conjecture by showing that for each n there is an ℵ0-categorical almost strongly minimal theory which is not Σn axiomatizable.Before we begin we should note that in all these examples the complexity of the theory arises from the complexity of the definition of the strongly minimal set. It is still open whether the conjecture is true if we allow a predicate symbol for the strongly minimal set.We will prove the following result.Theorem. For every n there is an almost strongly minimal ℵ0-categorical theory T with models M and N such that N is Σn elementary but not Σn + 1 elementary.To show that these theories yield counterexamples to the conjecture we apply the following result of Chang [C].Theorem. If T is a Σn axiomatizable theory categorical in some infinite power, M and N are models of T and N is a Σn elementary extension of M, then N is an elementary extension of M.

APA, Harvard, Vancouver, ISO, and other styles

34

Bagaria, Joan, and Andrew Brooke-Taylor. "On Colimits and Elementary Embeddings." Journal of Symbolic Logic 78, no. 2 (June 2013): 562–78. http://dx.doi.org/10.2178/jsl.7802120.

Full text

Abstract:

AbstractWe give a sharper version of a theorem of Rosický, Trnková and Adámek [13], and a new proof of a theorem of Rosický [12], both about colimits in categories of structures. Unlike the original proofs, which use category-theoretic methods, we use set-theoretic arguments involving elementary embeddings given by large cardinals such as α-strongly compact and C(n)-extendible cardinals.

APA, Harvard, Vancouver, ISO, and other styles

35

Neville, Cynthia J. "Credit and Debt in Medieval England c. 1180–c. 1350. Edited by Phillipp R. Schofield and N. J. Mayhew (Oxford, Oxbow Books, 2002) 164 pp. $39.95." Journal of Interdisciplinary History 34, no. 4 (April 2004): 627–28. http://dx.doi.org/10.1162/jinh.2004.34.4.627.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Haack, Susan. "A. C. Grayling. An introduction to philosophical logic. The Harvester Press, Brighton, Sussex, and Barnes & Noble Books, Totowa, N. J., 1982, 300 pp." Journal of Symbolic Logic 50, no. 2 (June 1985): 553–54. http://dx.doi.org/10.2307/2274248.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

van den Dries, Lou, David Marker, and Gary Martin. "Definable equivalence relations on algebraically closed fields." Journal of Symbolic Logic 54, no. 3 (September 1989): 928–35. http://dx.doi.org/10.2307/2274753.

Full text

Abstract:

This article was inspired by the question: is there a definable equivalence relation on the field of complex numbers, each of whose equivalence classes has exactly two elements? The answer turned out to be no, as we now explain in greater detail.Let Κ be an algebraically closed field and let E be a definable equivalence relation on Κ. [Note: By “definable” we will always mean “definable with parameters”.] Either E has one cofinite class, or all classes are finite and there is a number d such that all but a finite set of classes have cardinality d. In the latter case let B be the finite set of elements of Κ which are not in a class of size d. We prove the following result.Theorem 1. a) If char(Κ) = 0 or char(Κ) = p > d, then ∣B∣ ≡ 1 (mod d).b) If char(Κ) = 2 and d = 2, then ∣B∣ ≡ 0 (mod 2).c) If char(Κ) = p > 2 and d = p + s, where 1 ≤ s ≤ p/2, then ∣B∣ ≡ p + 1 (mod d).Furthermore, a)−c) are the only restrictions on ≡B≡.If one is in the right mood, one can view this theorem as saying that the “algebraic cardinality” of the complex numbers is congruent to 1 (mod n) for every n.§1 contains a reduction of the problem to the special case where E is induced by a rational function in one variable. §2 contains the main calculations and the proofs of a)−c). §3 contains eight families of examples showing that all else is possible. In §4 we prove an analogous result for real closed fields.

APA, Harvard, Vancouver, ISO, and other styles

38

Levy, David W., and Patrick J. Hearden. "Vietnam: Four American Perspectives: Lectures by George S. McGovern, William C. Westmoreland, Edward N. Luttwak, Thomas J. McCormick." Journal of American History 78, no. 2 (September 1991): 746. http://dx.doi.org/10.2307/2079681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

CARLUCCI, LORENZO, and KONRAD ZDANOWSKI. "THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS." Journal of Symbolic Logic 79, no. 01 (March 2014): 89–102. http://dx.doi.org/10.1017/jsl.2013.27.

Full text

Abstract:

Abstract We characterize the effective content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called exactly large sets. An exactly large set is a set $X \subset {\bf{N}}$ such that ${\rm{card}}\left( X \right) = {\rm{min}}\left( X \right) + 1$ . The theorem we analyze is as follows. For every infinite subset M of N, for every coloring C of the exactly large subsets of M in two colors, there exists and infinite subset L of M such that C is constant on all exactly large subsets of L. This theorem is essentially due to Pudlák and Rödl and independently to Farmaki. We prove that—over RCA0 —this theorem is equivalent to closure under the ωth Turing jump (i.e., under arithmetical truth). Natural combinatorial theorems at this level of complexity are rare. In terms of Reverse Mathematics we give the first Ramsey-theoretic characterization of ${\rm{ACA}}_0^ +$ . Our results give a complete characterization of the theorem from the point of view of Computability Theory and of the Proof Theory of Arithmetic. This nicely extends the current knowledge about the strength of Ramsey’s Theorem. We also show that analogous results hold for a related principle based on the Regressive Ramsey’s Theorem. We conjecture that analogous results hold for larger ordinals.

APA, Harvard, Vancouver, ISO, and other styles

40

Ousmanova, Almira. "Klastotė ant kortos: semiotika ir autentiškumo problema." Problemos 66, no. 1 (September 29, 2014): 80–101. http://dx.doi.org/10.15388/problemos.2004.66.7247.

Full text

Abstract:

The essay provides a critical assessment of the debates concerning the concepts of fake and original (authentic) in the context of semiotics (Ch.S. Peirce, T. de Lauretis, U. Eco, M. Bal), philosophy (N. Goodman, J. Baudrillard, S. Žižek), art theory (W Benjamin, I. Haywood, N. Bryson), history (C. Ginzburg). It is an attempt to represent the problem of reproduction of cultural artefacts as a multifaceted issue which embraces the whole series of related notions (fake, forgery, imitation, reproduction, replication, remake, copy, pastiche, etc.) along with their different meanings and implications for various cultural practices (fine arts, history, architecture, cinema, social and cultural ‘apparatuses’ of identification). The main aim of the text is to provide an interdisciplinary frame of interpretation of the phenomenon of forgery, to reveal how aesthetic judgments on the originality (and aura) of the work of art are determined by economical and political factors and to show how the 'ideology of original' is related to the power-knowledge system and the issues of political economy in contemporary Western culture. Semiotics (particularly, in U. Eco’s version) is chosen here as the most promising and efficient tool for the analysis of this complex phenomenon.

APA, Harvard, Vancouver, ISO, and other styles

41

Kumabe, Masahiro. "A 1-generic degree with a strong minimal cover." Journal of Symbolic Logic 65, no. 3 (September 2000): 1395–442. http://dx.doi.org/10.2307/2586706.

Full text

Abstract:

We consider a set generic over the arithmetic sets. A subset A of the natural numbers is called n-generic if it is Cohen-generic for n-quantifier arithmetic. This is equivalent to saying that for every -set of strings S, there is a string σ ⊂ A such that σ ∈ S or no extension of σ is in S. By degree we mean Turing degree (of unsolvability). We call a degree n-generic if it has an n-generic representative. For a degree a, let D(≤ a) denote the set of degrees which are recursive in a.We say a is a strong minimal cover of g if every degree strictly below a is less than or equal to g. In this paper we show that there are a degree a and a 1-generic degree g < a such that a is a strong minimal cover of g. This easily implies that there is a 1-generic degree without the cupping property. Jockusch [7] showed that every 2-generic degree has the cupping property. Slaman and Steel [17] and independently Cooper [3] showed that there are recursively enumerable degrees a and b < a such that no degree c < a joins b above a. Take a 1-generic degree g below b. Then g does not have the cupping property.

APA, Harvard, Vancouver, ISO, and other styles

42

CARBONE, ARNALDO, GABRIELE L. GUSELLA, DANUTA RADZIOCH, and LUIGI VARESIO. "Harvey-ras, but Not Kirsten or N-ras, Inhibits the Induction of C-fos Expression." Annals of the New York Academy of Sciences 551, no. 1 Membrane in C (December 1988): 361–62. http://dx.doi.org/10.1111/j.1749-6632.1988.tb22363.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

YOSHIMURA, K., H. AOKI, Y. IKEDA, A. FURUTANI, K. HAMANO, and M. MATSUZAKI. "Identification of c-Jun N-Terminal Kinase as a Therapeutic Target for Abdominal Aortic Aneurysm." Annals of the New York Academy of Sciences 1085, no. 1 (November 1, 2006): 403–6. http://dx.doi.org/10.1196/annals.1383.049.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Ramis Barceló, Rafael. "C. Panti - N. Polloni (eds.), "Vedere nell’ombra. Studi su natura, spiritualità e scienze operative offerti a Michela Pereira", Firenze, Sismel-Edizioni del Galluzzo, 2018, 430 pp." Anales del Seminario de Historia de la Filosofía 36, no. 3 (September 20, 2019): 873–75. http://dx.doi.org/10.5209/ashf.65676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Redding, Paul. "Hegel’s Subjective Logic as a Logic for (Hegel’s) Philosophy of Mind." Hegel Bulletin 39, no. 1 (October 17, 2016): 1–22. http://dx.doi.org/10.1017/hgl.2016.54.

Full text

Abstract:

AbstractIn the 1930s, C. I. Lewis, who was responsible for the revival of modal logic in the era of modern symbolic logic, characterized ‘intensional’ approaches to logic as typical of post-Leibnizian ‘continental philosophy’, in contrast to the ‘extensionalist’ approaches dominant in the British tradition. Indeed Lewis’s own work in this area had been inspired by the logic of his teacher, the American ‘Absolute Idealist’, Josiah Royce. Hegel’s ‘Subjective Logic’ in Book III of hisScience of Logic, can, I suggest, be considered as an intensional modal logic, and this paper explores parallels between it and a later variety of modal logic—tenselogic, as developed by Arthur Prior in the 1950s and 60s. Like Lewis, Prior too had been influenced in this area by a teacher with strong Hegelian leanings—John N. Findlay. Treated as anintensional(with an ‘s’) logic, Hegel’s subjective logic can be used as a framework for addressing issues ofintentionality(with a ‘t’)—the mind’s capacity to be intentionally directed to objects. In this way, I suggest that the structures of his subjective logic can clarify what is at issue in the ‘Psychology’ section of theEncyclopaediaPhilosophy of Subjective Spirit.

APA, Harvard, Vancouver, ISO, and other styles

46

John, Richard R. ":Hand Book of Administrative History . By Jos C. N. Raadschelders ( New Brunswick, N.J. , Transaction Publishers , 1998 ) 372 pp. $39.95." Journal of Interdisciplinary History 30, no. 3 (January 1999): 490–91. http://dx.doi.org/10.1162/jinh.1999.30.3.490.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

John, Richard R. "Hand Book of Administrative History. By Jos C. N. Raadschelders (New Brunswick, N.J., Transaction Publishers, 1998) 372 pp. $39.95." Journal of Interdisciplinary History 30, no. 3 (January 2000): 490–91. http://dx.doi.org/10.1162/jinh.2000.30.3.490.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Mayer, Roland. "C. D. N. Costa: Seneca, 17 Letters. Pp. v + 234. Warminster: Aris & Phillips, 1988. £28 (paper, £9.95)." Classical Review 40, no. 1 (April 1990): 162. http://dx.doi.org/10.1017/s0009840x00252803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Ravindran, Gopalan. "Rhetorical Bodies and Movement-Images in the 1949 Tamil Film Velaikari (House Maid)." Deleuze and Guattari Studies 12, no. 1 (February 2018): 45–65. http://dx.doi.org/10.3366/dlgs.2018.0295.

Full text

Abstract:

The notion of ‘rhetorical bodies’ argues the cause of the rhetorical elements in the material and the material elements in the rhetorical in ways that can be seen as analogous to the bi-partite modes of Deleuzian film philosophy, ‘movement-image’ and ‘time-image’. Tamil films of the 1940s and 1950s bear the strong imprints of the rhetorical elements of the Self-Respect Movement and Dravidian Movement, which took root in different versions during the 1920s–60s. The narrative locations of the bodies (both male and female) in the Tamil films of the 1940s and 1950s provide interesting theoretical and analytical challenges if one seeks to combine the Deleuzian notions of ‘movement-image’ with the notions of material rhetorics. The coming together of these notions provides new pointers to the understanding of an important phase in the history of Tamil cinema for its implications on the long-running nexus between politics and films in the state of Tamil Nadu. The Deleuzian trajectory in film philosophy provides more than enough pointers to examine early Tamil cinema's attempts to construct ‘movement-images’ through rhetorical bodies. This paper seeks to examine the contexts of ‘movement-images’ and the role of ‘rhetorical bodies’ in constructing the same in Velaikari (1949), scripted by C. N. Annadurai. Popularly known as Aringnar Anna, C. N. Annadurai was the former Chief Minister of Tamil Nadu and the Founder of DMK (Dravida Munnetra Kazhakam), the party which unseated Congress from power in Tamil Nadu in 1967, and the state remains out of reach of the national parties ever since.

APA, Harvard, Vancouver, ISO, and other styles

50

Hrušák, Michael, and Ondřej Zindulka. "Cardinal invariants of monotone and porous sets." Journal of Symbolic Logic 77, no. 1 (March 2012): 159–73. http://dx.doi.org/10.2178/jsl/1327068697.

Full text

Abstract:

AbstractA metric space (X, d) ismonotoneif there is a linear order < onXand a constantcsuch thatd(x, y)≤c d(x, z)for allx<y<zinX. We investigate cardinal invariants of theσ-idealMongenerated by monotone subsets of the plane. Since there is a strong connection between monotone sets in the plane and porous subsets of the line, plane and the Cantor set, cardinal invariants of these ideals are also investigated. In particular, we show that non(Mon) ≥mσ-linked, but non(Mon) <mσ-centeredis consistent. Also cov(Mon) <cand cof (N) < cov(Mon) are consistent.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!