• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 5 of 5

P-COMPACTNESS IN L-TOPOLOGICAL SPACES

by Fu-gui Shi, Communicated S. Romaguera
"... Abstract. The concepts of P-compactness, countable P-compactness, the P-Lindelöf property are introduced in L-topological spaces by means of preopen L-sets and their inequalities when L is a complete DeMorgan algebra. These definitions do not rely on the structure of the basis lattice L and no distr ..."
Abstract - Add to MetaCart
Abstract. The concepts of P-compactness, countable P-compactness, the P-Lindelöf property are introduced in L-topological spaces by means of preopen L-sets and their inequalities when L is a complete DeMorgan algebra. These definitions do not rely on the structure of the basis lattice L

Model checking with multi-valued logics

by Glenn Bruns, Patrice Godefroid , 2003
"... Abstract. In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorithms for multi-valued model checking. We first show how to reduce multi-valued model checking with any distribut ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
distributive DeMorgan lattice to standard, two-valued model check-ing. We then present a direct, automata-theoretic algorithm for multi-valued model checking with logics as expressive as the modal mu-calculus. As part of showing correctness of the algorithm, we present a new fun-damental result about extended

An example of L-fuzzy Join Space

by Ath. Kehagias - Rend. Circ. Mat. Palermo , 2001
"... On a generalized deMorgan lattice (X, _<, V, A,') we introduce a family of join hyperoperations *p, parametrized by a parameter p X. As a result we obtain a family of join spaces (X, ,p). We show that: for every a, b X the family {a*p b}pex can be considered as the p-cuts of a L-fuzzy set ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
On a generalized deMorgan lattice (X, _<, V, A,') we introduce a family of join hyperoperations *p, parametrized by a parameter p X. As a result we obtain a family of join spaces (X, ,p). We show that: for every a, b X the family {a*p b}pex can be considered as the p-cuts of a L-fuzzy set

Lifting assertion and consistency checkers from single to multiple viewpoints

by Michael Huth , 2002
"... Using a priority preorder on requirements or specifications, we lift established property-verification techniques of threevalued model checking from single to multiple viewpoints. This lift guarantees a maximal degree of autonomy and accountability to single views, automatically synthesizes single-a ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
proper denotational universe for this lift, show that their symmetric versions are DeMorgan lattices, and classify both structures through (idempotent) order-isomorphisms on (self-dual) priority preorders in the finite case. In particular, this lift generalizes Fitting’s multiple-valued semantics

Possibility Based Modal Semantics for Graded Modifiers

by Jorma K. Mattila
"... Abstract. A brief introduction to basic modifiers is given. Any modifier with its dual and the corresponding negation form a DeMorgan triple similar to that of t-norms, t-conorms, and negation. The lattice structure of the unit interval with the usual partial order is similar to that of the set of a ..."
Abstract - Add to MetaCart
Abstract. A brief introduction to basic modifiers is given. Any modifier with its dual and the corresponding negation form a DeMorgan triple similar to that of t-norms, t-conorms, and negation. The lattice structure of the unit interval with the usual partial order is similar to that of the set
Results 1 - 5 of 5
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University