子图问题学习对几何解题迁移的影响

将一个图形（称为母图）的若干条线段删除后得到的图形叫做母图的子图。运用实验方法探讨了子图结构学习和子图变式学习对解决问题的迁移效果。结果表明：子图结构学习仅对解决“图形结构相同、逻辑结构相同”问题有明显迁移作用;子图变式学习对解决“图形结构相同、逻辑结构相同”没有明显迁移作用,对“图形结构相似、逻辑结构相同”、“图形结构相同、逻辑结构相似”以及“图形结构相似、逻辑结构相似”四类问题均有明显迁移作用。     

General information in relevant logic

This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic 71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quantified statements, their information condition is quite different. The information condition utilizes general propositions. The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an adequate theory of general information.     

On Permutation in Simplified Semantics

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J Philos Logic 22(5):481–511, 1993) concerning the modelling conditions for the axioms of assertion A → ((A → B) → B) (there called c6) and permutation (A → (B → C)) → (B → (A → C)) (there called c7). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose two different corrections.     

Extended Quantum Logic

The concept of quantum logic is extended so that it covers a more general set of propositions that involve non-trivial probabilities. This structure is shown to be embedded into a multi-modal framework, which has desirable logical properties such as an axiomatization, the finite model property and decidability.     

Speaking Your Mind: Large Inarticulateness Constitutional and Circumstantial

When someone is asked to speak his mind, it is sometimes possible for him to furnish what his utterance appears to have omitted. In such cases we might say that he had a mind to speak. Sometimes, however, the opposite is true. Asked to speak his mind, our speaker finds that he has no mind to speak. When it is possible to speak one's mind and when not is largely determined by the kinds of beings we are and by the kinds of resources we are able to draw upon. In either case, not speaking one's mind is leaving something out whose articulation would or could matter for the purposes for which one was speaking in the first place. Inarticulation is no fleetingly contingent and peripheral phenomenon in human thinking and discourse. It is a substantial and dominant commonplace. In Part One I attempt to say something about what it is about the human agent that makes inarticulateness so rife. In Part Two, I consider various strategies for making the unarticulated explicit, and certain constraints on such processes. I shall suggest, among other things, that standard treatments of enthymematic reconstruction are fundamentally misconceived.     

The seven virtues of simple type theory

Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys the virtues of simple type theory and attempts to show that simple type theory is an attractive alternative to first-order logic for practical-minded scientists, engineers, and mathematicians. It recommends that simple type theory be incorporated into introductory logic courses offered by mathematics departments and into the undergraduate curricula for computer science and software engineering students.     

The Craig Interpolation Theorem in abstract model theory

The Craig Interpolation Theorem is intimately connected with the emergence of abstract logic and continues to be the driving force of the field. I will argue in this paper that the interpolation property is an important litmus test in abstract model theory for identifying “natural,” robust extensions of first order logic. My argument is supported by the observation that logics which satisfy the interpolation property usually also satisfy a Lindström type maximality theorem. Admittedly, the range of such logics is small.     

Brogaard and Salerno on antirealism and the conditional fallacy

Brogaard and Salerno (2005, Nous, 39, 123–139) have argued that antirealism resting on a counterfactual analysis of truth is flawed because it commits a conditional fallacy by entailing the absurdity that there is necessarily an epistemic agent. Brogaard and Salerno’s argument relies on a formal proof built upon the criticism of two parallel proofs given by Plantinga (1982, Proceedings and Addresses of the American Philosophical Association, 56, 47–70) and Rea (2000, Nous, 34, 291–301). If this argument were conclusive, antirealism resting on a counterfactual analysis of truth should probably be abandoned. I argue however that the antirealist is not committed to a controversial reading of counterfactuals presupposed in Brogaard and Salerno’s proof, and that the antirealist can in principle adopt an alternative reading that makes this proof invalid. My conclusion is that no reductio of antirealism resting on a counterfactual analysis of truth has yet been provided.