اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStability and stable groups in continuous logic
169
0
0.0
(
0
)
تأليف
Itai Ben Yaacov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
قيم البحث
اقرأ أيضاً
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stones representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof of completen
ess theorem in propositional logic will be given using Stones theorem from Boolean algebra.
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of parameters i
n a standard way. The free right algebra F(L, C) of formulas over T(L, C) is then generated by atomic formulas. Structures for L over C are represented as perfect valuations of F(L, C), and theories of L are represented as filters of F(L). Finally Godels completeness theorem and first incompleteness theorem are stated as expected.
We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and we comple
tely determine the valid entailments among them. In contrast to the context of first-order logic on arbitrary structures, the order property and independence property are equivalent in this setting. McColm conjectured that least fixed-point definability collapses to first-order definability exactly when proficiency fails. McColms conjecture is known to be false in general. However, we show that McColms conjecture is true for any family of finite structures whose limit theory is model-theoretically tame.
We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness, ...). For exam
ple, if $M$ is a countable, $omega$-categorical structure and $Aut(M)$ is amenable, as a topological group, then the Lascar Galois group $Gal_{L}(T)$ of the theory $T$ of $M$ is compact, Hausdorff (also over any finite set of parameters), that is $T$ is G-compact. An essentially special case is that if $Aut(M)$ is extremely amenable, then $Gal_{L}(T)$ is trivial, so, by a theorem of Lascar, the theory $T$ can be recovered from its category $Mod(T)$ of models. On the side of definable groups, we prove for example that if $G$ is definable in a model $M$, and $G$ is definably amenable, then the connected components ${G^{*}}^{00}_{M}$ and ${G^{*}}^{000}_{M}$ coincide, answering positively a question from an earlier paper of the authors. We also take the opportunity to further develop the model-theoretic approach to topological dynamics, obtaining for example some new invariants for topological groups, as well as allowing a uniform approach to the theorems above and the various categories.
A logic satisfies the interpolation property provided that whenever a formula {Delta} is a consequence of another formula {Gamma}, then this is witnessed by a formula {Theta} which only refers to the language common to {Gamma} and {Delta}. That is, t
he relational (and functional) symbols occurring in {Theta} occur in both {Gamma} and {Delta}, {Gamma} has {Theta} as a consequence, and {Theta} has {Delta} as a consequence. Both classical and intuitionistic predicate logic have the interpolation property, but it is a long open problem which intermediate predicate logics enjoy it. In 2013 Mints, Olkhovikov, and Urquhart showed that constant domain intuitionistic logic does not have the interpolation property, while leaving open whether predicate Godel logic does. In this short note, we show that their counterexample for constant domain intuitionistic logic does admit an interpolant in predicate Godel logic. While this has no impact on settling the question for predicate Godel logic, it lends some credence to a common belief that it does satisfy interpolation. Also, our method is based on an analysis of the semantic tools of Olkhovikov and it is our hope that this might eventually be useful in settling this question.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
