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

Towards a pseudoequational proof theory

59   0   0.0 ( 0 )
 نشر من قبل Jorge Almeida
 تاريخ النشر 2017
  مجال البحث
والبحث باللغة English




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

A new scheme for proving pseudoidentities from a given set {Sigma} of pseudoidentities, which is clearly sound, is also shown to be complete in many instances, such as when {Sigma} defines a locally finite variety, a pseudovariety of groups, more generally, of completely simple semigroups, or of commutative monoids. Many further examples when the scheme is complete are given when {Sigma} defines a pseudovariety V which is {sigma}-reducible for the equation x=y, provided {Sigma} is enough to prove a basis of identities for the variety of {sigma}-algebras generated by V. This gives ample evidence in support of the conjecture that the proof scheme is complete in general.



قيم البحث

اقرأ أيضاً

246 - George Metcalfe 2011
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of Godel logic. The calculi are used to establish completeness and complexity results for these fragments.
155 - Gareth A. Jones 2019
Greenberg proved that every countable group $A$ is isomorphic to the automorphism group of a Riemann surface, which can be taken to be compact if $A$ is finite. We give a short and explicit algebraic proof of this for finitely generated groups $A$.
Building on earlier papers of several authors, we establish that there exists a universal constant $c > 0$ such that the minimal base size $b(G)$ of a primitive permutation group $G$ of degree $n$ satisfies $log |G| / log n leq b(G) < 45 (log |G| / l og n) + c$. This finishes the proof of Pybers base size conjecture. An ingredient of the proof is that for the distinguishing number $d(G)$ (in the sense of Albertson and Collins) of a transitive permutation group $G$ of degree $n > 1$ we have the estimates $sqrt[n]{|G|} < d(G) leq 48 sqrt[n]{|G|}$.
208 - Bruce Kleiner 2007
We give a new proof of Gromovs theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. Unlike the original proof, it does not rely on the Montgomery-Zippin-Yamabe structure theory of locally compact groups.
We exhibit a regular language of geodesics for a large set of elements of $BS(1,n)$ and show that the growth rate of this language is the growth rate of the group. This provides a straightforward calculation of the growth rate of $BS(1,n)$, which was initially computed by Collins, Edjvet and Gill in [5]. Our methods are based on those we develop in [8] to show that $BS(1,n)$ has a positive density of elements of positive, negative and zero conjugation curvature, as introduced by Bar-Natan, Duchin and Kropholler in [1].
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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