We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
We show the non-arithmeticity of 1st order theories of lattices of n sentences modulo provable equivalence in a formal theory, of diagonalizable algebras of a wider class of arithm...
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...