2 resultados para COMPUTER SCIENCE, THEORY
em Repositório Científico da Universidade de Évora - Portugal
Resumo:
We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question Is there a set which will give an on-distributive but modular lattice? appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented.
Resumo:
We introduce a covariant approach in Minkowski space for the description of quarks and mesons that exhibits both chiral-symmetry breaking and confinement. In a simple model for the interquark interaction, the quark mass function is obtained and used in the calculation of the pion form factor. We study the effects of the mass function and the different quark pole contributions on the pion form factor.