Results 1 to 10 of about 111 (111)
The spectrum of equivariant Kasparov theory for cyclic groups of prime order [PDF]
Annals of K-Theory, 2021 13 pages. A few other minor changes such as updated references.
Dell’ambrogio, Ivo, Meyer, Ralf
openaire +6 more sources
Prime models of theories of computable linear orderings [PDF]
Proceedings of the American Mathematical Society, 2001 We answer a long-standing question of Rosenstein by exhibiting a complete theory of linear orderings with both a computable model and a prime model, but no computable prime model. The proof uses the relativized version of the concept of limitwise monotonic function.
Denis R. Hirschfeldt +1 more
openaire +1 more source
Algebraic Theories of AUNU Permutation Using Group Action with Non- Prime Order
International Journal of Science for Global Sustainability, 2023 Permutation groups have played important roles in method of enumerating combinatorial objects in recent times. However, the study of the applicability AUNU permutation groups using group action is challenging. In this paper, a new method of constructing group action using the subsequences of (123)- avoiding of AUNU Permutation patterns is provided. The
A Dogondaji, A. Ibrahim
openaire +1 more source
Invariants for the modular cyclic group of prime order via classical invariant theory
Journal of the European Mathematical Society, 2013 Let \mathbb F be any field of characteristic p . It is well-known that there are exactly p inequivalent indecomposable representations V_1,V_2,\dots,V_p
openaire +4 more sources
A cohomological approach to theory of groups of prime power order [PDF]
Kodai Mathematical Journal, 1994 openaire +3 more sources
Some of the next articles are maybe not open access.
An algorithm for computing theory prime implicates in first order logic
International Journal of Information and Communication Technology, 2007An algorithm based on consensus method to compute the set of prime implicates of a quantifier free first order formula X was presented in an earlier work. In this paper the notion of prime implicates is extended to theory prime implicates in the first order case.
Arindama Singh, Manoj K. Raut
openaire +2 more sources
The theory of integer multiplication with order restricted to primes is decidable
Journal of Symbolic Logic, 1997AbstractWe show here that the first order theory of the positive integers equipped with multiplication remains decidable when one adds to the language the usual order restricted to the prime numbers. We see moreover that the complexity of the latter theory is a tower of exponentials, of height O(n).
openaire +2 more sources
Journal of Symbolic Logic, 1972
If T is a complete first-order totally transcendental theory then over every T-structure A there is a prime model unique up to isomorphism over A. Moreover M is a prime model over A iff: (1) every finite sequence from M realizes an isolated type over A, and (2) there is no uncountable indiscernible set over A in M.The existence of prime models was ...
openaire +2 more sources
If T is a complete first-order totally transcendental theory then over every T-structure A there is a prime model unique up to isomorphism over A. Moreover M is a prime model over A iff: (1) every finite sequence from M realizes an isolated type over A, and (2) there is no uncountable indiscernible set over A in M.The existence of prime models was ...
openaire +2 more sources