Sciweavers

551 search results - page 6 / 111
» Natural proofs
Sort
View
JAR
2010
123views more  JAR 2010»
13 years 8 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
APAL
2008
78views more  APAL 2008»
13 years 10 months ago
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
Koji Nakazawa, Makoto Tatsuta
TLCA
2007
Springer
14 years 3 months ago
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
Koji Nakazawa
NIPS
2007
13 years 11 months ago
Incremental Natural Actor-Critic Algorithms
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
Shalabh Bhatnagar, Richard S. Sutton, Mohammad Gha...
CADE
2008
Springer
13 years 11 months ago
Focusing in Linear Meta-logic
It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a va...
Vivek Nigam, Dale Miller