ترغب بنشر مسار تعليمي؟ اضغط هنا

First order logic without equality on relativized semantics

84   0   0.0 ( 0 )
 نشر من قبل Mohamed Khaled
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let $alphageq 2$ be any ordinal. We consider the class $mathsf{Drs}_{alpha}$ of relativized diagonal free set algebras of dimension $alpha$. With same technique, we prove several important results concerning this class. Among these results, we prove that almost all free algebras of $mathsf{Drs}_{alpha}$ are atomless, and none of these free algebras contains zero-dimensional elements other than zero and top element. The class $mathsf{Drs}_{alpha}$ corresponds to first order logic, without equality symbol, with $alpha$-many variables and on relativized semantics. Hence, in this variation of first order logic, there is no finitely axiomatizable, complete and consistent theory.



قيم البحث

اقرأ أيضاً

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform substitution and are without side conditions.
We introduce a class of neighbourhood frames for graded modal logic embedding Kripke frames into neighbourhood frames. This class of neighbourhood frames is shown to be first-order definable but not modally definable. We also obtain a new definition of graded bisimulation with respect to Kripke frames by modifying the definition of monotonic bisimulation.
353 - Jaykov Foukzon 2015
In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In thi s article the non-classical resolution of Currys Paradox and Shaw-Kwei paradox without rejection any contraction postulate is proposed.
In this paper the 3-valued paraconsistent first-order logic QCiore is studied from the point of view of Model Theory. The semantics for QCiore is given by partial structures, which are first-order structures in which each n-ary predicate R is interpr eted as a triple of paiwise disjoint sets of n-uples representing, respectively, the set of tuples which actually belong to R, the set of tuples which actually do not belong to R, and the set of tuples whose status is dubious or contradictory. Partial structures were proposed in 1986 by I. Mikenberg, N. da Costa and R. Chuaqui for the theory of quasi-truth (or pragmatic truth). In 2014, partial structures were studied by M. Coniglio and L. Silvestrini for a 3-valued paraconsistent first-order logic called LPT1, whose 3-valued propositional fragment is equivalent to da Costa-DOtavianos logic J3. This approach is adapted in this paper to QCiore, and some important results of classical Model Theory such as Robinsons joint consistency theorem, amalgamation and interpolation are obtained. Although we focus on QCiore, this framework can be adapted to other 3-valued first-order logics.
We introduce the notion of first order amenability, as a property of a first order theory $T$: every complete type over $emptyset$, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the same variabl es. Amenability of $T$ follows from amenability of the (topological) group $Aut(M)$ for all sufficiently large $aleph_{0}$-homogeneous countable models $M$ of $T$ (assuming $T$ to be countable), but is radically less restrictive. First, we study basic properties of amenable theories, giving many equivalent conditions. Then, applying a version of the stabilizer theorem from [Amenability, connected components, and definable actions; E. Hrushovski, K. Krupi{n}ski, A. Pillay], we prove that if $T$ is amenable, then $T$ is G-compact, namely Lascar strong types and Kim-Pillay strong types over $emptyset$ coincide. This extends and essentially generalizes a similar result proved via different methods for $omega$-categorical theories in [Amenability, definable groups, and automorphism groups; K. Krupi{n}ski, A. Pillay] . In the special case when amenability is witnessed by $emptyset$-definable global Keisler measures (which is for example the case for amenable $omega$-categorical theories), we also give a different proof, based on stability in continuous logic. Parallel (but easier) results hold for the notion of extreme amenability.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا