Results 291 to 300 of about 205,593 (312)
Some of the next articles are maybe not open access.
2010
This Chapter is devoted to the description of standard systems of natural deduction (ND). After historical introduction in Section 2.1 we present some preliminary criteria which should be satisfied by any system of natural deduction. Sections 2.3 and 2.4 develop a systematization of existing systems based on two features: the kind of data used by a ...
openaire +1 more source
This Chapter is devoted to the description of standard systems of natural deduction (ND). After historical introduction in Section 2.1 we present some preliminary criteria which should be satisfied by any system of natural deduction. Sections 2.3 and 2.4 develop a systematization of existing systems based on two features: the kind of data used by a ...
openaire +1 more source
2010
In this Chapter there is a continual emphasis on the application of ND as a tool of proof search and possibly of automation. In particular, we take up the question of how to make ND a universal system. In order to find satisfactory solutions we compare ND with other types of DS’s.
openaire +1 more source
In this Chapter there is a continual emphasis on the application of ND as a tool of proof search and possibly of automation. In particular, we take up the question of how to make ND a universal system. In order to find satisfactory solutions we compare ND with other types of DS’s.
openaire +1 more source
Natural Deduction for Hybrid Logic
Journal of Logic and Computation, 2004In this paper, the author studies a natural deduction calculus for hybrid logic. The underlying language contains satisfaction operators \(\forall_a\) as well as binders \(\forall a\) and \(\downarrow a\), where \(a\) is any nominal. It turns out that certain first-order properties of the involved accessibility relation, originating from so-called ...
openaire +2 more sources
Natural Deduction and Curry's Paradox
Journal of Philosophical Logic, 2006Following Fitch, the author presents a natural deduction version of Curry's paradox, a well-known set-theoretic paradox that does not involve negation. She then discusses various restrictions proposed independently by Fitch and Prawitz to prevent the derivation of the paradox.
openaire +2 more sources
1991
This chapter demonstrates how the general theory of partitioned representations can be applied to some specific knowledge representation problems. It will be seen how the theory generalizes some existing AI knowledge representation systems, as well as some systems of logic. In particular, we will look at natural deduction, representing time and action,
openaire +1 more source
This chapter demonstrates how the general theory of partitioned representations can be applied to some specific knowledge representation problems. It will be seen how the theory generalizes some existing AI knowledge representation systems, as well as some systems of logic. In particular, we will look at natural deduction, representing time and action,
openaire +1 more source
Automated Natural Deduction in Thinker
Studia Logica, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2013
This paper defines the contextual natural deduction calculus \(\textbf{ND}^\textbf{c}\) for the implicational fragment of intuitionistic logic. \(\textbf{ND}^\textbf{c}\) extends the usual natural deduction calculus (here called \(\textbf{ND}\)) by allowing the implication introduction and elimination rules to operate on formulas that occur inside ...
openaire +1 more source
This paper defines the contextual natural deduction calculus \(\textbf{ND}^\textbf{c}\) for the implicational fragment of intuitionistic logic. \(\textbf{ND}^\textbf{c}\) extends the usual natural deduction calculus (here called \(\textbf{ND}\)) by allowing the implication introduction and elimination rules to operate on formulas that occur inside ...
openaire +1 more source