Sciweavers

827 search results - page 23 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
UAI
2001
13 years 9 months ago
A Logic for Reasoning about Upper Probabilities
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...
Joseph Y. Halpern, Riccardo Pucella
ENTCS
2007
94views more  ENTCS 2007»
13 years 7 months ago
Matching of Bigraphs
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 7 months ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
JUCS
2010
114views more  JUCS 2010»
13 years 6 months ago
An Axiomatization of a First-order Branching Time Temporal Logic
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
Dragan Doder, Zoran Ognjanovic, Zoran Markovic
APAL
2010
113views more  APAL 2010»
13 years 7 months ago
Logic for update products and steps into the past
This paper provides a sound and complete proof system for a language Le+Y that adds to Dynamic Epistemic Logic (DEL) a discrete previous-time operator as well as single symbol for...
Joshua Sack