66 search results - page 4 / 14 » Closed fragments of provability logics of constructive theor... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
LFCS
2009
Springer
14 years 1 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
IJCAI
1989
13 years 8 months ago
1989
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
RTA
2005
Springer
14 years 25 days ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...