نتایج جستجو برای: permutable

تعداد نتایج: 273  

Journal: :Theor. Comput. Sci. 1999
Roy Dyckhoff Luís Pinto

We prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuitionistic propositional logic (based on Kleene’s G3) are inter-permutable (using a set of basic “permutation reduction rules” derived from Kleene’s work in 1952) iff they determine the same natural deduction. The basic rules form a confluent and weakly normalising rewriting system. §

2010
B. M. Vernikov

We describe G-sets whose congruences satisfy some natural lattice or multiplicative restrictions. In particular, we determine G-sets with distributive, arguesian, modular, upper or lower semimodular congruence lattice as well as congruence n-permutable G-sets for n = 2, 2.5, 3.

2012
M. Medved L. Škripková

This paper deals with the stability problem of nonlinear delay difference equations with linear parts defined by permutable matrices. Several criteria for exponential stability of systems with different types of nonlinearities are proved. Finally, a stability result for a model of population dynamics is proved by applying one of them.

Journal: :Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 1992

Let H be a subgroup of a group G. H is said to be S-embedded in G if G has a normal T such that HT is an S-permutable subgroup of G and H ∩ T ≤ H sG, where H denotes the subgroup generated by all those subgroups of H which are S-permutable in G. In this paper, we investigate the influence of minimal S-embedded subgroups on the structure of finite groups. We determine the structure the finite grou...

2011
KEITH A. KEARNES YINGWEI LI

Let V be a finitely generated variety of algebras. We show that there is a finite bound on the size of the 〈R,S〉-irreducible sets of finite algebras in V iff V is congruence 3-permutable and has a near unanimity term operation of some arity.

2007
BRIAN A. DAVEY MARCEL JACKSON MIKLÓS MARÓTI RALPH N. MCKENZIE B. A. Davey R. S. Freese Brian A. Davey Marcel Jackson Miklós Maróti Ralph N. McKenzie K. A. Baker G. F. McNulty

We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید