We offer an interpretation of the words and works of Richard Dedekind and the David Hilbert of around 1900 on which they are held to entertain diverging views on the structure of a deductive science. Firstly, it is argued that Dedekind sees the beginnings of a science in concepts, whereas Hilbert sees such beginnings in axioms. Secondly, it is argued that for Dedekind, the primitive terms of a science are substantive terms whose sense is to be conveyed by elucidation, (...) whereas Hilbert dismisses elucidation and consequently treats the primitives as schematic. (shrink)

This paper is an historical study of Tarski's methodology of deductive sciences (in which a logic S is identified with an operator Cn S, called the consequence operator, on a given set of expressions), from its appearance in 1930 to the end of the 1970s, focusing on the work done in the field by Roberto Magari, Piero Mangani and by some of their pupils between 1965 and 1974, and comparing it with the results achieved by Tarski and the (...) Polish school (Łoś, Suszko, Słupecki, Pogorzelski, Wójcicki). In the last section of the paper we will then compare these works with some recent developments in algebraic logic: this will lead to a better understanding of the results of the methodology of deductive science, but at the same time will show some intrinsic limits to such an approach to logic. Even if Magari's work on diagonizable algebras and universal algebra and Mangani's axiomatization of MV-algebras and results in model theory are rather famous, the articles on closure operators, published in the 1960s, are almost totally unknown outside Italy (mainly because of a linguistic limitation, the papers we analyse having been written and published in Italian). This paper aims to fill the gap in the literature and to enable the international community to get acquainted with this part of Italian logic. The same applies to some works published in Barcelona (in Catalan) at the end of the 1970s, analysed in the last section. (shrink)

This classic undergraduate treatment examines the deductive method in its first part and explores applications of logic and methodology in constructing mathematical theories in its second part. Exercises appear throughout.

Ever since Aristotle it has been accepted that there exists a combination of inductive and deductive reasoning and a sort of unified inductive-deductive methodology. If one analyzes the procedures and logic of scientific explanation and the methods of generating and justifying scientific knowledge, one recognizes the prototype of philosophy of science found in Aristotle’s inductive and deductive procedure that is described in his Posterior Analytics, Physics and Metaphysics, where heviewed scientific inquiry as a progression from observations to (...) general principles and back to observation. He maintained that the scientist should induce explanatory principles from the phenomena to be explained, and then deduce statements about the phenomena from premisses which include these principles. (shrink)

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. (shrink)

This paper reviews the recent history of a subset of research in dynamical cognitive science, in particular that subset that allies itself with the sciences of complexity and casts cognitive systems as interaction dominant, noncomputational, and nonmodular. I look at this history in the light of C.S. Peirce's understanding of scientific reasoning as progressing from abduction to deduction to induction. In particular, I examine the development of a controversy concerning the use of the interaction dominance of human cognitive systems (...) as an explanation of the ubiquitous 1/f noise, multifractality, and complexity matching in human behavior. (shrink)

The articles in this volume deal with the main inferential methods that can be applied to different kinds of experimental evidence.

The distinction between the syntactic and the semantic approach to scientific theories emerged in formal philosophy of science. The semantic approach is commonly considered more advanced and more successful than the syntactic one, but the transition from the one approach to the other was not brought about without any loss. In essence, it is the formal analysis of atomic propositions and the analysis of deductive reasoning that dropped out of consideration in at least some of the elaborated versions of (...) the semantic approach. In structuralist theory of science, as founded by Sneed and Stegmüller, the focus is on global propositions concerning the question of whether or not certain empirical systems satisfy a set-theoretic predicate that encodes the axioms of a scientific theory. Hence, an analysis of deductive reasoning from atomic premisses with the help of a given theory is missing. The objective of the present paper is to develop a deductive system on the basis of the structuralist framework. This system comes with a novel formulation of empirical propositions in structuralism. (shrink)

