Assume$G\prec H$are groups and${\cal A}\subseteq {\cal P}(G),\ {\cal B}\subseteq {\cal P}(H)$are algebras of sets closed under left group translation. Under some additional assumptions we find algebraic connections between the Ellis [semi]groups of theG-flow$S({\cal A})$and theH-flow$S({\cal B})$. We apply these results in the model theoretic context. Namely, assumeGis a group definable in a modelMand$M\prec ^* N$. Using weak heirs and weak coheirs we point out some algebraic connections between the Ellis semigroups$S_{ext,G}(M)$and$S_{ext,G}(N)$. Assuming every minimal left ideal in$S_{ext,G}(N)$is a group we prove (...) that the Ellis groups of$S_{ext,G}(M)$are isomorphic to closed subgroups of the Ellis groups of$S_{ext,G}(N)$. (shrink)

Assume G is a superstable locally modular group. We describe for any countable model M of Th(G) the quotient group G(M) / Gm(M). Here Gm is the modular part of G. Also, under some additional assumptions we describe G(M) / Gm(M) relative to G⁻(M). We prove Vaught's Conjecture for Th(G) relative to Gm and a finite set provided that ℳ(G) = 1 and the ring of pseudoendomorphisms of G is finite.

T is stable. We define the notion of meager regular type and prove that a meager regular type is locally modular. Assuming I < 2o and G is a definable abelian group with locally modular regular generics, we prove a counterpart of Saffe's conjecture. Using these results, for superstable T we prove the conjecture of vanishing multiplicities. Also, as a further application, in some additional cases we prove a conjecture regarding topological stability of pseudo-types over Q.

AssumeGis a group definable in a modelMof a stable theoryT. We prove that the semigroupSG of completeG-types overMis an inverse limit of some semigroups type-definable inMeq. We prove that the maximal subgroups ofSG are inverse limits of some definable quotients of subgroups ofG. We consider the powers of types in the semigroupSG and prove that in a way every type inSG is profinitely many steps away from a type in a subgroup ofSG.

Let [Formula: see text] be a monster model of an arbitrary theory [Formula: see text], let [Formula: see text] be any tuple of bounded length of elements of [Formula: see text], and let [Formula: see text] be an enumeration of all elements of [Formula: see text]. By [Formula: see text] we denote the compact space of all complete types over [Formula: see text] extending [Formula: see text], and [Formula: see text] is defined analogously. Then [Formula: see text] and [Formula: see (...) text] are naturally [Formula: see text]-flows. We show that the Ellis groups of both these flows are of bounded size, providing an explicit bound on this size. Next, we prove that these Ellis groups do not depend on the choice of the monster model [Formula: see text]; thus, we say that these Ellis groups are absolute. We also study minimal left ideals of the Ellis semigroups of the flows [Formula: see text] and [Formula: see text]. We give an example of a NIP theory in which the minimal left ideals are of unbounded size. Then we show that in each of these two cases, boundedness of a minimal left ideal is an absolute property and that whenever such an ideal is bounded, then in some sense its isomorphism type is also absolute. Under the assumption that [Formula: see text] has NIP, we give characterizations of when a minimal left ideal of the Ellis semigroup of [Formula: see text] is bounded. Then we adapt the proof of Theorem 5.7 in Definably amenable NIP groups, J. Amer. Math. Soc. 31 609–641 to show that whenever such an ideal is bounded, a certain natural epimorphism 863–932]) from the Ellis group of the flow [Formula: see text] to the Kim–Pillay Galois group [Formula: see text] is an isomorphism. We also obtain some variants of these results, formulate some questions, and explain differences which occur when the flow [Formula: see text] is replaced by [Formula: see text]. (shrink)

This is a continuation of [N2]. We find a Borel definition of Q-isolation. We pursue a topological and Scott analysis of pseudotypes on S(Q).

Assume that G is a definable group in a stable structure M. Newelski showed that the semigroup SG of complete types concentrated on G is an inverse limit of the ∞-definable semigroups SG,Δ. He also showed that it is strongly π-regular: for every p∈SG,Δ, there exists n∈N such that pn is in a subgroup of SG,Δ. We show that SG,Δ is in fact an intersection of definable semigroups, so SG is an inverse limit of definable semigroups, and that the (...) latter property is enjoyed by all ∞-definable semigroups in stable structures. (shrink)

We prove Vaught's conjecture for minimal trivial simple theories satisfying the generalized independence theorem.

We consider a small supersimple theory with a property (CS) (close to stability). We prove that if in such a theoryTthere is a typep∈S(A) (whereAis finite) withSU(p) = 1 and infinitely many extensions overacleq(A), then inTthere is a modular such type. Also, ifTis supersimple with (CS) andp∈S(∅) is isolated,SU(p) = 1 andphas infinitely many extensions overacleq(∅), thenpis modular.

Assume T is stable, small and Φ(x) is a formula of L(T). We study the impact on $T\lceil\Phi$ of naming finitely many elements of a model of T. We consider the cases of $T\lceil\Phi$ which is ω-stable or superstable of finite rank. In these cases we prove that if T has $ countable models and Q = Φ(M) is countable and atomic or saturated, then any good type in S(Q) is τ-stable. If $T\lceil\Phi$ is ω-stable and (bounded, 1-based or of (...) finite rank) with $I(T, \aleph_0) , then we prove that every good p ∈ S(Q) is τ-stable for any countable Q. The proofs of these results lead to several new properties of small stable theories, particularly of types of finite weight in such theories. (shrink)

In this paper we present the concept of neutrosophic quadruple algebraic structures. Specially, we study neutrosophic quadruple rings and we present their elementary properties.

We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism of the subsemigroups yields isomorphism of the underlying structures. We also prove that for some classes of computable structures, we can reconstruct a computable structure, up to computable isomorphism, from the isomorphism type of its inverse semigroup of (...) computable partial automorphisms. (shrink)

A formulation of relativistic quantum mechanics is presented independent of the theory of Hilbert space and also independent of the hypothesis of spacetime manifold. A hierarchy is established in the nondistributive lattice of physical ensembles, and it is shown that the projections relating different members of the hierarchy form a semigroup. It is shown how to develop a statistical theory based on the definition of a statistical operator. Involutions defined on the matrix representations of the semigroup are interpreted (...) in terms ofCPT conjugations. The theory of particles of spin one-half and systems with higher spin is developed from first principles. Methods are also developed for defining energy, momentum, orbital angular momentum, and weighted spacetime coordinates without reference to a manifold. (shrink)

We establish that the isomorphism problem for the classes of computable nilpotent rings, distributive lattices, nilpotent groups, and nilpotent semigroups is \-complete, which is as complicated as possible. The method we use is based on uniform effective interpretations of computable binary relations into computable structures from the corresponding algebraic classes.

The technique of covers is now well established in semigroup theory. The idea is, given a semigroup S, to find a semigroup having a better understood structure than that of S, and an onto morphism of a specific kind from to S. With the right conditions on , the behaviour of S is closely linked to that of . If S is finite one aims to choose a finite . The celebrated results for inverse semigroups of McAlister (...) in the 1970s form the flagship of this theory.Weakly left quasi-ample semigroups form a quasivariety (of algebras of type(2, 1)), properly containing the classes of groups, and of inverse, left ample, and weakly left ample semigroups. We show how the existence of finite proper covers for semigroups in this quasivariety is a consequence of Ashs powerful theorem for pointlike sets. Our approach is to obtain a cover of a weakly left quasi-ample semigroup S as a subalgebra of S × G, where G is a group. It follows immediately from the fact that weakly left quasi-ample semigroups form a quasivariety, that is weakly left quasi-ample. We can then specialise our covering results to the quasivarieties of weakly left ample, and left ample semigroups. The latter have natural representations as (2, 1)-subalgebras of partial (one-one) transformations, where the unary operation takes a transformation to the identity map in the domain of . In the final part of this paper we consider representations of weakly left quasi-ample semigroups. (shrink)

We give a commentary on Newelski's suggestion or conjecture [8] that topological dynamics, in the sense of Ellis [3], applied to the action of a definable group $G(M)$ on its “external type space” $S_{G,\textit{ext}}(M)$, can explain, account for, or give rise to, the quotient $G/G^{00}$, at least for suitable groups in NIP theories. We give a positive answer for measure-stable (or $fsg$) groups in NIP theories. As part of our analysis we show the existence of “externally definable” generics of $G(M)$ (...) for measure-stable groups. We also point out that for $G$ definably amenable (in a NIP theory) $G/G^{00}$ can be recovered, via the Ellis theory, from a natural Ellis semigroup structure on the space of global $f$-generic types. (shrink)

