Sciweavers

767 search results - page 54 / 154
» Logic for Mathematical Writing
Sort
View
ENTCS
2006
101views more  ENTCS 2006»
13 years 10 months ago
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories
It is common practice in both theoretical computer science and theoretical physics to describe the (static) logic of a system by means of a complete lattice. When formalizing the d...
Isar Stubbe
SLOGICA
2002
81views more  SLOGICA 2002»
13 years 9 months ago
Bicartesian Coherence
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...
Kosta Dosen, Zoran Petric
WWW
2005
ACM
14 years 10 months ago
Soundness proof of Z semantics of OWL using institutions
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
14 years 3 months ago
Behavioral Extensions of Institutions
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
Andrei Popescu, Grigore Rosu
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 10 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal