scholarly journals Algebraic constructions of graph-based nested codes from protographs

Author(s):  
Christine A. Kelley ◽  
Jorg Kliewer
2021 ◽  
Author(s):  
Ivan Chajda ◽  
Helmut Länger

AbstractTogether with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that—similar to relatively pseudocomplemented lattices—these structures can serve as an algebraic semantics of certain intuitionistic logics. The aim of the present paper is to define congruences and filters in these structures, derive mutual relationships between them and describe basic properties of congruences in strongly sectionally pseudocomplemented posets. For the description of filters in both sectionally pseudocomplemented lattices and posets, we use the tools introduced by A. Ursini, i.e., ideal terms and the closedness with respect to them. It seems to be of some interest that a similar machinery can be applied also for strongly sectionally pseudocomplemented posets in spite of the fact that the corresponding ideal terms are not everywhere defined.


2009 ◽  
Vol 24 (07) ◽  
pp. 1309-1331 ◽  
Author(s):  
ANTON M. ZEITLIN

We show explicitly how Batalin–Vilkovisky Yang–Mills action emerges as a homotopy generalization of Chern–Simons theory from the algebraic constructions arising from string field theory.


2013 ◽  
Vol 197 (1) ◽  
pp. 199-214 ◽  
Author(s):  
Pavle V. M. Blagojević ◽  
Boris Bukh ◽  
Roman Karasev

1988 ◽  
Vol 31 (3) ◽  
pp. 287-300 ◽  
Author(s):  
Michel Hébert

AbstractLet be the category of all homomorphisms (i.e. functions preserving satisfaction of atomic formulas) between models of a set of sentences T in a finitary first-order language L. Functors between two such categories are said to be canonical if they commute with the forgetful functors. The following properties are characterized syntactically and also in terms of closure of for some algebraic constructions (involving products, equalizers, factorizations and kernel pairs): There is a canonical isomorphism from to a variety (resp. quasivariety) in a finitary expansion of L which assigns to a model its (unique) expansion. This solves a problem of H. Volger.In the case of a purely algebraic language, the properties are equivalent to:“ is canonically isomorphic to a finitary variety (resp. quasivariety)” and, for the variety case, to “the forgetful functor of is monadic (tripleable)”.


Sign in / Sign up

Export Citation Format

Share Document