The information explosion and digital modes of learning often combine to inform the quest for the best ways of transforming information in digital form for pedagogical purposes. This quest has become more urgent and pervasive with the ‘turn’ to online learning in the context of COVID-19. This can result in linear, asynchronous, transmission-based modes of teaching and learning which commodify, package and deliver knowledge for individual ‘customers’. The primary concerns in such models are often technical and economic – technology as (...) a cost-effective ‘solution’ to educational challenges. In this paper I argue for the importance of dialogic learning space in teaching and learning by means of Information and Communication Technologies, whether in the form of fully online learning, blended learning or face-to-face encounters using ICT affordances. Although the 20th Century theorists Mikhail Bakhtin (1895–1975) and Hans-Georg Gadamer (1900–2002) produced their seminal works before the advent of ICTs, they were both concerned with the quality and authenticity of human engagement with texts and with other persons and contexts. Besides a shared interest in dialogue as an ontological feature of human life and being, they both used spatiotemporal concepts for understanding and interpreting texts. The article draws on Gadamer’s notions of dialogue and horizon, and Bakhtin’s notions of dialogue and chronotope, to conceptualize dialogic possibilities for online education. Its purpose is to provide a framework, grounded in Bakhtin’s and Gadamer’s ideas, for a dialogic approach to online teaching and learning in higher education. (shrink)

Jesus of Nazareth, like Socrates, left nothing behind written by himself. Yet, the records of his teaching indicate a rich interest in dialogic pedagogy, reflected in his use of the parable, primarily an oral genre, as a dialogic provocation. Working at the interface of pedagogy, theology and philosophy, this article explores the parable of the Good Samaritan from the perspective of dialogic pedagogy. It employs an analytical approach termed diacognition, developed from the notions of dialogue, position and cognition, to analyse (...) the moves within the parable and the teaching situation in which it is located. The article explores how Jesus engages the dialogue of and around the parable to position and reposition his interlocutor, provoking a re-cognition of what it means to love one’s neighbour. It concludes by reflecting on the implications of this analysis for the relation of meaning to knowing and doing. (shrink)

Dialogue is a seminal concept within the work of the Brazilian adult education theorist, Paulo Freire, and the Russian literary critic and philosopher, Mikhail Bakhtin. While there are commonalities in their understanding of dialogue, they differ in their treatment of dialectic. This paper addresses commonalities and dissonances within a Bakhtin-Freire dialogue on the notions of dialogue and dialectic. It then teases out some of the implications for education theory and practice in relation to two South African contexts of learning that (...) facilitate the access to education of disadvantaged groups, one in higher education and the other in early childhood education. (shrink)

This article examines the relationship between online dispute resolution (ODR) and trust. We discuss what trust is, why trust is important, and how trust develops. Our claim is that efforts to implement online dispute resolution on a site or service in a manner that promotes trust need to consider ODR as just one tool in a broader toolbox of trust-building tools and techniques. These techniques are amongst others marketing, education, trust seals, and transparency. By evaluating ODR in its proper context (...) as one component of a larger trust strategy, we can more accurately set expectations for its results and position our projects for success. (shrink)

The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates the (...) semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

We present nested sequent systems for propositional Gödel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these Gödel-Dummett logics, we introduce a new structural rule, called the linearity rule, which (bottom-up) operates by linearising branching structure in a given nested sequent. In addition, an interesting feature of our calculi is the inclusion of reachability rules, which are special logical rules that operate by propagating (...) data and/or checking if data exists along certain paths within a nested sequent. Such rules require us to generalise our nested sequents to include signatures (i.e. finite collections of variables) in the first-order cases, thus giving rise to a generalisation of the usual nested sequent formalism. Our calculi exhibit favourable properties, admitting the height-preserving invertibility of every logical rule and the (height-preserving) admissibility of a large collection of structural and reachability rules. We prove all of our systems sound and cut-free complete, and show that syntactic cut-elimination obtains for the intuitionistic systems. We conclude the paper by discussing possible extensions and modifications, putting forth an array of structural rules that could be used to provide a sizable class of intermediate logics with cut-free nested sequent systems. (shrink)

We study the selection of adjustment sets for estimating the interventional mean under an individualized treatment rule. We assume a non-parametric causal graphical model with, possibly, hidden variables and at least one adjustment set composed of observable variables. Moreover, we assume that observable variables have positive costs associated with them. We define the cost of an observable adjustment set as the sum of the costs of the variables that comprise it. We show that in this setting there exist adjustment (...) sets that are minimum cost optimal, in the sense that they yield non-parametric estimators of the interventional mean with the smallest asymptotic variance among those that control for observable adjustment sets that have minimum cost. Our results are based on the construction of a special flow network associated with the original causal graph. We show that a minimum cost optimal adjustment set can be found by computing a maximum flow on the network, and then finding the set of vertices that are reachable from the source by augmenting paths. The optimaladj Python package implements the algorithms introduced in this article. (shrink)

