Sciweavers

91 search results - page 2 / 19
» The Complete Proof Theory of Hybrid Systems
Sort
View
SLOGICA
2008
126views more  SLOGICA 2008»
13 years 8 months ago
On the Proof Theory of the Modal mu-Calculus
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. First we recall an infinitary system which contains an omega rule allowing to de...
Thomas Studer
CADE
2004
Springer
14 years 1 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
ACL
1993
13 years 9 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
14 years 8 days ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
LPAR
2007
Springer
14 years 2 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki