Trust and Transitivity: How trust-transfer works

Transitivity in trust is very often considered as a quite simple property, trivially inferable from the classical transitivity defined in mathematics, logic, or grammar. In fact the complexity of the trust notion suggests evaluating the relationships with the transitivity in a more adequate way. In this paper, starting from a socio-cognitive model of trust, we analyze the different aspects and conceptual frameworks involved in this relation and show how different interpretations of these concepts produce different solutions and definitions of trust transitivity

Cassirer and Steinthal on Expression and the Science of Language

Ernst Cassirer’s focus on the expressive function of language should be read, not in the context of Carnap’s debate with Heidegger, but in the context of the earlier work of Chajim (Heymann) Steinthal. Steinthal distinguishes the expressive form of language, when language is studied as a natural phenomenon, from language as a logical, inferential system. Steinthal argues that language always can be expressed in terms of logical inference. Thus, he would disagree with Heidegger, just as Carnap does. But, Steinthal insists, that is not to say that language, as a natural phenomenon, is exhausted by logic or by the place of terms or relations in inferential structures. Steinthal’s “form” of linguistic “expression” is an early version of Cassirer’s “expressive function” for language. The expressive function, then, should not be seen to place a barrier between Carnap and Cassirer. Rather, Steinthal and Cassirer deal with a question that, as far as I know, Carnap does not address directly: how should philosophers analyze human language as a natural phenomenon, as a part of our expression as animals? And how does that expression determine the semantic categories, kind terms, and other structures that develop within, and characterize, human language itself

Unpacking the logic of mathematical statements

This study focuses on undergraduate students' ability to unpack informally written mathematical statements into the language of predicate calculus. Data were collected between 1989 and 1993 from 61students in six small sections of a “bridge" course designed to introduce proofs and mathematical reasoning. We discuss this data from a perspective that extends the notion of concept image to that of statement image and introduces the notion of proof framework to indicate the top-level logical structure of a proof. For simplified informal calculus statements, just 8.5% of unpacking attempts were successful; for actual statements from calculus texts, this dropped to 5%. We infer that these students would be unable to reliably relate informally stated theorems with the top-level logical structure of their proofs and hence could not be expected to construct proofs or evaluate their validity

Knowledge graph analysis of particles in Japanese

The theory of knowledge graphs is a structuralistic theory of language. Its ontology consists of eight types of binary relationships and four types of so-called frames. The relationships connect so-called tokens, that represent semantic units. In this way a graph structure arises. Japanese particles are investigated against the background of knowledge graph ontology. It is shown that the structure of Japanese closely resembles the structure of the knowledge graph representation of language

Affordances of spreadsheets in mathematical investigation: Potentialities for learning

This article, is concerned with the ways learning is shaped when mathematics problems are investigated in spreadsheet environments. It considers how the opportunities and constraints the digital media affords influenced the decisions the students made, and the direction of their enquiry pathway. How might the leraning trajectory unfold, and the learning process and mathematical understanding emerge? Will the spreadsheet, as the pedagogical medium, evoke learning in a distinctive manner? The article reports on an aspect of an ongoing study involving students as they engage mathematical investigative tasks through digital media, the spreadsheet in particular. In considers the affordances of this learning environment for primary-aged students

LCM and MCM: specification of a control system using dynamic logic and process algebra

LCM 3.0 is a specification language based on dynamic logic and process algebra, and can be used to specify systems of dynamic objects that communicate synchronously. LCM 3.0 was developed for the specification of object-oriented information systems, but contains sufficient facilities for the specification of control to apply it to the specification of control-intensive systems as well. In this paper, the results of such an application are reported. The paper concludes with a discussion of the need for theorem-proving support and of the extensions that would be needed to be able to specify real-time properties

The hardness of the iconic must: Can Peirce’s existential graphs assist modal epistemology?

Charles Peirce’s diagrammatic logic - the Existential Graphs - is presented as a tool for illuminating how we know necessity, in answer to Benacerraf’s famous challenge that most “semantics for mathematics” do not “fit an acceptable epistemology”. It is suggested that necessary reasoning is in essence a recognition that a certain structure has the structure that it has. This means that, contra Hume and his contemporary heirs, necessity is observable. One just needs to pay attention, not just to individual things but to how those things are related in larger structures, certain aspects of which force certain others to be a particular way