This article describes the solvability of HornSAT and CNFSAT. Unsatisfiable HornCNF have partially ordered set that is made by causation of each clauses. In this partially ordered set, Truth value assignment that is false in each clauses become simply connected space. Therefore, if we reduce CNFSAT to HornSAT, we must make such partially ordered set in HornSAT. But CNFSAT have correlations of e...

We report the direct soft chemical synthesis and characterization of a family of face centered cubic (fcc) and partially ordered face centered tetragonal (fct) FePt nanoparticles (NPs) suitable for biomedical applications. Both fcc and partially ordered fct-FePt NPs are synthesized by employing a simple polyol method. By using polyvinyl pyrolidone (PVP) as a stabilizer in various ratios during ...

We report the direct soft chemical synthesis and characterization of a family of face centered cubic (fcc) and partially ordered face centered tetragonal (fct) FePt nanoparticles (NPs) suitable for biomedical applications. Both fcc and partially ordered fct-FePt NPs are synthesized by employing a simple polyol method. By using polyvinyl pyrolidone (PVP) as a stabilizer in various ratios during ...

in this note by considering a complete lattice l, we define thenotion of an l-fuzzy hyperrelation on a given non-empty set x. then wedefine the concepts of (pom)l-fuzzy graph, hypergraph and subhypergroupand obtain some related results. in particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (pom)l-fuzzy subhypergroups ...

In this paper, some fixed point theorems for nonexpansive mappings in partially ordered spherically complete ultrametric spaces are proved. In addition, we investigate the existence of fixed points for nonexpansive mappings in partially ordered non-Archimedean normed spaces. Finally, we give some examples to discuss the assumptions and support our results.

In this paper, at rst we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability inv...