Sciweavers

1679 search results - page 19 / 336
» Strong order equivalence
Sort
View
JSYML
2006
98views more  JSYML 2006»
13 years 9 months ago
On weak and strong interpolation in algebraic logics
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds but a s...
Saharon Shelah, Gábor Sági
ENTCS
2006
136views more  ENTCS 2006»
13 years 9 months ago
Priestley Duality for Strong Proximity Lattices
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are...
Mohamed A. El-Zawawy, Achim Jung
MSCS
2008
97views more  MSCS 2008»
13 years 9 months ago
Logical relations for monadic types
Abstract. Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs c...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...
IPMU
2010
Springer
13 years 11 months ago
On Elementary Extensions in Fuzzy Predicate Logics
Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We give a characterization of elementary equivalence in fuzzy predicate logics usin...
Pilar Dellunde, Francesc Esteva
MST
2008
119views more  MST 2008»
13 years 9 months ago
Logical Equivalence for Subtyping Object and Recursive Types
Subtyping in first order object calculi is studied with respect to the logical semantics obtained by identifying terms that satisfy the same set of predicates, as formalised throu...
Steffen van Bakel, Ugo de'Liguoro