Relations between some theories of semigroups (also known as theories of strings or theories of concatenation) and arithmetic are surveyed. In particular Robinson's arithmetic Q is shown to be mutually interpretable with TC, a weak theory of concatenation introduced by Grzegorczyk. Furthermore, TC is shown to be interpretable in the theory F studied by Tarski and Szmielewa, thus confirming their claim that F is essentially undecidable.

Two approaches toward the arrow of time for scattering processes have been proposed in rigged Hilbert space quantum mechanics. One, due to Arno Bohm, involves preparations and registrations in laboratory operations and results in two semigroups oriented in the forward direction of time. The other, employed by the Brussels-Austin group, is more general, involving excitations and de-excitations of systems, and apparently results in two semigroups oriented in opposite directions of time. It turns out that these two time arrows can be (...) related to each other via Wigner's extensions of the spacetime symmetry group. Furthermore, their are subtle differences in causality as well as the possibilities for the existence and creation of time-reversed states depending on which time arrow is chosen. (shrink)

We consider the investigation of the embedding of semigroups in groups, a problem which spans the early-twentieth-century development of abstract algebra. Although this is a simple problem to state, it has proved rather harder to solve, and its apparent simplicity caused some of its would-be solvers to go awry. We begin with the analogous problem for rings, as dealt with by Ernst Steinitz, B. L. van der Waerden and Øystein Ore. After disposing of A. K. Sushkevich’s erroneous contribution in this (...) area, we present A. I. Maltsev’s example of a cancellative semigroup which may not be embedded in a group, which showed for the first time that such an embedding is not possible in general. We then look at the various conditions that were derived for such an embedding to take place: the sufficient conditions of Paul Dubreil and others, and the necessary and sufficient conditions obtained by A. I. Maltsev, Vlastimil Pták and Joachim Lambek. We conclude with some comments on the place of this problem within the theory of semigroups, and also within abstract algebra more generally. (shrink)

Hahn’s embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn’s theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative residuated chains which possess only finitely many idempotent elements. To this end, the partial lexicographic product construction is introduced to construct new odd involutive commutative residuated lattices from a pair of odd involutive commutative residuated lattices, and a representation theorem for odd involutive commutative residuated chains (...) which possess only finitely many idempotent elements, by means of linearly ordered abelian groups and the partial lexicographic product construction is presented. (shrink)

We investigate some topological properties of the spaces of classes of bounded type-definable equivalence relations.

Lascar described E KP as a composition of E L and the topological closure of E L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is an (...) affine copy of G and in M′ we have the structure of M and the action of G on X. We prove that the Lascar group of M′ is a semi-direct product of the Lascar group of M and G/G L . We discuss the relationship between G-compactness of M and M′. This example may yield new examples of non-G-compact theories. (shrink)

We interpret the basic notions of topological dynamics in the model-theoretic setting, relating them to generic types of definable group actions and their generalizations.

We investigate some relations between omitting types of a countable theory and some notions defined in terms of the real line, such as for example the ideal of meager subsets ofR. We also try to express connections between the logical structure of a theory and the existence of its countable models omitting certain families of types.It is well known that assuming MA we can omit (...) able to omit shrink)

The aim of this paper is to analyze time-asymmetric quantum mechanics with respect to the problems of irreversibility and of time's arrow. We begin with arguing that both problems are conceptually different. Then, we show that, contrary to a common opinion, the theory's ability to describe irreversible quantum processes is not a consequence of the semigroup evolution laws expressing the non-time-reversal invariance of the theory. Finally, we argue that time-asymmetric quantum mechanics, either in Prigogine's version or in Bohm's version, (...) does not solve the problem of the arrow of time because it does not supply a substantial and theoretically founded criterion for distinguishing between the two directions of time. (shrink)

We try to count the number of countable models M of T with a fixed set Q = φ (M) of realizations of a type φ. Also, for stable T, we define an ordinal rank M measuring multiplicity of types, with additivity properties similar to those of U-rank.

We propose a model-theoretic framework for investigating profinite groups. Within this framework we define and investigate small profinite groups. We consider the question if any small profinite group has an open abelian subgroup.

We prove weak elimination of imaginary elements for Boolean orderings with finitely many atoms. As a consequence we obtain equivalence of the two notions of o-minimality for Boolean ordered structures, introduced by C. Toffalori. We investigate atoms in Boolean algebras induced by algebraically closed subsets of Boolean ordered structures. We prove uniqueness of prime models in strongly o-minimal theories of Boolean ordered structures.

The aim of this paper is to analyze time-asymmetric quantum mechanics with respect to the problems of irreversibility and of time’s arrow. We begin with arguing that both problems are conceptually different. Then, we show that, contrary to a common opinion, the theory’s ability to describe irreversible quantum processes is not a consequence of the semigroup evolution laws expressing the non-time-reversal invariance of the theory. Finally, we argue that time-asymmetric quantum mechanics, either in Prigogine’s version or in Bohm’s version, (...) does not solve the problem of the arrow of time because it does not supply a substantial and theoretically founded criterion for distinguishing between the two directions of time. (shrink)

Assume T is a small superstable theory. We introduce the notion of a flat Morley sequence, which is a counterpart of the notion of an infinite Morley sequence in a type p, in case when p is a complete type over a finite set of parameters. We show that for any flat Morley sequence Q there is a model M of T which is τ-atomic over {Q}. When additionally T has few countable models and is 1-based, we prove that within (...) M there is an infinite Morley sequence I, with I $\subset$ dcl(Q), such that M is prime over I. (shrink)

Assume Q is a definable subset of a model of T. We define a notion of Q-isolated type, generalizing an earlier definition for countable Q. This notion is absolute. For superstable T, we give some sufficient conditions for the existence of Q-atomic models. We apply this to prove some results on weak categoricity over a predicate.

Does formal logic make sense?This text is a commentary on the book Logika i argumentacja. Praktyczny kurs krytycznego myślenia Logic and Argumentation. A Practical Course In Critical Thinking by Professor Andrzej Kisielewicz. Prof. Kisielewicz argues there, among other things, that formal symbolic logic is inadequate to explain practical rational reasoning. This commentary defends formal logic in this respect. In particular, Prof. Kisielewicz proposes in his book a definition of practical logical inference. According to him, a conclusion follows from a given (...) set of premises if there is no situation, where the premises hold, while the conclusion fails. In this commentary it is pointed out that this is a well-known notion of semantic inference in formal logic. It is also well-known that semantic and syntactic inference in logic are equivalent, i.e. equally strong. (shrink)

Assume T is a superstable theory with $ countable models. We prove that any *-algebraic type of M-rank > 0 is m-nonorthogonal to a *-algebraic type of M-rank 1. We study the geometry induced by m-dependence on a *-algebraic type p* of M-rank 1. We prove that after some localization this geometry becomes projective over a division ring F. Associated with p* is a meager type p. We prove that p is determined by p* up to nonorthogonality and that F (...) underlies also the geometry induced by forking dependence on any stationarization of p. Also we study some *-algebraic *-groups of M-rank 1 and prove that any *-algebraic *-group of M-rank 1 is abelian-by-finite. (shrink)

Ocherk 1. Voprosy ontologii -- Ocherk 2. Voprosy ėtiki i ėstetiki -- Ocherk 3. Voprosy gnoseologii i aksiologii.

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

For a quasi variety of algebras K, the Higman Theorem is said to be true if every recursively presented K-algebra is embeddable into a finitely presented K-algebra; the Generalized Higman Theorem is said to be true if any K-algebra which is recursively presented over its finitely generated subalgebra is embeddable into a K-algebra which is finitely presented over this subalgebra. We suggest certain general conditions on K under which the Higman Theorem implies the Generalized Higman Theorem; a finitely generated K-algebra (...) A is embeddable into every existentially closed K-algebra containing a finitely generated K-algebra B if and only if the word problem for A is Q-reducible to the word problem for B. The quasi varieties of groups, torsion-free groups, and semigroups satisfy these conditions. (shrink)