Sciweavers

446 search results - page 4 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
APAL
2005
135views more  APAL 2005»
13 years 10 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
PLPV
2009
ACM
14 years 7 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
LPAR
2005
Springer
14 years 4 months ago
On Interpolation in Existence Logics
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system ...
Matthias Baaz, Rosalie Iemhoff
LICS
2012
IEEE
12 years 1 months ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...
Deepak Garg, Valerio Genovese, Sara Negri
CSL
2010
Springer
13 years 12 months ago
Classical and Intuitionistic Subexponential Logics Are Equally Expressive
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
Kaustuv Chaudhuri