Related papers: Definably amenable groups in Continuous logic

In Dung-style abstract argumentation, various semantics capture notions of acceptability of arguments. The admissibility semantics capture the notion that an argument can be consistently defended from any potential counterargument. Weak…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue…

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…

In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.

Averaging linear functional on the space continuous functions of the group of diffeomorphisms of interval is found. Amenability of several discrete subgroups of the group of diffeomorphisms $\Diff^3([0,1])$ of interval is prove. In…

We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types)…

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized model-checking problems for various fragments of first-order…

We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a…

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…

This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…