532 search results - page 38 / 107 » The Logic of Quasi-MV Algebras |
FROCOS
2007
Springer
14 years 4 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
CONCUR
2001
Springer
14 years 2 months ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...
BPSC
2009
13 years 11 months ago
2009
Process modelling systems are complex and difficult to compare. A key attribute of any process modelling formalism or tool is time which involves how it handles and represents tem...
FAC
2008
13 years 10 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
ENTCS
2006
13 years 10 months ago
2006
We refine our algebraic axiomatization in [8,9] of epistemic actions and epistemic update (notions defined in [5,6] using Kripke-style semantics), to incorporate a mechanism for d...