On Boolean Lattices of Module Classes

2018 ◽  
Vol 25 (02) ◽  
pp. 285-294 ◽  
Author(s):  
Alejandro Alvarado-García ◽  
César Cejudo-Castilla ◽  
Hugo Alberto Rincón-Mejía ◽  
Ivan Fernando Vilchis-Montalvo ◽  
Manuel Gerardo Zorrilla-Noriega

Some properties of and relations between several (big) lattices of module classes are used in this paper to obtain information about the ring over which modules are taken. The authors reach characterizations of trivial rings, semisimple rings and certain rings over which every torsion theory is hereditary.

2007 ◽  
Vol 307 (2) ◽  
pp. 841-863 ◽  
Author(s):  
Riccardo Colpi ◽  
Enrico Gregorio ◽  
Francesca Mantese
Keyword(s):  

2021 ◽  
Vol 71 (3) ◽  
pp. 663-688
Author(s):  
Yuan Li ◽  
Hailou Yao
Keyword(s):  

Order ◽  
2017 ◽  
Vol 35 (2) ◽  
pp. 349-362
Author(s):  
Jun-Yi Guo ◽  
Fei-Huang Chang ◽  
Hong-Bin Chen ◽  
Wei-Tian Li

2011 ◽  
Vol 250-253 ◽  
pp. 3415-3420
Author(s):  
Xiao Bing Chen ◽  
Xiao Ming Huang ◽  
Jin Hu Tong

Based on the equivalence principle, the concentrated vertical load which acts on the Continuously Reinforced Concrete Pavement(CRCP) transverse crack is translated into the equivalent half-wave sine load by Fourier transform. According to the translation principle of the force, the half-wave sine vertical load acting on the CRCP transverse crack is decomposed to the half-wave sine vertical load and the torsion force acting on the center of CRCP. Lastly, the deflection, torsional displacement and stress formulas of CRCP under the concentrated vertical load with hollow foundation are put forward, which is on the basis of the small deflection theory of elastic thin plate and torsion theory. The results show that increasing the slab thickness is the most effective measure to reduce maximal deflection, distortion displacement and stress of CRCP concentrated vertical load with hollow foundation.


1996 ◽  
Vol 183 (1) ◽  
pp. 217-230 ◽  
Author(s):  
R.R. Colby ◽  
K.R. Fuller

2015 ◽  
Vol 16 (1) ◽  
pp. 111-138 ◽  
Author(s):  
NICOLAS SCHWIND ◽  
KATSUMI INOUE

AbstractWe address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR'08), 411–421; 2013b. Proc. of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'13), 264–276) adapted the well-known AGM framework (Alchourrón et al. 1985. Journal of Symbolic Logic 50, 2, 510–530) to LP revision. They identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result to disjunctive logic program and normal logic program revision operators.


1969 ◽  
Vol 10 (3) ◽  
pp. 235-238 ◽  
Author(s):  
William C. Nemitz
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document