Dedekind’s methodology, in his classic booklet on the foundations of arithmetic, has been the topic of some debate. While some authors make it closely analogue to Hilbert’s early axiomatics, others emphasize its idiosyncratic features, most importantly the fact that no axioms are stated and its careful deductive structure apparently rests on definitions alone. In particular, the so-called Dedekind “axioms” of arithmetic are presented by him as “characteristic conditions” in the _definition_ of the complex concept of a _simply infinite_ system. (...) Making sense of Dedekind’s method may be dependent on an analysis of the classical model of deductive science, as presented by authors from the eighteenth and early nineteenth centuries. Studying the modern reconstructions of Euclidean geometry, we show that they did not presuppose deductive independence of the axioms from the definitions. Authors like Wolff elaborated a mathematics _based on definitions_, and the Wolffian model of deductive science shows significant coincidences with Dedekind’s method, despite the great differences in content and approach. Wolff had a conception of definitions as _genetic_, which bears some similarities with Kant’s idea of synthetic definitions: they are understood as positing the content of mathematical concepts and introducing thought objects (_Gedankendinge_) that are the objects of mathematics. The emphasis on the spontaneity of the understanding, which can be found in this philosophical tradition, can also be fruitfully related with Dedekind’s idea of the “free creation” of mathematical objects. (shrink)

Robert Pippin's recent study of Hegel's Logic, Hegel's Realm of Shadows, argues that we should read Hegel as rejecting the need for a Transcendental Deduction in logic because he takes Hegel, in the Phenomenology of Spirit, to have ruled out the scepticism that motivates Kant's Deduction. By contrast, I argue, we cannot understand what Pippin calls the ‘identity’ of logic and metaphysics in the Science of Logic unless we see how Hegel does provide a kind of Deduction argument in the (...) Logic, albeit one stripped of the psychologism present in the Kantian version. Accordingly, I provide a sketch of what such an ‘absolute’ Deduction must look like, and argue that Hegel's presentation of the ‘absolute idea’ functions as the conclusion of such an argument. (shrink)

This paper examines whether Sherlock Holmes’ “Science of Deduction and Analysis,” as reconstructed by Hintikka and Hintikka The sign of three: Peirce, Dupin, Holmes, Indiana University Press, Bloomington, 1983), exemplifies a logic of discovery. While the Hintikkas claimed it does, their approach remained largely programmatic, and ultimately unsuccessful. Their reconstruction must thus be expanded, in particular to account for the role of memory in inquiry. Pending this expansion, the Hintikkas’ claim is vindicated. However, a tension between the naturalistic aspirations of (...) their model and the formal apparatus they built it on is identified. The paper concludes on suggestions for easing this tension without losing the normative component of the Hintikkas’ epistemological model. (shrink)

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division (...) of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators ) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators ), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames ), MT), MD), MB), MK4) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames ), MS5).Results of the second type consist of designing concrete deductive systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule, 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 purely (...) inductive dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

The discussion on mathematical explanation has inherited the same sense of dissatisfaction that philosophers of science expressed, in the context of scientific explanation, towards the deductive-nomological model. This model is regarded as unable to cover cases of bona fide mathematical explanations and, furthermore, it is largely ignored in the relevant literature. Surprisingly, the reasons for this ostracism are not sufficiently manifest. In this paper I explore a possible extension of the model to the case of mathematical explanations and I (...) claim that there are at least two reasons to judge the deductive-nomological picture of explanation as inadequate in that context. (shrink)

Our goal is to develop a syntactical apparatus for propositional logics in which the accepted and rejected propositions have the same status and obeying treated in the same way. The suggested approach is based on the ideas of Łukasiewicz used for the classical logic and in addition, it includes the use of multiple conclusion rules. More precisely, a consequence relation is defined on a set of statements of forms “proposition _A_ is accepted” and “proposition _A_ is rejected”, where _A_ is (...) a proposition,—a unified consequence relation. Accordingly, the rules defining a unified consequence relation,—the unified rules, have statements as premises and as conclusions. A special attention is paid to the logics in which each proposition is either accepted or rejected. If we express this property via unified rules and add them to a unified deductive system, such a unified deductive system defines a reversible unified consequence: a statement “proposition _B_ is accepted” is derived from the statement “proposition _A_ is accepted” if and only if a statement “proposition _A_ is rejected” is derived from the statement “proposition _B_ is rejected”. (shrink)

