Results 1  10
of
191,755
Natural Deduction
, 1999
"... This paper presents a theoretical analysis of natural deduction. First, a brief description will be given of a natural deduction system for sentential logic (i.e., no quantifiers or variables). Then it will be shown how to extend it to firstorder logic using skolemization and unification. ..."
Abstract
 Add to MetaCart
This paper presents a theoretical analysis of natural deduction. First, a brief description will be given of a natural deduction system for sentential logic (i.e., no quantifiers or variables). Then it will be shown how to extend it to firstorder logic using skolemization and unification.
Natural deduction
, 1999
"... Most automated theorem provers are clausalform provers based on variants of resolutionrefutation. In my [1990], I described the theorem prover OSCAR that was based instead on natural deduction. Some limited evidence was given suggesting that OSCAR was suprisingly efficient. The evidence consisted o ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Most automated theorem provers are clausalform provers based on variants of resolutionrefutation. In my [1990], I described the theorem prover OSCAR that was based instead on natural deduction. Some limited evidence was given suggesting that OSCAR was suprisingly efficient. The evidence consisted
Skolemization and Unification in Natural Deduction
"... This paper presents a theoretical analysis of natural deduction. First, a brief description will be given of a natural deduction system for sentential logic (i.e., no quantifiers or variables). Then it will be shown how to extend it to firstorder logic using skolemization and unification. Skolemiza ..."
Abstract
 Add to MetaCart
This paper presents a theoretical analysis of natural deduction. First, a brief description will be given of a natural deduction system for sentential logic (i.e., no quantifiers or variables). Then it will be shown how to extend it to firstorder logic using skolemization and unification
B.: Contextual natural deduction
 In: LFCS
, 2013
"... Abstract. This paper defines the contextual natural deduction calculus NDc for the implicational fragment of intuitionistic logic. NDc extends the usual natural deduction calculus (here called ND) by allowing the implication introduction and elimination rules to operate on formulas that occur inside ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper defines the contextual natural deduction calculus NDc for the implicational fragment of intuitionistic logic. NDc extends the usual natural deduction calculus (here called ND) by allowing the implication introduction and elimination rules to operate on formulas that occur
Natural Deduction for Belief at Most
"... We present a new approach to the logic of at most, introducing the notion of parametric propositions to modal natural deduction proofs. We apply the method with a natural deduction formulation of the doxastic logic N , a new system in the "only knowing" family. Using parametric proo ..."
Abstract
 Add to MetaCart
We present a new approach to the logic of at most, introducing the notion of parametric propositions to modal natural deduction proofs. We apply the method with a natural deduction formulation of the doxastic logic N , a new system in the "only knowing" family. Using parametric
An Explicit Natural Deduction
, 1998
"... The typed calculus and the natural deduction are isomorph. There is a mapping (the CurryHoward's isomorphism) between each others. This paper shows that the typed calculi with explicit substitutions are isomorph to a logical deduction system which is equivalent to the natural deduction. This ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The typed calculus and the natural deduction are isomorph. There is a mapping (the CurryHoward's isomorphism) between each others. This paper shows that the typed calculi with explicit substitutions are isomorph to a logical deduction system which is equivalent to the natural deduction
Natural Deduction in Connectionist Systems
, 1994
"... The relation between logic and thought has long been controversial, but has recently influenced theorizing about the nature of mental processes in cognitive science. One prominent tradition argues that to explain the systematicity of thought we must posit syntactically structured representations ins ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
inside the cognitive system which can be operated upon by structure sensitive rules similar to those employed in systems of natural deduction. I have argued elsewhere that the systematicity of human thought might better be explained as resulting from the fact that we have learned natural languages which
Bidirectional Natural Deduction
 AI*IA Notizie
, 1993
"... The goal of this paper is to present a theorem prover able to perform both forward and backward reasoning supported by a well defined formal system. This system for bidirectional reasoning has been proved equivalent to Gentzen's classical system of propositional natural deduction. Thi ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The goal of this paper is to present a theorem prover able to perform both forward and backward reasoning supported by a well defined formal system. This system for bidirectional reasoning has been proved equivalent to Gentzen's classical system of propositional natural deduction
Natural deduction environment for Matita
"... Abstract. Matita is a proof assistant characterised by a rich, user extensible, output facility based on a widget for the rendering of MathML Presentation, and by the automatic handling of overloading by means of a flexible disambiguation mechanism. We show how to use these features to obtain a simp ..."
Abstract
 Add to MetaCart
simple learning environment for natural deduction, without modifying the source code or Matita. 1
NeuroEvolution and Natural Deduction
 in Proceedings of the First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks
, 2000
"... Natural deduction is essentially a sequential decision task, similar to many gameplaying tasks. Such a task is well suited to benefit from the techniques of neuroevolution. Symbiotic, Adaptive NeuroEvolution (SANE)(Moriarty and Miikkulainen 1996) has proven successful at evolving networks for suc ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Natural deduction is essentially a sequential decision task, similar to many gameplaying tasks. Such a task is well suited to benefit from the techniques of neuroevolution. Symbiotic, Adaptive NeuroEvolution (SANE)(Moriarty and Miikkulainen 1996) has proven successful at evolving networks
Results 1  10
of
191,755