Sciweavers

1101 search results - page 46 / 221
» Forcing in proof theory
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 10 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
SCP
2011
255views Communications» more  SCP 2011»
13 years 4 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ICALP
2004
Springer
14 years 3 months ago
Towards an Algebraic Theory of Typed Mobile Processes
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
Yuxin Deng, Davide Sangiorgi
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 10 months ago
Stability in multidimensional Size Theory
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show...
Andrea Cerri, Patrizio Frosini, Claudia Landi
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
14 years 2 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson