Results 241 to 250 of about 65,109 (285)

SPFA by finite conditions

Archive for Mathematical Logic, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gitik, Moti, Magidor, Menachem
openaire   +1 more source

Generalized finiteness conditions

1998
In Chapter 3, we studied operational semantic models defined by means of labelled transition systems. We focussed on finitely branching and image finite labelled transition systems. For these systems we developed some theory to prove the induced operational semantic models equal to other semantic models by uniqueness of fixed point. In Chapter 4 and 5,
openaire   +1 more source

Tabor groups with finiteness conditions

Aequationes mathematicae, 2015
A group \(G\) is called a \textit{Tabor} group if for all \(x,y\in G\) there is an integer \(k>0\) such that \((xy)^{2^k}=x^{2^k}y^{2^k}\). This paper is devoted to the study of torsion Tabor groups. In particular it is proved that if a finite group \(G\) is a Tabor group, then \(G=K\times T\) with \(K\) of odd order and \(T\) a \(2\)-group.
openaire   +2 more sources

FINITE GROUPS WITH CENTRALIZER CONDITION

Mathematics of the USSR-Izvestiya, 1967
In the present article we study finite groups whose non-primary maximal nilpotent subgroups have pairwise trivial intersection. The results obtained carry over to locally finite groups.
openaire   +2 more sources

Finiteness Conditions for Semigroups

1999
The study of finiteness conditions for semigroups consists in giving some conditions which are satisfied by finite semigroups and which are such as to assure the finiteness of them. In this study one of the properties which is generally required of a semigroup is that of being finitely generated.
Aldo de Luca, Stefano Varricchio
openaire   +1 more source

Finiteness Conditions for Modules

1987
In this book all rings considered are associative rings with unit unless otherwise stated. We write R for such a ring, 1 ∈ R is its unit element. A left R-module is an abelian group (the group law is denoted additively) with a scalar multiplication R × M → M, (a,x) ↦ ax satisfying the following properties: (1.) (a+b)x = ax + bx for x ∈ M, a, ∈ R
Constantin Nǎstǎsescu, Freddy van Oystaeyen   +1 more
openaire   +1 more source

Finiteness Conditions for Modules

1974
The first round of generalities is over, and it is now time for us to apply this formal machinery to the study of specific classes of rings and modules. We begin in this chapter with an investigation of the structure of classes of modules having certain natural finiteness properties. In the next chapter we return to the rings themselves.
Frank W. Anderson, Kent R. Fuller
openaire   +1 more source

Finiteness Conditions for Lattices

1987
Let ≤ denote a partial ordering on a nonempty set L and let < be defined by: a < b with a,b ∈ L if and only if a ≤ b and a ≠ b. If a,b ∈ L and b ≤ a then a is said to contain b. If M is a subset of L, then an a ∈ L such that x ≤ a, resp. a ≤ x, for all x ∈ M is said to be an upper, resp. lower, bound for the set M.
Constantin Nǎstǎsescu, Freddy van Oystaeyen   +1 more
openaire   +1 more source

Finiteness conditions

2023
openaire   +1 more source

Intermittent fasting in the prevention and treatment of cancer

Ca-A Cancer Journal for Clinicians, 2021
Katherine Clifton, Luigi Fontana, Lindsay L Peterson, Mscr   +2 more
exaly