If ever there were scientific procedures that seemed immune to history, induction and deduction would be them. Their validity seemingly unimpinged by the vicissitudes of history, they appear a proper subject of discussion for philosophers and scientists, but not for historians. Historians pride themselves on demonstrating that the internal logic of theory is historical — a response to particular conditions. Breakdowns in logic present historians with opportune moments for historicization, for showing how theoreticians’ efforts to respond to their situation made (...) them move inconsistently. When it comes to induction and deduction, however, they seem so universal and basic — the logic and methodology of science unthinkable without them — that any effort to demonstrate their historically bound character risks relativizing science and, some would argue, undermine rational exchange. Can the historian participate, qua historian, in the conversation on induction and deduction without unraveling science and undermining rational exchange? (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...) `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

This short blog article presents a solution to the “Scandal of Deduction,” the counter-intuitive finding that no new information is generated by either deduction or deterministic computation. I argue that, since physical computation necessarily involves communications, we cannot expect computation to reduce our uncertainty until it has been completed and its output received as a “message.” This has a number of implications for how we understand semantic theories of information.

A proof of ‘correctness’ for a mathematical algorithm cannot be relevant to executions of a program based on that algorithm because both the algorithm and the proof are based on assumptions that do not hold for computations carried out by real-world computers. Thus, proving the ‘correctness’ of an algorithm cannot establish the trustworthiness of programs based on that algorithm. Despite the (deceptive) sameness of the notations used to represent them, the transformation of an algorithm into an executable program is a (...) wrenching metamorphosis that changes a mathematical abstraction into a prescription for concrete actions to be taken by real computers. Therefore, it is verification of program executions (processes) that is needed, not of program texts that are merely the scripts for those processes. In this view, verification is the empirical investigation of: (a) the behavior that programs invoke in a computer system and (b) the larger context in which that behavior occurs. Here, deduction can play no more, and no less, a role than it does in the empirical sciences. (shrink)

In this paper I explore the ways in which Alexander of Aphrodisias employs and develops so-called ‘common notions’ as reliable starting points of deductive arguments. He combines contemporary developments in the Stoic and Epicurean use of common notions with Aristotelian dialectic, and axioms. This more comprehensive concept of common notions can be extracted from Alexander’s commentary on Metaphysics A 1–2. Alexander puts Aristotle’s claim that ‘all human beings by nature desire to know’ in a larger deductive framework, and (...) adds weight to Aristotle’s use of the common understanding of the notion of ‘wisdom’. Finally I will indicate how these upgraded common notions are meant to play an important role in the general framework of metaphysics as a science. (shrink)

Probabilistic models have started to replace classical logic as the standard reference paradigm in human deductive reasoning. Mental probability logic emphasizes general principles where human reasoning deviates from classical logic, but agrees with a probabilistic approach (like nonmonotonicity or the conditional event interpretation of conditionals). -/- This contribution consists of two parts. In the first part we discuss general features of reasoning systems including consequence relations, how uncertainty may enter argument forms, probability intervals, and probabilistic informativeness. These concepts are (...) of central importance for the psychological task analysis. In the second part we report new experimental data on the paradoxes of the material conditional, the probabilistic modus ponens, the complement task, and data on the probabilistic truth table task. The results of the experiments provide evidence for the hypothesis that people represent indicative conditionals by conditional probability assertions. (shrink)

It has been the dominant view that probabilistic explanations of particular facts must be inductive in character. I argue here that this view is mistaken, and that the aim of probabilistic explanation is not to demonstrate that the explanandum fact was nomically expectable, but to give an account of the chance mechanism(s) responsible for it. To this end, a deductive-nomological model of probabilistic explanation is developed and defended. Such a model has application only when the probabilities occurring in covering (...) laws can be interpreted as measures of objective chance, expressing the strength of physical propensities. Unlike inductive models of probabilistic explanation, this deductive model stands in no need of troublesome requirements of maximal specificity or epistemic relativization. (shrink)

Deduction Versus Discourse: Newton and the Cosmic Phenomena Content Type Journal Article Pages 1-16 DOI 10.1007/s10699-011-9283-2 Authors Pierre Kerszberg, University of Toulouse, Toulouse, France Journal Foundations of Science Online ISSN 1572-8471 Print ISSN 1233-1821.

From the standpoint of the theory of medicine, a formulation is given of three types of reasoning used by physicians. The first is deduction from probability models (as in prognosis or genetic counseling for Mendelian disorders). It is a branch of mathematics that leads to predictive statements about outcomes of individual events in terms of known formal assumptions and parameters. The second type is inference (as in interpreting clinical trials). In it the arguments from replications of the same process (data) (...) lead to conclusions about the parameters of a system, without calling into question either the probabilistic model or the criteria of evidence. The third is illation (as in the elucidation of symptoms in a patient). It is a process whereby, in the light of the total evidence and the conclusions from the other types of reasoning, one may modify, expand, simplify or demolish a conceptual framework proposed for deductions, and modify the nature of the evidence sought, the criteriology, the axioms, and the surmised complexity of the scientific theory. (The process of diagnosis as applied to a patient may in extreme cases lead to the discovery of an entirely new disease with its own, quite new, set of diagnostic criteria. This course cannot be accommodated inside either of the other two types of reasoning.) Illation has something of the character of Kuhn's scientific revolution in physics; but it differs in that it is the nature, not the degree or frequency of change that distinguishes it from Kuhn's normal science. (shrink)

One of the most debated questions in psychology and cognitive science is the nature and the functioning of the mental processes involved in deductive reasoning. However, all existing theories refer to a specific deductive domain, like syllogistic, propositional or relational reasoning.Our goal is to unify the main types of deductive reasoning into a single set of basic procedures. In particular, we bring together the microtheories developed from a mental models perspective in a single theory, for which we (...) provide a formal foundation. We validate the theory through a computational model (UNICORE) which allows fine‐grained predictions of subjects' performance in different reasoning domains.The performance of the model is tested against the performance of experimental subjects—as reported in the relevant literature—in the three areas of syllogistic, relational and propositional reasoning. The computational model proves to be a satisfactory artificial subject, reproducing both correct and erroneous performance of the human subjects. Moreover, we introduce a developmental trend in the program, in order to simulate the performance of subjects of different ages, ranging from children (3–6) to adolescents (8–12) to adults (>21). The simulation model performs similarly to the subjects of different ages.Our conclusion is that the validity of the mental model approach is confirmed for the deductive reasoning domain, and that it is possible to devise a unique mechanism able to deal with the specific subareas. The proposed computational model (UNICORE) represents such a unifying structure. (shrink)

According to Hempel, all scientific explanations and predictions which are produced exclusively with deterministic laws must be deductive, in the sense that the explanandum or the prediction must be a logical consequence of the laws and the initial conditions in the explanans. This deducibility thesis has been attacked from several quarters. Some time ago Canfield and Lehrer presented a “refutation” of DT as applied to predictions, in which they tried to prove that “if the deductive reconstruction [DT for (...) predictions] were an adequate reconstruction, then scientific prediction would be impossible”. Their argument seems to have been uncontested except for an inconclusive rejoinder by Beard. Moreover, Stegmüller has recently argued that “it may turn out that all or at least most of the so-called deductive-nomological explanations are in truth inductive and not deductive arguments, in view of the difficulty which has been pointed out by Canfield and Lehrer”. It seems it would be worth investigating whether Canfield and Lehrer's argument is, indeed, correct. (shrink)

This paper presents a natural deduction system for orthomodular quantum logic. The system is shown to be provably equivalent to Nishimura’s quantum sequent calculus. Through the Curry–Howard isomorphism, quantum $$\lambda $$ -calculus is also introduced for which strong normalization property is established.