Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- William P. Bechtel (1994). Natural Deduction in Connectionist Systems. Synthese 101 (3):433-463.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 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 are themselves syntactically structured. According to this view, symbols of natural language are external to the cognitive processing system and what the cognitive system must learn to do is produce and comprehend such symbols. In this paper I pursue that idea by arguing that ability in natural deduction itself may rely on pattern recognition abilities that enable us to operate on external symbols rather than encodings of rules that might be applied to internal representations. To support this suggestion, I present a series of experiments with connectionist networks that have been trained to construct simple natural deductions in sentential logic. These networks not only succeed in reconstructing the derivations on which they have been trained, but in constructing new derivations that are only similar to the ones on which they have been trained.Reading list | Discuss | Edit | Categorize |My bibliography
| Export citation | Other links: citeseer.ist.psu.edu blutner.de mechanism.ucsd.edu springerlink.com jstor.org | Scholar | At my library 
Similar books and articles
Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Ja?kowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks?the standard conduits of the method to a generation of philosophers?with an eye to determining what the ?essential characteristics? of natural deduction are.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: cs.ualberta.ca sfu.ca tandfonline.com dx.doi.org | Scholar | At my library | More options ...
| | Other links: cs.ualberta.ca sfu.ca tandfonline.com dx.doi.org | Scholar | At my library | More options ... The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity representation is rather independent of the underlying proof method, provided that some form of (analytic) cut is admissible. We will also discuss some generalisations of the system and compare it with other formalizations of linearity.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... A sequent calculus is given in which the management of weakening and contraction is organized as in natural deduction. The latter has no explicit weakening or contraction, but vacuous and multiple discharges in rules that discharge assumptions. A comparison to natural deduction is given through translation of derivations between the two systems. It is proved that if a cut formula is never principal in a derivation leading to the right premiss of cut, it is a subformula of the conclusion. Therefore it is sufficient to eliminate those cuts that correspond to detour and permutation conversions in natural deduction.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: jstor.org | Scholar | At my library | More options ...
| | Other links: jstor.org | Scholar | At my library | More options ... This is a companion paper to Braüner (2004b, Journal of Logic and Computation 14, 329–353) where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order hybrid logic.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Scholar | At my library | More options ...
| | Scholar | At my library | More options ... How natural is natural deduction?– Gentzen's system of natural deduction intends to fit logical rules to the effective mathematical reasoning in order to overcome the artificiality of deductions in axiomatic systems (¶ 2). In spite of this reform some of Gentzen's rules for natural deduction are criticised by psychologists and natural language philosophers for remaining unnatural. The criticism focuses on the principle of extensionality and on formalism of logic (¶ 3). After sketching the criticism relatively to the main rules, I argue that the criteria of economy, simplicity, pertinence etc., on which the objections are based, transcend the strict domain of logic and apply to arguments in general (¶ 4). (¶ 5) deals with Frege's critique of the concept of naturalness as regards logic. It is shown that this concept means a regression into psychologism and is exposed to the same difficulties as are: relativity, lack of precision, the error of arguing from `is' to `ought' (the naturalistic fallacy). Despite of these, the concept of naturalness plays the role of a diffuse ideal which favours the construction of alternative deductive systems in contrast to the platonic conception of logic (¶ 6).
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ... In this paper we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness, and we show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic. This natural deduction system is inspired both by Shoesmith and Smiley's multiple conclusion systems for classical logic and Girard's proofnets for linear logic.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: projecteuclid.org jstor.org dx.doi.org | Scholar | At my library | More options ...
| | Other links: projecteuclid.org jstor.org dx.doi.org | Scholar | At my library | More options ... This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE, we develop a natural deduction system for FDE. We then prove soundness and completeness of the system with respect to the semantics. The system neatly represents the four-valued semantics for FDE.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: projecteuclid.org:80 dx.doi.org | Scholar | At my library | More options ...
| | Other links: projecteuclid.org:80 dx.doi.org | Scholar | At my library | More options ... Connectionism was explicitly put forward as an alternative to classical cognitive science. The questions arise: how exactly does connectionism differ from classical cognitive science, and how is it potentially better? The classical “rules and representations” conception of cognition is that cognitive transitions are determined by exceptionless rules that apply to the syntactic structure of symbols. Many philosophers have seen connectionism as a basis for denying structured symbols. We, on the other hand, argue that cognition is too rich and flexible to be simulable by the exceptionless representation-level rules that classicism requires. However, this very richness of cognition requires syntactically structured representations—what philosophers call a language of thought. The natural mathematical characterization of neural networks comes from the theory of dynamical systems. We propose that the mathematics of dynamical systems, not the mathematics of algorithms, holds the key to how cognitive structure and cognitive processes can be realized in the physical structure and processes of a network.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: informaworld.com tandfonline.com dx.doi.org | Scholar | At my library | More options ...
| | Other links: informaworld.com tandfonline.com dx.doi.org | Scholar | At my library | More options ... The author presents a deduction system for Quantum Logic. This system is a combination of a natural deduction system and rules based on the relation of compatibility. This relation is the logical correspondant of the commutativity of observables in Quantum Mechanics or perpendicularity in Hilbert spaces.Contrary to the system proposed by Gibbins and Cutland, the natural deduction part of the system is pure: no algebraic artefact is added. The rules of the system are the rules of Classical Natural Deduction in which is added a control of contexts using the compatibility relation.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org jstor.org | Scholar | At my library | More options ... In this paper two different natural deduction systems forhybrid logic are compared and contrasted.One of the systems was originally given by the author of the presentpaper whereasthe other system under consideration is a modifiedversion of a natural deductionsystem given by Jerry Seligman.We give translations in both directions between the systems,and moreover, we devise a set of reduction rules forthe latter system bytranslation of already known reduction rules for the former system.
Reading list
| Discuss | Edit | Categorize | My bibliography | Export citation | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ...
| | Other links: springerlink.com dx.doi.org | Scholar | At my library | More options ... Discussion of William P. Bechtel, Natural deduction in connectionist systems
 Back
All discussions
Start a new thread
|
There are no threads in this forum |
Nothing in this forum yet.
