Deliberate contextual vocabulary acquisition (CVA) is a reader’s ability to figure out a (not the) meaning for an unknown word from its “context”, without external sources of help such as dictionaries or people. The appropriate context for such CVA is the “belief-revised integration” of the reader’s prior knowledge with the reader’s “internalization” of the text. We discuss unwarranted assumptions behind some classic objections to CVA, and present and defend a computational theory of CVA that we have adapted to a new (...) classroom curriculum designed to help students use CVA to improve their reading comprehension. (shrink)

Violence -- Poliltical philosophy -- Critical theory -- Science and arts in international relations -- Psyche -- Aesthetics -- Tolstoi's War and peace.

In these days, there is an increasing technological development in intelligent tutoring systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics that help students understand the basics of math and that helps a lot of students of all ages to understand the topic because it's important for students of adding and subtracting. Through which the student will be able to study the course and solve related problems. An evaluation (...) of the intelligent tutoring systems was carried out and the results were encouraging. (shrink)

A numeral system is an infinite sequence of different closed normal -terms intended to code the integers in -calculus. Barendregt has shown that if we can represent, for a numeral system, the functions Successor, Predecessor, and Zero Test, then all total recursive functions can be represented. In this paper we prove the independancy of these three particular functions. We give at the end a conjecture on the number of unary functions necessary to represent all total recursive functions.

This article offers an account of the responsibility that individuals bear by virtue of their national belonging alone. Via their national pride, the living connect themselves actively with select actions performed by others who might long be dead. They imagine themselves as having won past wars, built ancient empires and the like. This same feat of their imagination imposes on them a responsibility for the bad outcomes that were brought about through their imagined exploits. Their national responsibility for the "sins (...) of the fathers" however lends itself only to the kinds of responses that these living agents can demand of themselves. While their national responsibility can be captured by either the vocabulary of guilt or that of shame, the latter turns out to be more promising as it better accounts for the strong hold that the national idea has on contemporary political thinking. (shrink)

This article offers an account of the responsibility that individuals bear by virtue of their national belonging alone. Via their national pride, the living connect themselves actively with select actions performed by others who might long be dead. They imagine themselves as having won past wars, built ancient empires and the like. This same feat of their imagination imposes on them a responsibility for the bad outcomes that were brought about through their imagined exploits. Their national responsibility for the “sins (...) of the fathers” however lends itself only to the kinds of responses that these living agents can demand of themselves. While their national responsibility can be captured by either the vocabulary of guilt or that of shame, the latter turns out to be more promising as it better accounts for the strong hold that the national idea has on contemporary political thinking. (shrink)

There are growing bodies of evidence demonstrating the benefits of equity, diversity, and inclusion on academic and organizational excellence. In turn, some editors have stated their desire to improve the EDI of their journals and of the wider scientific community. The Royal Society of Chemistry established a minimum set of requirements aimed at improving EDI in scholarly publishing. Additionally, several resources were reported to have the potential to improve EDI, but their effectiveness and feasibility are yet to be determined. In (...) this commentary we suggest six approaches, based on the Royal Society of Chemistry set of requirements, that journals could implement to improve EDI. They are: adopt a journal EDI statement with clear, actionable steps to achieve it; promote the use of inclusive and bias-free language; appoint a journal’s EDI director or lead; establish a EDI mentoring approach; monitor adherence to EDI principles; and publish reports on EDI actions and achievements. We also provide examples of journals that have implemented some of these strategies, and discuss the roles of peer reviewers, authors, researchers, academic institutes, and funders in improving EDI. (shrink)

This article explains how we ordinary subjects of a state who are neither political leaders nor functionaries are responsible for outcomes that are properly attributed to that state and that took place during our adult lifetime. Its focus is on the connection we forge to those outcomes via our obedience alone. If our responsibility as subjects is justified, it would apply under all regime types including oppressive and authoritarian ones. The argument is that this responsibility can only be justified within (...) a minimal account of agency and a bare-bones account of responsibility. Thus, while we incur a burden of responsibility for the state via our obedience alone, that burden does not suffice to either blame us or extract remedies from us for state injustices. For us obedient subjects, however, it is important that we be cognizant of this burden as it marks the most minimal agency we exercise in the state. (shrink)

We discuss a research project that develops and applies algorithms for computational contextual vocabulary acquisition (CVA): learning the meaning of unknown words from context. We try to unify a disparate literature on the topic of CVA from psychology, first- and secondlanguage acquisition, and reading science, in order to help develop these algorithms: We use the knowledge gained from the computational CVA system to build an educational curriculum for enhancing students’ abilities to use CVA strategies in their reading of science texts (...) at the middle-school and college undergraduate levels. The knowledge gained from case studies of students using our CVA techniques feeds back into further development of our computational theory. Keywords: artificial intelligence, knowledge representation, reading, reasoning, science education, vocabulary acquisition. (shrink)

