Related papers: A note on noncompact logics

A conjecture of Berkovich asserts that every non-simple finite p-group has a non-inner automorphism of order p. This conjecture is far from being proved despite the great effort devoted to it. In this paper we prove it for p-groups of…

Let T be a complete first order theory in a countable relational language L . We assume relation symbols have been added to make each formula equivalent to a predicate. Adjoin a new unary function symbol sigma to obtain the language…

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 introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Using a graph representation of classical logic, the paper shows that the liar or Yablo pattern occurs in every semantic paradox. The core graph theoretic result generalizes theorem of Richardson, showing solvability of finite graphs…

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

We show that a topometric space $X$ is topometrically isomorphic to a type space of some continuous first-order theory if and only if $X$ is compact and has an open metric (i.e., satisfies that $\{p : d(p,U) < \varepsilon\}$ is open for…

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…

A finitely presented 1-ended group $G$ has {\it semistable fundamental group at infinity} if $G$ acts geometrically on a simply connected and locally compact ANR $Y$ having the property that any two proper rays in $Y$ are properly…

A classical theorem of Frucht states that any finite group appears as the automorphism group of a finite graph. In the quantum setting the problem is to understand the structure of the compact quantum groups which can appear as quantum…

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…

We investigate some situation in which automorphisms of a group G are uniquely determined by their restrictions to a proper subgroup H. Much of the paper is devoted to studying under which additional hypotheses this property forces G to be…

Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…

A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…

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…

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Rabi and Sherman [RS97,RS93] proved that the hardness of factoring is a sufficient condition for there to exist one-way functions (i.e., p-time computable, honest, p-time noninvertible functions; this paper is in the worst-case model, not…

In 1992, David Wright proved a remarkable theorem about which contractible open manifolds are covering spaces. He showed that if a one-ended open manifold M has pro-monomorphic fundamental group at infinity which is not pro-trivial and is…

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory