Sciweavers

4217 search results - page 111 / 844
» Computational indistinguishability logic
Sort
View
SEBD
2003
159views Database» more  SEBD 2003»
14 years 11 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
WOLLIC
2009
Springer
15 years 4 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
TLCA
2001
Springer
15 years 2 months ago
Logical Properties of Name Restriction
We extend the modal logic of ambients described in [7] to the full ambient calculus, including name restriction. We introduce logical operators that can be used to make assertions ...
Luca Cardelli, Andrew D. Gordon
CIE
2007
Springer
15 years 2 months ago
Multi-valued Logics, Effectiveness and Domains
Abstract. Effective domain theory is applied to fuzzy logic to give suitable notions of semi-decidable and decidable L-subset. The connection with the notions of fuzzy Turing machi...
Giangiacomo Gerla
CSR
2006
Springer
15 years 1 months ago
Logic of Proofs for Bounded Arithmetic
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
Evan Goris