Sciweavers

65 search results - page 6 / 13
» logcom 2006
Sort
View
LOGCOM
2006
58views more  LOGCOM 2006»
14 years 9 months ago
Proof Theory for Casari's Comparative Logics
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
George Metcalfe
LOGCOM
2006
90views more  LOGCOM 2006»
14 years 9 months ago
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
Nick Bezhanishvili, Balder ten Cate
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 9 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
LOGCOM
2002
85views more  LOGCOM 2002»
14 years 9 months ago
Fibring Labelled Deduction Systems
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
João Rasga, Amílcar Sernadas, Cristi...
70
Voted
LOGCOM
1998
110views more  LOGCOM 1998»
14 years 9 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting