a minimum of subsistence
A hundred years ago it was assumed and scientifically "proved" by economists that the laws of society make it necessary to have a vast army of poor and jobless people in order to keep the economy going. today, hardly anybody would dare to voice the principle. It is generally accepted that nobody should be excluded from the wealth of the nation, either by the laws of nature or by those of society. The opinions are outdated, which were current a hundred years ago, that the poor owed their conditions to their ignorance, lack of responsibility. In all western industrialized countries, a system of insurance has been introduced which guarantees everyone a minimum of subsistence in case of unemployment, sickness and old age. I would go one step further and argue that, even if these conditions are not present, in other words, one can claim this substance minimum without having to have any "reason". I would suggest, however, that it should be limited to a definite period of time, let’s say two years, so as to avoid the encouragement of an abnormal attitude which refuses any kind of social obligation.
This may sound like a fantastic proposal,
but so, I think, our insurance system would have sounded to people a
hundred years ago. The main objection to such a scheme would be that if
each person were entitled to receive minimum support, people would not
work. This assumption rests on the fallacy of the inherent laziness. In
human nature, actually, aside from abnormally lazy people, there would
be very few who would not want to earn more than the minimum, and who
would prefer to do nothing rather than work.
However,
the suspicions against a system of guaranteed subsistence minimum are
not groundless from the standpoint of those who want to use ownership
capital for the purpose of forcing others to accept the work conditions
they offer. If nobody were forced to accept work in order not to starve,
work would be sufficiently interesting and attractive in order to
induce one to accept it. Freedom of contract is possible only if both
parties are free to accept and reject if; in the present capitalist
system this is not the case.
But such a system would
not only be the beginning of real freedom of contract between employers
and employees, its principal advantage would be the improvement of
freedom in interpersonal relationships in every sphere of daily life.
然而,有些人想利用资本所有权来迫使其他人接受他们提的工作条件。从这些人的立场看来,对最低生活保障制度持怀疑态度不是没有道理的。
a minimum of subsistence的更多相关文章
- L208
A hundred years ago it was assumed and scientifically “proved” by economists that the laws of societ ...
- [LeetCode] Minimum Moves to Equal Array Elements II 最少移动次数使数组元素相等之二
Given a non-empty integer array, find the minimum number of moves required to make all array element ...
- [LeetCode] Minimum Moves to Equal Array Elements 最少移动次数使数组元素相等
Given a non-empty integer array of size n, find the minimum number of moves required to make all arr ...
- [LeetCode] Minimum Number of Arrows to Burst Balloons 最少数量的箭引爆气球
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided ...
- [LeetCode] Minimum Height Trees 最小高度树
For a undirected graph with tree characteristics, we can choose any node as the root. The result gra ...
- [LeetCode] Minimum Size Subarray Sum 最短子数组之和
Given an array of n positive integers and a positive integer s, find the minimal length of a subarra ...
- [LeetCode] Find Minimum in Rotated Sorted Array II 寻找旋转有序数组的最小值之二
Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed? Would ...
- [LeetCode] Find Minimum in Rotated Sorted Array 寻找旋转有序数组的最小值
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 migh ...
- [LeetCode] Minimum Depth of Binary Tree 二叉树的最小深度
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shor ...
随机推荐
- JavaScript 原型 prototype 使用经验
初始化一个父类,并添加方法 1function Foo(){}2Foo.prototype.sayName = function(){3 return '初始原型';4}56var foo1 = ...
- jenkins+gitlab+webhook实现自动发布
实验环境 Jenkins:192.168.1.15 Gitlab:192.168.1.14 一.Jenkins配置 1:安装gitlab hook plugin插件 2:新建一个job 3 ...
- 自动化运维之SaltStack实践
自动化运维之SaltStack实践 1.1.环境 linux-node1(master服务端) 192.168.0.15 linux-node2(minion客户端) 192.168.0.16 1.2 ...
- 剑指Offer-41.和为S的连续正数序列(C++/Java)
题目: 小明很喜欢数学,有一天他在做数学作业时,要求计算出9~16的和,他马上就写出了正确答案是100.但是他并不满足于此,他在想究竟有多少种连续的正数序列的和为100(至少包括两个数).没多久,他就 ...
- ubuntu14.04编译vim8.1
安装依赖 这一步其实我没做,直接下载编译成功了.估计有些包不是必需的.姑且列在这里供参考 sudo apt install libncurses5-dev libgnome2-dev libgnome ...
- 远程桌面MATLAB启动失败问题解决
博客:博客园 | CSDN | blog 远程桌面打开MATLAB会报错,解决办法,打开matlab的licenses路径,如matlab/R2017b/licenses/,路径下存有license文 ...
- CSS flex 布局快速入门
以前已经学过flex了,一直没做笔记,现在做下笔记再回忆下. 首先,flex布局的迷之属性们,如果一知半解,机械记忆的话,那不到半个月基本忘光光.先感受一下这12个flex布局属性,是不是很“迷”人. ...
- 代码的鲁棒性:链表中倒数第k个结点
题目描述 输入一个链表,输出该链表中倒数第k个结点.例如:输入一个链表,输出该链表中倒数第k个结点.为了符合大多数人的习惯,本题从1开始计数,即链表的尾结点是倒数第1个结点.例如一个链表有6个结点,从 ...
- javascript for循环+异步请求导致请求顺序不一致
工作中遇到一个问题 for循环,再把循环出来的ID再进行二次请求 这就导致一个问题 请求结果返回顺序不一致 原因:异步请求会把回调事件放入微任务事件队列,宏任务执行完毕再执行微任务,具体参考事件队列机 ...
- ArcGIS JS 4加载第三方矢量切片
现在矢量切片越来越普及,对于地图渲染能更轻更快.ArcGIS JS 4.13可以实现加载第三方矢量切片,以下为代码示例,最下方是我之前切的建筑物数据. 当切片大小在1M左右,加载效果还 ...