The ubiquitous schema ‘All Fs are Gs’ dominates much philosophical discussion on laws but rarely is it shown how actual laws mentioned and used in science are supposed to fit it. After consideration of a variety of laws, including those obviously conditional and those superficially not conditional (such as equations), I argue that we have good reason to support the traditional interpretation of...

Let $T$ be a polynomially bounded o-minimal theory extending the of real closed ordered fields. $K$ model equipped with $T$-convex valuation ring and $T$-derivation. If this derivation is continuous respect to topology, then we call $T$-differential field. We show that every field has an immediate strict extension which spherically complete. In some important cases, assumption polynomial bounde...

We study the action of Hamiltonian diffeomorphisms a compact symplectic manifold ($X,\omega$) on $C^\infty(X)$ and functions $C^\infty(X)\to \mathbb R$. describe various properties invariant convex $C^\infty(X)$. Among other things we show that continuous R$ are under automatically so called strict rearrangements they in sup norm topology $C^\infty(X)$; but this is not generally true if convexi...

Recently, the tremendous growth in processor, memory, and wireless technology have enabled the development of distributed networks of small, lightweight and cost effective nodes that are capable of sensing the data, computing according to need. Wireless sensor networks (WSNs) are collections of a large amount of small devices equipped with integrated sensing and wireless communication capabilit...

What is a non-strict functional language? Is a non-strict language necessarily lazy? What additional expressiveness brings non-strictness, with or without laziness? This paper tries to shed some light on these questions. First, in order to characterize non-strictness, di1erent evaluation strategies are introduced: strict, lazy, and lenient. Then, using program examples, how these evaluation str...

Non-strict evaluation improves the expressive power of functional languages at the expense of an apparent loss of eeciency. In this paper we give examples of this expressive power, taking as an example an interactive functional program and describing the programming techniques depending on non-strict evaluation which improved its design. Implementation methods for non-strict languages have deli...

Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed system that permits to cope with arbitrary malicious behaviors. We consider the well known problem of constructing a maximum metri...

let g = (v,e) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. in this paper, we associate a topology to g, called graphic topology of g and we show that it is an alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. then we investigate some properties of this topology. our motivation is to give an e...

This paper introduces a new approach to topology, based on category theory and universal algebra, and called categorically-algebraic (catalg) topology. It incorporates the most important settings of lattice-valued topology, including poslat topology of S.~E.~Rodabaugh, $(L,M)$-fuzzy topology of T.~Kubiak and A.~v{S}ostak, and $M$-fuzzy topology on $L$-fuzzy sets of C.~Guido. Moreover, its respe...

We provide a necessary and sufficient condition for strict local minimisers of differences of convex (DC) functions, as well as related results pertaining to characterisation of (non-strict) local minimisers, and uniqueness of global minimisers.