scispace - formally typeset
Search or ask a question
Topic

Class (philosophy)

About: Class (philosophy) is a research topic. Over the lifetime, 821 publications have been published within this topic receiving 28000 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: Elliott's analysis of the parallels between the visions of capitalist transformation to be found in Marx and Schumpeter is extremely significant insofar as it requires a serious reexamination of the Schumpetersian system as discussed by the authors.
Abstract: John E. Elliott's [19801 article on some of the parallels between the visions of capitalist transformation to be found in Marx and Schumpeter is extremely significant insofar as it requires a serious reexamination of the Schumpeterian system. Elliott's argument, however, is somewhat misleading, since it overemphasizes the points at which their theories overlap, while largely neglecting the very crucial differences in "intentions and results" [Schumpeter, 1951, pp. 158-61]. It is nearly always a vain endeavor to attempt to analyze the often complex interconnections between economic theorists, while adopting the simple framework of an either-or of similarities and differences. The inadequacy of such a method is particularly evident in a case where the theorists being considered are each deservedly famous for their "dialectical imagination." In my view, most of Elliott's observations are reasonably accurate, though limited and misleading. However, in one crucial respect this general accuracy is violated, with important consequences for his overall approach. In his description of "Marx's version of the precapitalist exchange economy" and its relationship to Schumpeter's notion of the "circular flow," he confuses two quite different Marxian categories: "simple commodity production" and "simple reproduction" [1980, p. 50n]. It was the latter concept and not the former that was Marx's equivalent of Schumpeter's "circular flow," as well as Walras's "general equilibrium" and Marshall's "long-run equilibrium" [Sweezy, 1970, p. 277; Khan, 1957, pp. 73-76]. According to Elliott, the Marxian model of stationary equilibrium, which he takes to be equivalent to simple commodity production (a "simple exchange economy" in which exchange value is not the object of production), involves "the absence of a capital-labor class division" [1980, p. 50]. This is in clear contradiction to Marx's actual model of a steady-state economy (simple reproduction), which has as its basis not the absence of a division between capital and labor, but the assumption that

13 citations

01 Jan 2001
TL;DR: In this article, the authors consider the case where each unit representing a concept is described by a vector of distributions associated to p variables, and they aim to find simultaneously a "good" partition of these units and a model using "copulas" associated to each class of this partition.
Abstract: In Symbolic Data Analysis, more complex units can be considered like "concepts" (as towns, insurance companies, species of animals). A concept can be characterized by an "extent" defined by a class of standard units called "individuals" (as a sample of inhabitant of a town, a sample of insurance companies, a sample of animals of a given species). These classes can be described by a distribution associated to each variable, summarizing in that way huge sets of data. Therefore, here we are interested by the case where each unit representing a "concept" is described by a vector of p distributions associated to p variables. Our aim is to find simultaneously a "good" partition of these units and a model using "copulas" associated to each class of this partition. Different copulas models are recalled where the case of Markov process and Brownian motion are considered. The mixture decomposition problem is settled in this general case. It extends the standard mixture decomposition problem to the case where each unit is described by a vector of distributions instead as usual, by a vector of unique (categorical or numerical) values. Several generalization of standard algorithms are suggested. One of them is illustrated by a simple example. All these results are first considered in the case of a unique variable and then extended to the case of a vector of p variables by using a top-down binary tree approach. Finally, the case of infinite joint and copulas is considered.

13 citations

Journal ArticleDOI
TL;DR: In this article, a set of writing assignments and class activities for helping students to define their own writing problems, set their own goals, and evaluate their own progress are presented.
Abstract: Simple inquiry in most any writing class turns up this fact: after years of having their writings "corrected" and criticized by English teachers, most students cannot state in any precise and useful way just what their own writing problems are They have had specific errors pointed out to them, and they have made sweeping generalizations (eg, "I can't punctuate" or "I use 'wrong words"' or even "I can't write"); but they cannot say, "I don't know how to use commas with conjunctions" or "I tend to choose oversimplified theses" It is, however, these middle-level generalizations which are often the key to devising solutions Thus we are reminded of one of the most important implications of Mina Shaughnessy's Errors and Expectations: it is not enough to point out particular "errors" in students' writing; one must also help students generalize effectively (thereby reducing a multitude of "errors" to a manageable number of "problems"), devise or help them devise strategies for overcoming the problems, and help them incorporate those strategies into their writing processes Proper and precise problem-definition is often a prerequisite to efficient problem-solution In this article, we will present a set of writing assignments and class activities for helping students to define their own writing problems, set their own goals, and evaluate their own progress These assignments and activities are based on the following principles:

13 citations

Book ChapterDOI
12 Nov 2018
TL;DR: A novel framework for the concept learning problem called DL-Focl is proposed, designed to tackle the inherent myopia of the separate-and-conquer strategies and has been empirically tested against methods available in the DL-Learner suite showing interesting results.
Abstract: A prominent class of supervised methods for the representations adopted in the context of the Web of Data are designed to solve concept learning problems. Such methods aim at approximating an intensional definition for a target concept from a set of individuals of a target knowledge base. In this scenario, most of the well-known solutions exploit a separate-and-conquer approach: intuitively, the learning algorithm builds an intensional definition by repeatedly specializing a partial solution with the aim of covering the largest number of positive examples as possible. Essentially such a strategy can be regarded as a form of hill-climbing search that can produce sub-optimal solutions. To cope with this problem, we propose a novel framework for the concept learning problem called DL-Focl. Three versions of this algorithmic solution, built upon DL-Foil, have been designed to tackle the inherent myopia of the separate-and-conquer strategies. Their implementation has been empirically tested against methods available in the DL-Learner suite showing interesting results.

13 citations

Posted Content
TL;DR: In this paper, a model of dependent type theory (DTT) with Pi-, 1-, Sigma- and intensional Id-types, which is based on a slight variation of the category of AJM-games and history-free winning strategies, is presented.
Abstract: We present a model of dependent type theory (DTT) with Pi-, 1-, Sigma- and intensional Id-types, which is based on a slight variation of the category of AJM-games and history-free winning strategies. The model satisfies Streicher's criteria of intensionality and refutes function extensionality. The principle of uniqueness of identity proofs is satisfied. We show it contains a submodel as a full subcategory which gives a faithful model of DTT with Pi-, 1-, Sigma- and intensional Id-types and, additionally, finite inductive type families. This smaller model is fully (and faithfully) complete with respect to the syntax at the type hierarchy built without Id-types, as well as at the class of types where we allow for one strictly positive occurrence of an Id-type. Definability for the full type hierarchy with Id-types remains to be investigated.

13 citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
202311,771
202223,753
2021380
2020186
201962