Sciweavers

9 search results - page 2 / 2
» An Intuitionistic Logic that Proves Markov's Principle
Sort
View
AML
2002
94views more  AML 2002»
13 years 4 months ago
H-theories, fragments of HA and PA-normality
For a classical theory T, H(T) denotes the intuitionistic theory of T-normal (i.e. locally T) Kripke structures. S. Buss has asked for a characterization of the theories in the ra...
Morteza Moniri
TLCA
2009
Springer
13 years 11 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
WWW
2009
ACM
13 years 11 months ago
Instance-based probabilistic reasoning in the semantic web
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...
Pedro Oliveira, Paulo Gomes
IANDC
2006
103views more  IANDC 2006»
13 years 5 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...