Although there are various ways to express actions and behaviors in natural languages, it is found in cognitive informatics that human and system behaviors may be classified into three basic categories: to be , to have , and to do . All mathematical means and forms, in general, are an abstract description of these three categories of system behaviors and their common rules. Taking this view, mathematical logic may be perceived as the abstract means for describing to be, set theory (...) for describing 'to have,' and algebras, particularly the process algebra, for describing to do. This is a fundamental view toward the formal description and modeling of human and system behaviors in general, and software behaviors in particular, because a software system can be perceived as a virtual agent of human beings, and it is created to do something repeatable, to extend human capability, reachability, and/or memory capacity. The author found that both human and software behaviors can be described by a three-dimensional representative model comprising action, time, and space. For software system behaviors, the three dimensions are known as mathematical operations, event/process timing, and memory manipulation. This paper introduces the real-time process algebra (RTPA) that serves as an expressive notation system for describing thoughts and notions of dynamic software behaviors. Experimental case studies on applications of RTPA in describing the equivalent software and human behaviors as a series of actions and cognitive processes are demonstrated with real-world examples. (shrink)

Although there are various ways to express actions and behaviors in natural languages, it is found in cognitive informatics that human and system behaviors may be classified into three basic categories: to be, to have, and to do. All mathematical means and forms, in general, are an abstract description of these three categories of system behaviors and their common rules. Taking this view, mathematical logic may be perceived as the abstract means for describing ‘to be,’ set theory for describing 'to (...) have,' and algebras, particularly the process algebra, for describing ‘to do.’ This is a fundamental view toward the formal description and modeling of human and system behaviors in general, and software behaviors in particular, because a software system can be perceived as a virtual agent of human beings, and it is created to do something repeatable, to extend human capability, reachability, and/or memory capacity. The author found that both human and software behaviors can be described by a three-dimensional representative model comprising action, time, and space. For software system behaviors, the three dimensions are known as mathematical operations, event/process timing, and memory manipulation. This paper introduces the real-time process algebra that serves as an expressive notation system for describing thoughts and notions of dynamic software behaviors. Experimental case studies on applications of RTPA in describing the equivalent software and human behaviors as a series of actions and cognitive processes are demonstrated with real-world examples. (shrink)

In Rules and Representations, first published in 1980, Noam Chomsky lays out many of the concepts that have made his approach to linguistics and human cognition so instrumental to our understanding of language.Chomsky arrives at his well-known position that there is a universal grammar, structured in the human mind and common to all human languages. Based on Chomsky's 1978 Woodbridge Lectures, this edition contains revised versions of the lectures and two new essays.

Although it is known that reachability in undirected finite graphs can be expressed by an existential monadic second-order sentence, our main result is that this is not the case for directed finite graphs (even in the presence of certain "built-in" relations, such as the successor relation). The proof makes use of Ehrenfeucht-Fraisse games, along with probabilistic arguments. However, we show that for directed finite graphs with degree at most k, reachability is expressible by an existential monadic second-order sentence.

Written with verve and intensity (and a good bit of wordplay), this is the long-awaited study of Flaubert and the modern literary field that constitutes the ...

"Rule" adopts the tradition of political philosophy begun by Socrates, refined by Xenophon and Plato. The book concentrates on something the characters call life-without-rule. What would that be? Is it a sort of utopia? How does it differ from anarchy? What makes it so appealing and what are the trade-offs?

“Imagination may be thought of as a ‘work-around.’ It is a resourceful tactic to ‘undo’ a rule by creating a path around it without necessarily defying it.... Transgression, on the other hand, is rule breaking. There is no pretense of reinterpretation; it is defiance pure and simple. Whether imagination or disobedience is the source, constraints need not constrain, ties need not bind.” So writes Kenneth A. Shepsle in his introduction to Rule Breaking and Political Imagination. Institutions are (...) thought to channel the choices of individual actors. But what about when they do not? Throughout history, leaders and politicians have used imagination and transgression to break with constraints upon their agency. Shepsle ranges from ancient Rome to the United States Senate, and from Lyndon B. Johnson to the British House of Commons. He also explores rule breaking in less formal contexts, such as vigilantism in the Old West and the CIA’s actions in the wake of 9/11. Entertaining and thought-provoking, Rule Breaking and Political Imagination will prompt a reassessment of the nature of institutions and remind us of the critical role of political mavericks. (shrink)

I argue that a practice can only be taken to be one of apparent rule following if it contains a practice of policing moves within the practice. So the existence of an apparently rule-governed practice entails the existence of, what I call, a policing practice. I then argue that this entailment cannot be reconciled with a non-factualist construal of the policing practice. Thus non-factualism about the policing practice is false. Factualism about the policing practice entails realism about rules. (...) So I conclude that we ought to be realists about rules. Finally I distinguish a position which I call ultra-realism about rules and note that this too is a casualty of the view developed here. (shrink)