Results 11  20
of
1,488
Axioms of Causal Relevance
 Artificial Intelligence
, 1996
"... This paper develops axioms and formal semantics for statements of the form "X is causally irrelevant to Y in context Z," which we interpret to mean "Changing X will not affect Y if we hold Z constant." The axiomization of causal irrelevance is contrasted with the axiomization ..."
Abstract

Cited by 50 (14 self)
 Add to MetaCart
This paper develops axioms and formal semantics for statements of the form "X is causally irrelevant to Y in context Z," which we interpret to mean "Changing X will not affect Y if we hold Z constant." The axiomization of causal irrelevance is contrasted with the axiomization
BI as an Assertion Language for Mutable Data Structures
, 2000
"... Reynolds has developed a logic for reasoning about mutable data structures in which the pre and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O'Hea ..."
Abstract

Cited by 191 (14 self)
 Add to MetaCart
Reynolds has developed a logic for reasoning about mutable data structures in which the pre and postconditions are written in an intuitionistic logic enriched with a spatial form of conjunction. We investigate the approach from the point of view of the logic BI of bunched implications of O
Axioms for Weak Bialgebras
, 1998
"... Let (A; 1) be a finite dimensional unital associative algebra over a field K, which is also equipped with a coassociative counital coalgebra structure (\Delta; "). A is called a weak bialgebra if the coproduct \Delta : A ! A\Omega A satisfies \Delta(ab) = \Delta(a)\Delta(b). We do not require ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
Let (A; 1) be a finite dimensional unital associative algebra over a field K, which is also equipped with a coassociative counital coalgebra structure (\Delta; "). A is called a weak bialgebra if the coproduct \Delta : A ! A\Omega A satisfies \Delta(ab) = \Delta(a)\Delta(b). We do not require
Nominal Logic: A First Order Theory of Names and Binding
 Information and Computation
, 2001
"... This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal L ..."
Abstract

Cited by 219 (15 self)
 Add to MetaCart
This paper formalises within firstorder logic some common practices in computer science to do with representing and reasoning about syntactical structures involving named bound variables (as opposed to nameless terms, explicit substitutions, or higher order abstract syntax). It introduces Nominal
Fuzzy minimal separation axioms
 J. Nonlinear Sci. Appl
"... Abstract. In this paper, we deal with some separation axioms in the context of fuzzy minimal structures. 1. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper, we deal with some separation axioms in the context of fuzzy minimal structures. 1.
METRIC AXIOMS: A STRUCTURAL STUDY
"... For a fixed set X, an arbitrary weight structure d ∈ [0,∞]X×X can be interpreted as a distance assignment between pairs of points on X. Restrictions (i.e., metric axioms) on the behaviour of any such d naturally arise, such as separation, triangle inequality and symmetry. We present an ordertheore ..."
Abstract
 Add to MetaCart
For a fixed set X, an arbitrary weight structure d ∈ [0,∞]X×X can be interpreted as a distance assignment between pairs of points on X. Restrictions (i.e., metric axioms) on the behaviour of any such d naturally arise, such as separation, triangle inequality and symmetry. We present an order
Axioms for Building Durable Concrete Structures
"... this document is published in / Une version de ce document se trouve dans : Journal of Performance of Constructed Facilities ASCE, v. 17, no. 4, Nov. 2003, pp. 163166 http://irc.nrccnrc.gc.ca/ircpubs Axioms for Building Durable Concrete Structures Noel P. Mailvaganam and A Wiseman " Good ..."
Abstract
 Add to MetaCart
this document is published in / Une version de ce document se trouve dans : Journal of Performance of Constructed Facilities ASCE, v. 17, no. 4, Nov. 2003, pp. 163166 http://irc.nrccnrc.gc.ca/ircpubs Axioms for Building Durable Concrete Structures Noel P. Mailvaganam and A Wiseman "
Cut Elimination in the Presence of Axioms
 Bulletin of Symbolic Logic
, 1998
"... . A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to freevariable theories, covering all classical th ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
. A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to freevariable theories, covering all classical
Results 11  20
of
1,488