منابع مشابه
Notes on totally categorical theories
Cherlin, Harrington and Lachlan’s paper on ω0-categorical, ω0-stable theories ([CHL]) was the starting point of geometrical stability theory. The progress made since then allows us better to understand what they did in modern terms (see [PI]) and also to push the description of totally categorical theories further, (see [HR1, AZ1, AZ2]). The first two sections of what follows give an exposition...
متن کاملOn Ω 1 -categorical but Not Ω-categorical Theories
1 ABSTRACT By generalizing to model theory notions connected with dimension, it is shown that certain theories categorical in uncountable powers have countably many de-numerable isomorphism types which are arranged in an ω + 1 sequence under the ordering of the possibility of elementary imbedding. It is also shown that any countable elementary extension of a denumerable saturated model of a the...
متن کاملSupersimple Ω-categorical Groups and Theories
An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU -rank. Every definable subgroup is commensurable with an acl(∅)definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU -rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU -rank.
متن کاملProbabilistic Inference Modulo Theories
We present SGDPLL(T ), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently, propositional, equalities on discrete sorts, and inequalities, more specifically difference arithmetic, on bounded integers). While many solutions to probabilistic...
متن کاملProbabilistic Constraint Logic Theories
Probabilistic logic models are used ever more often to deal with the uncertain relations typical of the real world. However, these models usually require expensive inference procedures. Very recently the problem of identifying tractable languages has come to the fore. In this paper we consider the models used by the learning from interpretations ILP setting, namely sets of integrity constraints...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.266.23