Related papers: Categoricity without Power
Let M, N be free modules over a Noetherian commutative ring R and let F be a field such that card(F) does not exceed the continuum. Then : (1) The assertion that [Any two F-vector spaces with isomorphic duals are isomorphic] is equivallent…
We use homotopy theory to define certain rational coefficients characteristic numbers with integral values, depending on a given prime number q and positive integer t. We prove the first nontrivial degree formula and use it to show that…
We give an example of an aleph-zero-categorical theory which is not G-compact. The countable model of this theory does not have AZ-enumerations.
We prove a model theoretic Baire category theorem for $\tilde\tau_{low}^f$-sets in a countable simple theory in which the extension property is first-order and show some of its applications. We also prove a trichotomy for minimal types in…
We investigate categoricity of abstract elementary classes without any remnants of compactness (like non-definability of well ordering, existence of E.M. models or existence of large cardinals). We prove (assuming a weak version of GCH…
We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…
We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all…
Let $\Lambda$ be an artin algebra and $\mathcal{C}$ be a functorially finite subcategory of mod$\Lambda$ which contains $\Lambda$ or $D\Lambda$. We use the concept of the infinite radical of $\mathcal{C}$ and show that $\mathcal{C}$ has an…
Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…
By using the relative derived categories, we prove that if an Artin algebra $A$ has a module $T$ with ${\rm inj.dim}T<\infty$ such that $^\perp T$ is finite, then the bounded derived category $D^b(A\mbox{-}{\rm mod})$ admits a categorical…
We provide a proof, in $ZFC$, of Shelah's eventual categoricity conjecture for abstract elementary classes (AEC's). Moreover, assuming in addition the Singular Cardinal Hypothesis ($SCH$), we prove a direct generalization to the more…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
Cardinality potentials are a generally useful class of high order potential that affect probabilities based on how many of D binary variables are active. Maximum a posteriori (MAP) inference for cardinality potential models is…
Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$-grading on $D$ a…
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 prove that any weakly idempotent complete $d$-exact category is equivalent to a $d$-cluster tilting subcategory of a weakly idempotent complete exact category, and that any weakly idempotent complete algebraic $(d+2)$-angulated category…
Eight categorical soundness and completeness theorems are established within the framework of algebraic theories. Exactly six of the eight deduction systems exhibit complete semantics within the cartesian monoidal category of sets. The…
Let $F$ be a number field, and $D$ be a quaternion $F$-algebra. We show that the class number of any residually unramified $O_F$-order (e.g. an Eichler order) in $D$ is divisible by the class number of $F$.
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…