English
Related papers

Related papers: Some definable types that cannot be amalgamated

200 papers

We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a…

Discrete Mathematics · Computer Science 2015-08-20 Miguel Couceiro , Stephan Foldes , Gerasimos C. Meletiou

We provide here the first steps toward Classification Theory of Abstract Elementary Classes with no maximal models, plus some mild set theoretical assumptions, when the class is categorical in some lambda greater than its Lowenheim-Skolem…

Logic · Mathematics 2009-09-25 Saharon Shelah , Andrés Villaveces

We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…

Logic in Computer Science · Computer Science 2025-12-22 Chris Kapulkin , Yufeng Li

We construct inner amenable groups G with infinite conjugacy classes and such that the associated II_1 factor does not have property Gamma of Murray and von Neumann. This solves a problem posed by Effros in 1975.

Operator Algebras · Mathematics 2012-06-25 Stefaan Vaes

We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…

Logic · Mathematics 2023-09-14 Vince Guingona , Miriam Parnes , Lynn Scow

We introduce basic notions in category theory to type theorists, including comprehension categories, categories with attributes, contextual categories, type categories, and categories with families along with additional discussions that are…

Logic in Computer Science · Computer Science 2022-04-05 Tesla Zhang

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

In this work we characterize the combinatorial metrics admitting a MacWilliams-type identity and describe the group of linear isometries of such metrics. Considering coverings that are not connected, we classify the metrics satisfying the…

Information Theory · Computer Science 2017-03-27 Jerry Anderson Pinheiro , Roberto Assis Machado , Marcelo Firer

We show that it is impossible to classify topological conjugacy relation of minimal homeomorphisms on the torus by countable structures.

Dynamical Systems · Mathematics 2026-01-01 Bo Peng

We exhibit examples of triangulated categories which are neither the stable category of a Frobenius category nor a full triangulated subcategory of the homotopy category of a stable model category. Even more drastically, our examples do not…

Algebraic Topology · Mathematics 2011-11-09 Fernando Muro , Stefan Schwede , Neil Strickland

We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be derived from the underlying untyped equations. As a consequence, the…

Logic in Computer Science · Computer Science 2015-07-01 Damien Pous

We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.

Rings and Algebras · Mathematics 2009-09-25 Japheth Wood

We begin with a context more general than set theory. The basic ingredients are essentially the object and functor primitives of category theory, and the logic is weak, requiring neither the Law of Excluded Middle nor quantification. Inside…

Logic · Mathematics 2023-06-05 Frank Quinn

Adapting a claim of M. Kracht, we establish a characterization of the typable partial applicative algebras.

Logic · Mathematics 2009-09-30 P. H. Rodenburg , I. Bethke

We show that for quasivarieties of p-algebras the properties of (i) having decidable first-order theory and (ii) having decidable first-order theory of the finite members, coincide. The only two quasivarieties with these properties are the…

Logic · Mathematics 2024-09-16 Tomasz Kowalski , Katarzyna Słomczyńska

We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…

Logic · Mathematics 2022-01-10 Andreas Baudisch

(withdrawn.) For every lambda we give an explicit construction of an Abelian group with no non-trivial automorphisms. In particular the group absolutely has no non-trivial automorphisms, hence is absolutely indecomposable. Earlier we knew a…

Logic · Mathematics 2019-09-10 Saharon Shelah

We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…

Formal Languages and Automata Theory · Computer Science 2014-09-26 Timo Jolivet , Jarkko Kari

We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…

Logic · Mathematics 2012-05-16 Ilya V. Shulepov , Sergey V. Sudoplatov

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert
‹ Prev 1 4 5 6 7 8 10 Next ›