Sciweavers

17 search results - page 3 / 4
» Countermodels from Sequent Calculi in Multi-Modal Logics
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
14 years 6 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
SLOGICA
2008
116views more  SLOGICA 2008»
14 years 9 months ago
Rough Sets and 3-Valued Logics
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Arnon Avron, Beata Konikowska
CSL
2006
Springer
15 years 1 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 9 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
SAT
2010
Springer
178views Hardware» more  SAT 2010»
15 years 1 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...