Related papers: Some definable types that cannot be amalgamated

This article discuss a class of tractable model in the form of polynomial type.

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…

Normalization fails in type theory with an impredicative universe of propositions and a proof-irrelevant propositional equality. The counterexample to normalization is adapted from Girard's counterexample against normalization of System F…

We identify the obstructions for the functoriality and the uniqueness of the totalization functor, (partially) defined on the category of simplicial objects in the homotopy category of a stable model category, and we use a result from the…

Motivated by examples in infinite group theory, we classify the finite groups whose subgroups can never be decomposed as direct products.

We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

If T is an model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.

In this paper we classify filiform associative algebras of degree $k$ over a field of characteristic zero. Moreover, we also classify naturally graded complex filiform and quasi-filiform nilpotent associative algebras which are described by…

For a complete, stable theory $T$ we construct, in a reasonably canonical way, a related stable theory $T^*$ which has higher independent amalgamation properties over the algebraic closure of the empty-set. The theory $T^*$ is an algebraic…

In this short note we prove that a saturated fusion system admitting some special type of automorphism is nilpotent. This generalizes classical results by J.G. Thompson.

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

We discuss a relation between bicomplexes and integrable models, and consider corresponding noncommutative (Moyal) deformations. As an example, a noncommutative version of a Toda field theory is presented.

We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.

We prove there exist infinitely many inequivalent fusion categories whose Grothendieck rings do not admit any pseudounitary categorifications.

We show that property (T) is not profinite, that is, we construct two finitely generated residually finite groups which have isomorphic profinite completions while one admits property (T) and the other does not. This settles a question…