نتایج جستجو برای: same order class

تعداد نتایج: 1812965  

Journal: :Proceedings of the American Mathematical Society 1996

Journal: :Transactions of the American Mathematical Society 1960

Journal: :European journal of taxonomy 2021

For each of the 534 species millipede order Chordeumatida known from Europe, available information on taxonomy, distribution and habitat is summarized, in 50 × km UTM/MGRS squares shown a map. Comparisons between equally-sized Julida are made with respect to patterns history exploration.

Journal: :CoRR 2017
Eryk Kopczynski Tony Tan

The spectrum of a first-order sentence is the set of the cardinalities of its finite models. In this paper, we consider the spectra of sentences over binary relations that use at least three variables. We show that for every such sentence Φ, there is a sentence Φ that uses the same number of variables, but only one symmetric binary relation, such that its spectrum is linearly proportional to th...

Journal: :Journal of bacteriology 2011
Kirk J Grubbs Peter H W Biedermann Garret Suen Sandra M Adams Joseph A Moeller Jonathan L Klassen Lynne A Goodwin Tanja Woyke A Christine Munk David Bruce Chris Detter Roxanne Tapia Cliff S Han Cameron R Currie

Streptomyces griseus strain XylebKG-1 is an insect-associated strain of the well-studied actinobacterial species S. griseus. Here, we present the genome of XylebKG-1 and discuss its similarity to the genome of S. griseus subsp. griseus NBRC13350. XylebKG-1 was isolated from the fungus-cultivating Xyleborinus saxesenii system. Given its similarity to free-living S. griseus subsp. griseus NBRC133...

Journal: :CoRR 2014
Juha Kontinen Antti Kuusisto Jonni Virtema

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity o...

Journal: :Logical Methods in Computer Science 2017
Georgios Kourtis Ian Pratt-Hartmann

The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.

Journal: :international journal of group theory 2016
leila mousavi bijan taeri

let $pi_e(g)$ be the set of element orders of a finite group $g$‎. ‎let $nse(g)={m_nmid ninpi_e(g)}$‎, ‎where $m_n$ be the number of elements of order $n$ in $g$‎. ‎in this paper‎, ‎we prove that if $nse(g)=nse(l_2(81))$‎, ‎then $gcong l_2(81)$‎.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید