Results 221 to 230 of about 175,539 (259)
Some of the next articles are maybe not open access.
An extension-quenching-extension sequencing on a microarray
Talanta, 2010Inherent problems exist with sequencing-by-synthesis (SBS) methods which use fluorescein-labeled nucleotide incorporation into a target template based on a polymerase chain reaction (PCR). These problems include lowering the cost of sequencing and the removal of fluorescence in DNA sequencing for further reading.
Li, Gao, Hua, Lu, Hong, Zhao, Zuhong, Lu
openaire +2 more sources
Anti-integral extensions and unramified extensions
Mathematical Journal of Okayama University, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kanemitsu, Mitsuo, Yoshida, Ken-ichi
openaire +3 more sources
Mathematical Structures in Computer Science, 2005
Summary: Continuous valuations have been proposed by several authors as a way of modelling probabilistic nondeterminism in programming language semantics. Let \((X,{\mathcal O})\) be a topological space. A quasi-simple valuation on \(X\) is the sup of a directed family of simple valuations.
openaire +3 more sources
Summary: Continuous valuations have been proposed by several authors as a way of modelling probabilistic nondeterminism in programming language semantics. Let \((X,{\mathcal O})\) be a topological space. A quasi-simple valuation on \(X\) is the sup of a directed family of simple valuations.
openaire +3 more sources
On extensions of supercompactness
Mathematical Logic Quarterly, 2015We show that, in terms of both implication and consistency strength, an extendible with a larger strong cardinal is stronger than an enhanced supercompact, which is itself stronger than a hypercompact, which is itself weaker than an extendible. All of these are easily seen to be stronger than a supercompact. We also study Cnâsupercompactness.
Robert S. Lubarsky +1 more
openaire +1 more source
Extensible Debugger Framework for Extensible Languages
2015Language extension enables integration of new language constructs without invasive changes to a base language (e. g., C). Such extensions help to build more reliable software by using proper domain-specific abstractions. Language workbenches significantly reduce the effort for building such extensible languages by synthesizing a fully-fledged IDE from ...
Domenik Pavletic +4 more
openaire +1 more source
Embedding of a Cyclic Extension into a Cyclic Extension
Journal of Mathematical Sciences, 2002Let \(k\) be a field, \(K/k\) be cyclic of order \(m\), and let \(n\) be a multiple of \(m\). The extension \(K/k\) is called \(n\)-embeddable if there exists a cyclic extension \(L/k\) such that \([L:k]=n\) and \(K\subseteq L\). The author gives necessary and sufficient conditions for \(K/k\) to be \(2^s\)-embeddable in the case \([K:k]=2\), \(\text ...
openaire +2 more sources
Unramified extensions and birational integral extensions
Kobe Journal of Mathematics, 1984Let R be a Noetherian domain containing a field k of characteristic zero and let \(\bar R\) be the integral closure of R in its quotient field K. An intermediate ring A between R and \(\bar R\) will be called a birational- integral extension of R. Let A be any birational-integral extension of R which is finitely generated as an R-module. We will denote
Kanemitsu, Mitsuo, Yoshida, Ken-ich
openaire +2 more sources
Acta Mathematica Hungarica, 1997
The author considers a more general structure theory of simple semigroups, the basic idea being to give a construction where the term ``group'' is replaced by the term ``monoid'' [see: \textit{D. Rees}, Q. J. Math., Oxf. Ser. 19, 101-108 (1948; Zbl 0030.00802)]. The resulting construction is called a bicyclic extension.
openaire +2 more sources
The author considers a more general structure theory of simple semigroups, the basic idea being to give a construction where the term ``group'' is replaced by the term ``monoid'' [see: \textit{D. Rees}, Q. J. Math., Oxf. Ser. 19, 101-108 (1948; Zbl 0030.00802)]. The resulting construction is called a bicyclic extension.
openaire +2 more sources
The Mathematical Gazette, 1932
If the elements of a determinant of order n are given by a rs (r, s = 1, 2, ... n ),
openaire +2 more sources
If the elements of a determinant of order n are given by a rs (r, s = 1, 2, ... n ),
openaire +2 more sources
Synthese, 1960
One of the most important operations in the logic of science as conceived of by R. Carnap is the explication of a familiar but vague concept. It consists in replacing that concept by a new and exact concept; the earlier concept is called the explicandum, the new concept by which it is replaced is called the explicatum.
openaire +1 more source
One of the most important operations in the logic of science as conceived of by R. Carnap is the explication of a familiar but vague concept. It consists in replacing that concept by a new and exact concept; the earlier concept is called the explicandum, the new concept by which it is replaced is called the explicatum.
openaire +1 more source