Arithmetic knowledge from the spontaneous attention to relations

Children's knowledge of arithmetic principles is a key aspect of early mathematics knowledge. Knowledge of arithmetic principles predicts how children approach solving arithmetic problems and the likelihood of their success. Prior work has begun to address how children might learn arithmetic principles in a classroom setting. Understanding of arithmetic principles involves understanding how numbers in arithmetic equations relate to another. For example, the Relation to Operands (RO) principle is that for subtracting natural numbers (A ? B = C), the difference (C) must be smaller than the minuend (A). In the current study we evaluate if individual differences in arithmetic principle knowledge (APK) can be predicted by the learners' spontaneous attention to relations (SAR) and if feedback can increase their attention to relations. Results suggest that participants’ Spontaneous Attention to Number (SAN) does not predict their knowledge of the RO principle for symbolic arithmetic. Feedback regarding the attention to relations did not show a significant effect on SAR or participants’ APK. We also did not find significant relations between reports of parent talk and the home environment with individual differences in SAN. The amount of parent's talk about relations was not significantly associated with learner's SAR and APK. We conclude that children's SAR with non‐symbolic number does not generalize to attention to relations with symbolic arithmetic.     

Against Probabilistic Measures of Coherence

It is shown that the probabilistic theories of coherence proposed up to now produce a number of counter-intuitive results. The last section provides some reasons for believing that no probabilistic measure will ever be able to adequately capture coherence. First, there can be no function whose arguments are nothing but tuples of probabilities, and which assigns different values to pairs of propositions {A, B} and {A, C} if A implies both B and C, or their negations, and if P(B)=P(C). But such sets may indeed differ in their degree of coherence. Second, coherence is sensitive to explanatory relations between the propositions in question. Explanation, however, can hardly be captured solely in terms of probability.     

The myth of the categorical counterfactual

I aim to show that standard theories of counterfactuals are mistaken, not in detail, but in principle, and I aim to say what form a tenable theory must take. Standard theories entail a categorical interpretation of counterfactuals, on which to state that, if it were that A, it would be that C is to state something, not relative to any supposition or hypothesis, but categorically. On the rival suppositional interpretation, to state that, if it were that A, it would be that C is to state that it would be that C relative to the supposition that it were that A. The two interpretations make incompatible predictions concerning the correct evaluation of counterfactuals. I argue that the suppositional interpretation makes the correct prediction.

A consistent theory of attributes in a logic without contraction

This essay demonstrates proof-theoretically the consistency of a type-free theoryC with an unrestricted principle of comprehension and based on a predicate logic in which contraction (A (A B)) (A B), although it cannot holds in general, is provable for a wide range ofA's.C is presented as an axiomatic theoryCH (with a natural-deduction equivalentCS) as a finitary system, without formulas of infinite length. ThenCH is proved simply consistent by passing to a Gentzen-style natural-deduction systemCG that allows countably infinite conjunctions and in which all theorems ofCH are provable.CG is seen to be a consistent by a normalization argument. It also shown that in a senseC is highly non-extensional.     

Agent deliberation in an executable temporal framework

Autonomous agents are not so difficult to construct. Constructing autonomous agents that will work as required is much harder. A clear way in which we can design and analyse autonomous systems so that we can be more confident that their behaviour is as required is to use formal methods. These can, in principle, allow us to exactly specify the behaviour of the agent, and verify that any implementation has the properties required. In addition to using a more formal approach, it is clear that problems of conceptualisation and analysis can be aided by the use of an appropriate abstraction.In this article we tackle one particular aspect of formal methods for agent-based systems, namely the formal representation and implementation of deliberation within agents. The key aspect here is simplicity. Agents are specified using a relatively simple temporal logic and are executed by directly interpreting such temporal formulae. Deliberation is captured by modifying the way in which execution handles its temporal goals. Thus, in this article we provide motivations, theoretical underpinnings, implementation details, correctness arguments, and comparisons with related work.     

Kant on Complete Determination and Infinite Judgement

In the Transcendental Ideal Kant discusses the principle of complete determination: for every object and every predicate A, the object is either determinately A or not-A. He claims this principle is synthetic, but it appears to follow from the principle of excluded middle, which is analytic. He also makes a puzzling claim in support of its syntheticity: that it represents individual objects as deriving their possibility from the whole of possibility. This raises a puzzle about why Kant regarded it as synthetic, and what his explanatory claim means. I argue that the principle of complete determination does not follow from the principle of excluded middle because the externally negated or ‘negative’ judgement ‘Not (S is P)’ does not entail the internally negated or ‘infinite’ judgement ‘S is not-P.’ Kant's puzzling explanatory claim means that empirical objects are determined by the content of the totality of experience. This entails that empirical objects are completely determinate if and only if the totality of experience has a completely determinate content. I argue that it is not a priori whether experience has such a completely determinate content and thus not analytic that objects obey the principle of complete determination.     

On Some Categories of Involutive Centered Residuated Lattices

Motivated by an old construction due to J. Kalman that relates distributive lattices and centered Kleene algebras we define the functor K ^• relating integral residuated lattices with 0 (IRL₀) with certain involutive residuated lattices. Our work is also based on the results obtained by Cignoli about an adjunction between Heyting and Nelson algebras, which is an enrichment of the basic adjunction between lattices and Kleene algebras. The lifting of the functor to the category of residuated lattices leads us to study other adjunctions and equivalences. For example, we treat the functor C whose domain is cuRL, the category of involutive residuated lattices M whose unit is fixed by the involution and has a Boolean complement c (the underlying set of C M is the set of elements greater or equal than c). If we restrict to the full subcategory NRL of cuRL of those objects that have a nilpotent c, then C is an equivalence. In fact, C M is isomorphic to C _e M, and C _e is adjoint to , where assigns to an object A of IRL₀ the product A × A ⁰ which is an object of NRL.     

Working with Sandler's Theories

My contribution to this issue of Psychoanalytic Inquiry highlights not only Sandler's prodigious successes but also those aspects of his work that remain ambiguous. These uncertainties derive in part from his effort to integrate different frames of reference in his conceptualizations. The bits of theory that clinicians actually use in the consulting room tend to simplify, revise, and even contradict the more complex theories Sandler developed. Some of Sandler's proposals may be seen as retrainings of earlier theory at different levels of abstraction, and hence more compatible with them than generally acknowledged. I note the inclusion of Kleinian strains, which Sandler legitimized for non-Kleinian analysts, and conclude with a consideration of the “identity of perception” as a fundamental aspect of cognition and a territory yet to be fully explored.     

Conditional probability judgments: Effects of imagining vs experiencing the conditioning event

Applications of Bayesian conditionalization often involve two temporal aspects: a probability judgment is based on knowledge at a point in time and is revised over time in light of added information. Let t, t′, and t″ designate three chronological points in time. E designates a target event which occurs or not at t″, and C designates a conditioning event which occurs or not at t′. Suppose that an individual judges P(EC) at t. If C occurs, Bayesian conditionalization requires that a judgment of P(E) at t′ is equal to the earlier judgment of P(EC). However, inconsistencies may result because a judgment of P(EC) at t is based on imagining C, while a judgment of P(E) at t′ is based on experiencing C. This study examines two sources of such inconsistencies. First, C normally is an abstraction of what might happen between t and t′. What actually happens may differ, such that an individual observes extraconditional information which affects a judgment of P(E) at t′. Second, experiencing C may change an individual's affective state, leading to greater optimism or pessimism about the occurrence of E. We report an experiment which documents both effects.     

Conformity of two sociometric relations

The problem of comparing two sociometric relations or measurements (A andB) recorded in distinct sociomatrices was originally discussed by Katz and Powell in the early 1950's and Hubert and Baker in the late 1970's. The problem is considered again using a probabilistic model designed specifically for discrete-valued network measurements. The model allows for the presence of various structural tendencies, such as reciprocity and differential popularity. A parameter that isolates the tendency for actors to choose other actors on both relations simultaneously is introduced, and estimated conditional on the presence of other parameters that reflect additional important network properties. The parameter is presented as a symmetric index but is also generalized to the predictive (A onB orB onA) situation. This approach to the problem is illustrated with the same data used by the earlier solutions, and the unique nature of the two relations in the data set (A = received choices,B = perceived choices), as it affects the modeling, is discussed. Significance tests for the parameter and related parameters are described, as well as an extension to more than two relations.Research support provided by National Science Grant #SES84-08626 to the University of Illinois at Urbana-Champaign. I am grateful to Dawn Iacobucci and Sheila Weaver for assistance with the research reported here, and to Carolyn Anderson, James Green, David Holtgrave, and four anonymous referees for comments on the paper.     

Entailment with Near Surety of Scaled Assertions of High Conditional Probability

An assertion of high conditional probability or, more briefly, an HCP assertion is a statement of the type: The conditional probability of B given A is close to one. The goal of this paper is to construct logics of HCP assertions whose conclusions are highly likely to be correct rather than certain to be correct. Such logics would allow useful conclusions to be drawn when the premises are not strong enough to allow conclusions to be reached with certainty. This goal is achieved by taking Adams" (1966) logic, changing its intended application from conditionals to HCP assertions, and then weakening its criterion for entailment. According to the weakened entailment criterion, called the Criterion of Near Surety and which may be loosely interpreted as a Bayesian criterion, a conclusion is entailed if and only if nearly every model of the premises is a model of the conclusion. The resulting logic, called NSL, is nonmonotonic. Entailment in this logic, although not as strict as entailment in Adams" logic, is more strict than entailment in the propositional logic of material conditionals. Next, NSL was modified by requiring that each HCP assertion be scaled; this means that to each HCP assertion was associated a bound on the deviation from 1 of the conditional probability that is the subject of the assertion. Scaling of HCP assertions is useful for breaking entailment deadlocks. For example, it it is known that the conditional probabilities of C given A and of ¬ C given B are both close to one but the bound on the former"s deviation from 1 is much smaller than the latter"s, then it may be concluded that in all likelihood the conditional probability of C given A B is close to one. The resulting logic, called NSL-S, is also nonmonotonic. Despite great differences in their definitions of entailment, entailment in NSL is equivalent to Lehmann and Magidor"s rational closure and, disregarding minor differences concerning which premise sets are considered consistent, entailment in NSL-S is equivalent to entailment in Goldszmidt and Pearl"s System-Z ⁺. Bacchus, Grove, Halpern, and Koller proposed two methods of developing a predicate calculus based on the Criterion of Near Surety. In their random-structures method, which assumed a prior distribution similar to that of NSL, it appears possible to define an entailment relation equivalent to that of NSL. In their random-worlds method, which assumed a prior distribution dramatically different from that of NSL, it is known that the entailment relation is different from that of NSL.     

How Language Enables Abstraction: A Study in Computational Cultural Psychology

The idea that language mediates our thoughts and enables abstract cognition has been a key idea in socio-cultural psychology. However, it is not clear what mechanisms support this process of abstraction. Peirce argued that one mechanism by which language enables abstract thought is hypostatic abstraction, the process through which a predicate (e.g., dark) turns into an object (e.g., darkness). By using novel computational tools we tested Peirce’s idea. Analysis of the data provides empirical support for Peirce’s mechanism and evidence of the way the use of signs enables abstraction. These conclusions are supported by the in-depth analysis of two case studies concerning the abstraction of sweet and dark. The paper concludes by discussing the findings from a broad and integrative theoretical perspective and by pointing to computational cultural psychology as a promising perspective for addressing long-lasting questions of the field.     

Supracompact inference operations

When a proposition is cumulatively entailed by a finite setA of premisses, there exists, trivially, a finite subsetB ofA such thatB B entails for all finite subsetsB that are entailed byA. This property is no longer valid whenA is taken to be an arbitrary infinite set, even when the considered inference operation is supposed to be compact. This leads to a refinement of the classical definition of compactness. We call supracompact the inference operations that satisfy the non-finitary analogue of the above property. We show that for any arbitrary cumulative operationC, there exists a supracompact cumulative operationK(C) that is smaller thenC and agrees withC on finite sets. Moreover,K(C) inherits most of the properties thatC may enjoy, like monotonicity, distributivity or disjunctive rationality. The main part of the paper concerns distributive supracompact operations. These operations satisfy a simple functional equation, and there exists a representation theorem that provides a semantic characterization for this family of operations. We examine finally the case of rational operations and show that they can be represented by a specific kind of model particularly easy to handle.     

Variations on the Ramsey test: More triviality results

The purpose of this note is to formulate some weaker versions of the so called Ramsey test that do not entail the following unacceptable consequenceIf A and C are already accepted in K, then if A, then C is also accepted in K. and to show that these versions still lead to the same triviality result when combined with a preservation criterion.     

A Five‐dimensional Model of Attributes: Some precursors of executive coach selection

The purpose of this study was to specify a set of attributes, identified as important precursors to coach selection. Executive coaching has grown exponentially, but there have been few studies as to the efficacy of coaching, including the factors that influence a manager's choice of coach. This study sought to identify these factors. The 45‐item, online survey produced 267 useable responses. Results of the principal component analysis suggested a five‐factor solution, with women showing a statistically significant preference over men for coaches who have the Ability to Develop Critical Thinking and Action, the Ability to Forge the Coaching Partnership and Coach Experience and Qualifications. The impact of coachee age was not significant in selecting executive coaches. The findings show a statistically significant relationship between coach attributes and the intention to continue with coaching. The implications of these findings for the selection of coaches, and for the coaching profession are discussed.     

The WPA position paper on spirituality and religion in psychiatry: a North American perspective

ABSTRACT

The WPA position statement is a clear challenge for psychiatrists to recognize how religion/spirituality (R/S) is relevant to their work. North American psychiatry has shown progress related to each principle articulated in the statement, especially in the areas of research and scholarship. However, most advances are yet to be widely implemented or coordinated, so that the statement offers valuable encouragement and direction in moving forward.     

Frames and MV-algebras

We describe a class of MV-algebras which is a natural generalization of the class of “algebras of continuous functions”. More specifically, we're interested in the algebra of frame maps Hom (Ω(A), K) in the category T of frames, where A is a topological MV-algebra, Ω(A) the lattice of open sets of A, and K an arbitrary frame. Given a topological space X and a topological MV-algebra A, we have the algebra C (X, A) of continuous functions from X to A. We can look at this from a frame point of view. Among others we have the result: if K is spatial, then C(pt(K), A), pt(K) the points of K, embeds into Hom (Ω(A), K) analogous to the case of C (X, A) embedding into Hom (Ω(A), Ω (X)). 1991 Mathematics Subject Classification: 06F20, 06F25, 06D30 Presented by Ewa Orlowska     

Factors and processes in children's transitive deductions

Transitive tasks are important for understanding how children develop socio-cognitively. However, developmental research has been restricted largely to questions surrounding maturation. We asked 6-, 7- and 8-year-olds (N?=?117) to solve a composite of five different transitive tasks. Tasks included conditions asking about item-C (associated with the marked relation) in addition to the usual case of asking only about item-A (associated with the unmarked relation). Here, children found resolving item-C much easier than resolving item-A, a finding running counter to long-standing assumptions about transitive reasoning. Considering gender perhaps for the first time, boys exhibited higher transitive scores than girls overall. Finally, analysing in the context of one recent and well-specified theory of spatial transitive reasoning, we generated the prediction that reporting the full series should be easier than deducing any one item from that series. This prediction was not upheld. We discuss amendments necessary to accommodate all our earlier findings.     

The evaluation of linear forms

This presentation deals with the evaluation and transformation of linear forms. Especial emphasis is given to implicit methods in which it is not necessary to find the explicit values,x _i . The relation of the Aitken triple product matrixCA ^–1 B to the result of a linear transformation of linear forms is noted, and the numerical computation of this triple product matrix is indicated with the use of the simple Abbreviated Doolittle solution. Application is also made to the evaluation ofA ^–1 and ofA ^–1 C.