Results 241 to 250 of about 10,393,784 (287)

Definability in Substructure Orderings, II: Finite Ordered Sets

Order, 2010
In this paper the authors study first-order definability in the ordered set \( \mathcal{P}\) of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. They prove, among other things, that for every finite poset \(P\), the set \(\{p,p^{\partial }\}\) is definable, where \(p\) and \( p^{\partial }\) are the isomorphism
Jaroslav Jezek, Ralph McKenzie
openaire   +1 more source

kth-Order Finite Automaton

IEEE Transactions on Electronic Computers, 1963
A kth-order finite automaton is an automaton whose next state is a function of its most recent k states as well as its present input. A procedure to test whether a given ordinary automaton is equivalent to some kth-order automaton is suggested.
openaire   +2 more sources

Finite partially-ordered quantification

Journal of Symbolic Logic, 1970
In [3] Henkin made the observation that certain second-order existential formulas may be thought of as the Skolem normal forms of formulas of a language which is first-order in every respect except its incorporation of a form of partially-ordered quantification. One formulation of this sort of language is the closure of a first-order language under the
openaire   +1 more source

ON LINEARLY ORDERED STRUCTURES OF FINITE RANK

Journal of Mathematical Logic, 2009
O-minimal structures have long been thought to occupy the base of a hierarchy of ordered structures, in analogy with the role that strongly minimal structures play with respect to stable theories. This is the first in an anticipated series of papers whose aim is the development of model theory for ordered structures of rank greater than one. A class of
Alf Onshuus, Charles Steinhorn
openaire   +3 more sources

Classification of Finite Coloured Linear Orderings

Order, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feresiano Mwesigye, John Kenneth Truss
openaire   +2 more sources

Orders of Gauss periods in finite fields

Applicable Algebra in Engineering, Communication and Computing, 1995
The problem of determining a fast algorithm to construct primitive roots in a finite field \({\mathbb F}_q\) of \(q\) elements is considered. All known algorithms for this problem work in two stages, first determining a small set guaranteed to contain a primitive element and, second, testing all elements of the set for primitivity.
Joachim von zur Gathen, Igor E. Shparlinski   +1 more
openaire   +2 more sources

Set of elements of finite order in a biprimitively finite group

Algebra and Logic, 1987
See the review in Zbl 0648.20040.
openaire   +3 more sources

On Information Lossless Automata of Finite Order

IEEE Transactions on Electronic Computers, 1965
Der Begriff des Automaten \glqq ohne Informationsverlust\grqq{} (information lossless) wird in einer allgemeinen Theorie codierender Graphen (coding graph) ohne Informationsverlust behandelt. Ein codierender Graph ist definiert als endlicher gerichteter Graph, dessen Kanten sämtlich markiert sind.
openaire   +1 more source

SUM OF ELEMENT ORDERS ON FINITE GROUPS OF THE SAME ORDER

Journal of Algebra and Its Applications, 2010
For a finite group G, let ψ(G) denote the sum of element orders of G. It is known that the maximum value of ψ on the set of groups of order n, where n is a positive integer, will occur at the cyclic group Cn. In this paper, we investigate the minimum value of ψ on the set of groups of the same order.
Amiri, H., Jafarian Amiri, S. M.
openaire   +2 more sources

Finite Ordered Sets

2012
Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas.
Caspard, Nathalie, Leclerc, Bruno, Monjardet, Bernard   +2 more
openaire   +2 more sources