In this article we present a notion of “logical perfection”. We first describe through examples logical perfection extracted from the contemporary concept categoricity. Categoricity (in power) has become in past half century main driver ideas model theory, both mathematically (stability theory may be regarded as way approximating categoricity) and philosophically. two decades, categoricity noti...

We compute the fixed point action of a properly defined renormaliza-tion group transformation for the Schwinger model through an expansion in the gauge field. It is local, with couplings exponentially suppressed with the distance. We check its perfection by computing the 1-loop mass gap at finite spatial volume, finding only exponentially vanishing cut off effects, in contrast with the standard...

A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for P whose query complexity is bounded by a function of . In classifying the strongly testable graph properties, the first author and Shapira showed that any hereditary graph property (such as P the family of perfect graphs) is strongly testable. A property is easily testable if it is strongly testable ...

A profile is “a set of data often in graphic form portraying the significant features of something”. [Web88] Profiles can help us to quickly understand a person or entity better. In the development of computer-based applications, profiles are invaluable. They help us to understand the application – how it works, how well it works, whether it in fact works as we think it does, and whether it is ...

A pomonoid S is a monoid equipped with a partial order that is compatible with the binary operation. In the same way that M -acts over a monoid M correspond to the representation of M by transformations of sets, S-posets correspond to the representation of a pomonoid S by order preserving transformations of posets. Following standard terminology from the theories of R-modules over a unital ring...