In his recent work, Jürgen Habermas signals the abandonment of his earlier claims to justify human rights and universalist morality. This paper explains the above shift, arguing that it is the inescapable result of his attempts in recent years to accommodate pluralism. The paper demonstrates how Habermas’s universal pragmatic justification of modern normative standards was inextricably tied to his consensus theory of validity. He was compelled by the structure of that argument to count on the current or future availability of (...) a unified framework within which all can potentially articulate their needs and interests. With his abandonment of the justification Habermas has rid discourse theory of this controversial assumption. In weakening its defense of human rights and universalist morality against the charge of ethnocentrism, he has strengthened his theory’s foothold in the lived pluralist world. Key Words: argumentation • ethnocentrism • Habermas • human rights • justification • legitimacy • pluralism • rational consensus • Rehg. (shrink)

In this paper, we extend the system AF2 in order to have the subject reduction for the $betaeta$-reduction. We prove that the types with positive quantifiers are complete for models that are stable by weak-head expansion.

This dissertation engages the following question: how, in the absence of an uncontroversial source of moral guidance, can liberals make political and moral claims across cultural divides? While committed to toleration, liberals cannot escape the compulsion to apply basic standards of equal individual human rights and liberties universally. Under postmetaphysical conditions, however, they no longer find credible arguments that assure them of the sources of these standards in "natural law," "human nature," or "practical reason." Aware that individual rights have their (...) provenance in modern "Western" history, liberals fear being intolerant when they apply these standards universally, and experience as a result a problem of cross-cultural judgement. ;In this project I engage in a sympathetic critique of Richard Rorty's, Jurgen Habermas's and John Rawls's attempts at addressing this problem and provide a fourth alternative that cannot be absorbed by any of their frameworks. Rorty offers liberals the comforts of ethnocentrism. He assures them that political and moral judgements are always made by someone from somewhere. For this comfort, however, he extracts the exorbitant ethical price of other-disregard. Habermas derives individual rights from the universal practice of argumentation. By relying on the overly exacting standard of "rational consensus," however, he limits the applicability of his answer to liberal secular contexts. In his free-standing answer, Rawls offers the promising standard of an "overlapping consensus." His overly static use of this concept, however, drains it of its promise. ;Drawing on each of these attempts as well as on Aristotle's Rhetoric, I offer the alternative of a political project of moral persuasion. Instead of seeking to address the problem of cross-cultural judgement by coup de plume, liberals' best hope is to obviate it in practice, by forging a global, minimally liberal, overlapping consensus. As moral persuaders liberals would intrude actively in nonliberal debates and would seek to convince nonliberals from within their various lights, of the worthiness of the commitment to the freedom and equality of persons. (shrink)

We give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical case by M. Parigot.

In 1990 J-L. Krivine introduced the notion of storage operators. They are $\lambda$ -terms which simulate call-by-value in the call-by-name strategy and they can be used in order to modelize assignment instructions. J-L. Krivine has shown that there is a very simple second order type in AF2 type system for storage operators using Gödel translation of classical to intuitionistic logic. In order to modelize the control operators, J-L. Krivine has extended the system AF2 to the classical logic. In his system (...) the property of the unicity of integers representation is lost, but he has shown that storage operators typable in the system AF2 can be used to find the values of classical integers. In this paper, we present a new classical type system based on a logical system called mixed logic. We prove that in this system we can characterize, by types, the storage operators and the control operators. (shrink)

We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e., in presence of all the usual connectives) classical natural deduction.

In 1990, J.L. Krivine introduced the notion of storage operator to simulate, in $lambda$-calculus, the 'call by value' in a context of a 'call by name'. J.L. Krivine has shown that, using Gödel translation from classical into intuitionistic logic, we can find a simple type for storage operators in AF2 type system. In this present paper, we give a general type for storage operators in a slight extension of AF2. We give at the end (without proof) a generalization of this (...) result to other types. (shrink)

In 1990, J. L. Krivine introduced the notion of storage operator to simulate “call by value” in the “call by name” strategy. J. L. Krivine has showed that, using Gödel translation of classical into intuitionistic logic, one can find a simple type for the storage operators in AF2 type system. This paper studies the ∀-positive types and the Gödel transformations of TTR type system. We generalize by using syntactical methods Krivine's theorem about these types and for these transformations. We give (...) a proof of this result in the case of the type of recursive integers. (shrink)

The storage operators were introduced by J.L. Krivine ([6]); they are closed λ-terms which, for some fixed data type (the integers for example), allow to simulate “call by value” while using “call by name”. J.L. Krivine showed that such operators can be typed, in the type system, using Gödel's translation from classical to intuitionistic logic ([8]).This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and iterative representation of data in (...) λ-calculus. We obtain the following result:We can find typed strong storage operators for the recursive representations of data type, but that is not the case for the iterative representations of an infinite data type.We give the proof of this result in the case of integers. (shrink)

Forty-five children between the ages of nine and twelve years, who were forced to flee their native Sudan and seek refuge in Egypt, were interviewed about their everyday life in Cairo. Phenomenological analyses of the transcripts revealed the physical, social and technological dimensions to their encounter with a new cultural world. The interviews also revealed the extent to which the children had to face racism, discrimination and social exclusion. Specific analyses of children’s difficulties in learning a new form of Arabic (...) and their involvement in play and games indicated that a refugee child develops his or her self-identity as a stranger by reflecting on particular confrontations with the new environment. Finally, comparative analyses across age groups led to the construction of a phenomenological-developmental model of the child refugee. Both the model and the findings are discussed in the context of Alfred Schutz’s (1964a) essay The Stranger, George Herbert Mead’s (1967) communicative model of the self and Binnie Kristal-Andersson’s (2000) psychological framework for understanding migration. (shrink)

Forty-five children between the ages of nine and twelve years, who were forced to flee their native Sudan and seek refuge in Egypt, were interviewed about their everyday life in Cairo. Phenomenological analyses of the transcripts revealed the physical, social and technological dimensions to their encounter with a new cultural world. The interviews also revealed the extent to which the children had to face racism, discrimination and social exclusion. Specific analyses of children’s difficulties in learning a new form of Arabic (...) and their involvement in play and games indicated that a refugee child develops his or her self-identity as a stranger by reflecting on particular confrontations with the new environment. Finally, comparative analyses across age groups led to the construction of a phenomenological-developmental model of the child refugee. Both the model and the findings are discussed in the context of Alfred Schutz’s (1964a) essay The Stranger, George Herbert Mead’s (1967) communicative model of the self and Binnie Kristal-Andersson’s (2000) psychological framework for understanding migration. (shrink)

In this paper we consider a type system with a universal type $omega$ where any term (whether open or closed, $beta$-normalising or not) has type $omega$. We provide this type system with a realisability semantics where an atomic type is interpreted as the set of $lambda$-terms saturated by a certain relation. The variation of the saturation relation gives a number of interpretations to each type. We show the soundness and completeness of our semantics and that for different notions of saturation (...) (based on weak head reduction and normal $beta$-reduction) we obtain the same interpretation for types. Since the presence of $omega$ prevents typability and realisability from coinciding and creates extra difficulties in characterizing the interpretation of a type, we define a class ${mathbb U}^+$ of the so-called positive types (where $omega$ can only occur at specific positions). We show that if a term inhabits a positive type, then this term is $beta$-normalisable and reduces to a closed term. In other words, positive types can be used to represent abstract data types. The completeness theorem for ${mathbb U}^+$ becomes interesting indeed since it establishes a perfect equivalence between typable terms and terms that inhabit a type. In other words, typability and realisability coincide on ${mathbb U}^+$. We give a number of examples to explain the intuition behind the definition of ${mathbb U}^+$ and to show that this class cannot be extended while keeping its desired properties. (shrink)

The Public Policy Advisory Network on Female Genital Surgeries in Africa has written an article expressing concern about the media's inaccurate depiction of this practice and suggesting a more fact‐based approach to reporting on it. I applaud the network for soliciting input from various fields. I cannot agree more that some in the media have misconstrued, exaggerated, and used inflammatory language; words like “torture,” “barbaric,” and “horrific” will likely enrage readers while reinforcing discrimination against women who practice or have undergone (...) genital cutting. The authors also assert that “any genuine public policy debate should be grounded in the best available evidence and begins with fact checking.” Again, I couldn't agree more. My concern is that there is bias in the way some of the data are presented in this article. (shrink)

In this paper, we define a realizability semantics for the simply typed $lambdamu$-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. This result serves to give characterizations of the computational behavior of some closed typed terms. We also prove a completeness result of our realizability semantics using a particular term model.

In this paper, we present three methods to give the value of a classical integer in $\lambda\mu$ -calculus. The first method is an external method and gives the value and the false part of a normal classical integer. The second method uses a new reduction rule and gives as result the corresponding Church integer. The third method is the M. Parigot's method which uses the J.L. Krivine's storage operators.

In this paper, we present an extension of λμ-calculus called λμ++-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or.

In this paper, we present an extension of $lambdamu$-calculus called $lambdamu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or.

In this paper we discuss the interaction between science policies (and particularly in the area of scientific research) and higher education policies in Gulf and Mediterranean Arab countries. Our analysis reveals a discrepancy between the two sub-regions with respect to integration in the global market, cooperation in scientific research and international mobility of students. The paper discusses the implications of the analysis of reform policies and higher education restructuring.

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness (...) theorem of the L′T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′T logic and the intuitionistic and classical logics. (shrink)

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called equation image without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper (...) a Kripke-style semantics for a subsystem equation image of equation image for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system equation image with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic equation image. We introduce a reational semantics which has the advantage to allow an interpretation of the propositionnal logic equation image using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic equation image. (shrink)

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called equation image without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper (...) a Kripke-style semantics for a subsystem equation image of equation image for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system equation image with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic equation image. We introduce a reational semantics which has the advantage to allow an interpretation of the propositionnal logic equation image using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic equation image. (shrink)