1948 search results - page 322 / 390 » Formalizing Mirror Theory |
ENTCS
2007
13 years 10 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
ENTCS
2007
13 years 10 months ago
2007
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
ENTCS
2007
13 years 10 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
IJAR
2007
13 years 10 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
ALIFE
2005
13 years 10 months ago
2005
We present a novel formal interpretation of dynamical hierarchies based on information theory, in which each level is a near-state-determined system, and levels are related to one ...