Results 261 to 270 of about 138,341 (311)
Some of the next articles are maybe not open access.
Deduction and deductive databases for geographic data handling
1993The representation of complex spatial domains in conventional databases suffers from fragmented representation of object structure, lack of instance-level spatial relationships, and the generation of large combinatoric search spaces in query analysis.
Alia I. Abdelmoty +2 more
openaire +1 more source
Bulletin of Symbolic Logic, 1996
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +2 more sources
AbstractThis is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The
openaire +2 more sources
Synthese, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Journal of Automated Reasoning, 1987
The main contribution of the paper is the goal-oriented hierarchical deduction proof procedure. The procedure proves a theorem by producing not just one but all the acceptable resolvents from the goal clause. There is a set of completeness-preserving refinements to constrain the generation of the irrelevant resolvents.
Tie-Cheng Wang, W. W. Bledsoe
openaire +1 more source
The main contribution of the paper is the goal-oriented hierarchical deduction proof procedure. The procedure proves a theorem by producing not just one but all the acceptable resolvents from the goal clause. There is a set of completeness-preserving refinements to constrain the generation of the irrelevant resolvents.
Tie-Cheng Wang, W. W. Bledsoe
openaire +1 more source
Journal of Philosophical Logic, 2012
For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the ...
openaire +1 more source
For deductive reasoning to be justified, it must be guaranteed to preserve truth from premises to conclusion; and for it to be useful to us, it must be capable of informing us of something. How can we capture this notion of information content, whilst respecting the fact that the content of the premises, if true, already secures the truth of the ...
openaire +1 more source
2000
Deduction is usually considered to be the opposite of induction. However, deduction and induction can be related in many ways. In this paper, two endeavors that try to relate discovery science and verification technology are described. The first is discovery by deduction, where attempts to find algorithms are made using verifiers.
Masami Hagiya, Koichi Takahashi
openaire +1 more source
Deduction is usually considered to be the opposite of induction. However, deduction and induction can be related in many ways. In this paper, two endeavors that try to relate discovery science and verification technology are described. The first is discovery by deduction, where attempts to find algorithms are made using verifiers.
Masami Hagiya, Koichi Takahashi
openaire +1 more source
Journal of Symbolic Logic, 1950
For Gentzen's natural deduction, a formalized method of deduction in quantification theory dating from 1934, these important advantages may be claimed: it corresponds more closely than other methods of formalized quantification theory to habitual unformalized modes of reasoning, and it consequently tends to minimize the false moves involved in seeking ...
openaire +2 more sources
For Gentzen's natural deduction, a formalized method of deduction in quantification theory dating from 1934, these important advantages may be claimed: it corresponds more closely than other methods of formalized quantification theory to habitual unformalized modes of reasoning, and it consequently tends to minimize the false moves involved in seeking ...
openaire +2 more sources
1993
It is often said that logic is the theory of deduction. While such a characterization may appear too narrow because, in our century, several new chapters have been added to logic, such as the theory of truth, definition, computation, communication, action etc., the theory of deduction remains a basic part of logic. The foundations of such a theory were
openaire +2 more sources
It is often said that logic is the theory of deduction. While such a characterization may appear too narrow because, in our century, several new chapters have been added to logic, such as the theory of truth, definition, computation, communication, action etc., the theory of deduction remains a basic part of logic. The foundations of such a theory were
openaire +2 more sources
Synthese, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Novelty in deductive databases
Journal of Logic and Computation, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grégoire, Éric, Marquis, Pierre
openaire +2 more sources