text:
Major Samuel Ives Sutton1
M, #432891, d. 3 February 1850
Major Samuel Ives Sutton was the son of Rear-Admiral unknown Sutton.2 He married Julia Harvey, daughter of General Sir Robert John Harvey and Charlotte Mary Harvey, on 14 November 1837.1 He died on 3 February 1850.1
Charlotte Emma Harvey1
Charlotte Emma Harvey was the daughter of General Sir Robert John Harvey and Charlotte Mary Harvey.2 She married Reverend Henry Churchman Long, son of Reverend Robert Churchman Long and Jane Walter, on 18 September 1838.1 She died on 25 December 1895, leaving issue.1
From 18 September 1838, her married name became Long.
Reverend Robert Churchman Long1
M, #432893, b. 1761, d. 1841
Reverend Robert Churchman Long was born in 1761 at Norfolk, England.2 He was the son of Robert Cowan Long and Anna Churchman.3 He married Jane Walter, daughter of Reverend Neville Walter and Rachel Hamilton, on 12 November 1794 at Norwich, Norfolk, England.2 He died in 1841 at Newton Abbott, Devon, England.2,3
He was given the name of Robert Churchman Kellett at birth.2 On 1797 Reverend Robert Churchman Long title's name changed to Robert Churchman Long on inheriting Dunston manor from Sarah Long.2 He lived at Dunston Hall, Norfolk, EnglandG.1
Children of Reverend Robert Churchman Long and Jane Walter
Reverend Henry Churchman Long4 d. 21 Apr 1884
Robert Kellett Long+3 b. 4 May 1804, d. 26 Feb 1874
[S7529] WikiTree, online http://www.wikitree.com/. Hereinafter cited as WikiTree.
[S5663] Clif Knight, "re: Bendish Family," e-mail message to Darryl Roger LUNDY (101053), 18 October 2011. Hereinafter cited as "re: Bendish Family."
Reverend Henry Churchman Long1
M, #432894, d. 21 April 1884
Reverend Henry Churchman Long was the son of Reverend Robert Churchman Long and Jane Walter.2 He married Charlotte Emma Harvey, daughter of General Sir Robert John Harvey and Charlotte Mary Harvey, on 18 September 1838.1 He died on 21 April 1884.1
He was the Rector at Swainsthorpe, EnglandG.1
Margaret Steell1
Margaret Steell married Mathew Isacke.1
Her married name became Isacke.1
Child of Margaret Steell and Mathew Isacke
Robert Mathew Isacke+1 b. 20 Nov 1803
[S3508] S. Thomson, "email: Kirwan Family," e-mail message to Darryl Roger Lundy, 16 January 2009 - 12 February 2010. Hereinafter cited as "email: Kirwan Family."
Robert James Isacke1
Robert James Isacke was born in 1837.1 He was the son of Robert Mathew Isacke and Matilda Scrymgeour-Wedderburn.1 He died in 1869.1
Alexander Scrymgeour-Wedderburn1
M, #432897, b. 3 January 1807
Alexander Scrymgeour-Wedderburn was born on 3 January 1807 at Edinburgh, Midlothian, ScotlandG.1 He was the son of Henry Scrymgeour-Wedderburn and Mary Turner Maitland.1
Robert Lambart Sutton Harvey1
M, #432898, b. 12 September 1847, d. 4 September 1864
Robert Lambart Sutton Harvey was born on 12 September 1847.1 He was the son of Sir Robert John Harvey Harvey, 1st Bt. and Lady Henrietta Augusta Lambart.2 He died on 4 September 1864 at age 16.1
Colonel Sir Charles Harvey, 2nd Bt.1
M, #432899, b. 25 February 1849, d. 30 January 1928
Colonel Sir Charles Harvey, 2nd Bt. was born on 25 February 1849.1 He was the son of Sir Robert John Harvey Harvey, 1st Bt. and Lady Henrietta Augusta Lambart.2 He married, firstly, Jane Ann Green, daughter of Benjamin Green, on 6 March 1870.1 He married, secondly, Mary Anne Edith Cooke, daughter of G. F. Cooke, on 1 February 1893.2 He died on 30 January 1928 at age 78.2
He succeeded as the 2nd Baronet Harvey, of Crown Point, Trowse, Norfolk [U.K., 1868] on 19 July 1870.1 He gained the rank of Colonel in the 4th Battalion, Norfolk Regiment.1 He held the office of Justice of the Peace (J.P.) for Norfolk.1 He lived at Rainthorpe Hall, Norwich, Norfolk, EnglandG.1
Children of Colonel Sir Charles Harvey, 2nd Bt. and Jane Ann Green
Sibyl Henrietta Harvey2 d. 9 May 1949
Christabel Katherine Harvey2 d. 2 May 1894
Gabrielle Jean Harvey+2 d. 3 Feb 1936
Sir Charles Robert Lambart Edward Harvey, 3rd Bt.+2 b. 16 Apr 1871, d. 15 Nov 1954
Child of Colonel Sir Charles Harvey, 2nd Bt. and Mary Anne Edith Cooke
Sir Oliver Charles Harvey Harvey, 1st Baron Harvey of Tasburgh+2 b. 26 Nov 1893, d. 29 Nov 1968
Lambart Edward Harvey1
M, #432900, b. 5 October 1850, d. 20 January 1871
Lambart Edward Harvey was born on 5 October 1850.1 He was the son of Sir Robert John Harvey Harvey, 1st Bt. and Lady Henrietta Augusta Lambart.2 He died on 20 January 1871 at age 20.1


There are too few diets where you can see bananas included in the list of recommended foods. However, you can enjoy bananas from time to time. Bananas are good and you need them even during your weight loss. They have lots of fiber. More than that, bananas are much more filling than other fruits. They are fragrant and sweet and you can add them to your smoothies, salads or eat them raw.


A true masterpiece: In their third album, the Babak Nemati Quartet shines with avant-garde courage, wild enthusiasm and brilliant compositions. The quartet presents an exhilarating musical journey from Tehran to Zurich, from Esfahan to Berne, and all the way back from Geneva and Winterthur to Shiraz. Babak Nemati was born in Tehran and grew up in Switzerland. In his music, he reveals two worlds that could not be more different. The audience is taken on a journey where they experience a wide, colourful spectrum of sound and energetic solos with a touch of the Orient. Safar is a vibrant, carefully thought-out concept album.


text:
About the SEP
How to Cite the SEP
Support SEP
Support the SEP
PDFs for SEP Friends
SEPIA for Libraries
Entry Navigation
Back to Entry
Entry Contents
Entry Bibliography
Friends PDF Preview
Author and Citation Info
Supplement to Alonzo Church
D. The λ-Calculus and Type Theory
D.1 Church's Lambda Calculus
D.2 Church's Simple Theory of Types
D.3 The Ramified Theory of Types
According to Church, a
function is a rule of correspondence by which when anything is given (as argument) another thing (the value of the function for that argument) may be obtained. (1941 [BE: 201])
The λ-calculi are essentially a family of notations for representing functions as such rules of correspondence rather than as graphs (i.e., sets or classes of ordered pairs of arguments and values).
The λ-operator is a monadic variable binding "abstraction" operator that allows one to build complex expressions that designate functions. For example, the occurrence of the numerical successor function—henceforth "\(S(x)\)"—in the form "\(S(x) \gt 1000\)" is meaningless until we pick a particular natural number as the value for "\(x\)". In contrast, the occurrence of "\(S(x)\)" in the form "\(S(x)\) is primitive recursive" designates a particular function. Using "λ" we can build an expression that designates this function by writing
\[\lambda x [S(x)].\]
We can also introduce n-adic λ-abstracts that designate n-ary functions (or functions of \(n\) variables) such as the dyadic
\[\lambda xy [x + y].\]
Complex predicates including those from natural language can also be treated as functions—from individuals to truth values. For this reason, λ-abstracts have become part of the meta-language of formal semantics.(see Partee et al. 1990 as well as Heim & Kratzer 1998—two enormously influential textbooks). For example, from the form "\(x\) is a Polish diplomat and \(x\) is a great pianist", we can obtain the corresponding complex predicate:
\[ \lambda x[x \text{ is a Polish diplomat and } x \text{ is a great pianist}]. \]
Intuitively, this can be read as "is an individual who is both a Polish diplomat and a great pianist". One can also build compound n-adic λ-abstracts from compound formulas. For example, from the form "\(x\) is evenly divisible by \(y\) and \(y\) is not evenly divisible by \(x\)" one can obtain
\[ \lambda xy[x \text{ is evenly divisible by } y \text{ and } y \text{ is not evenly divisible by } x]. \]
In general, for any expression (form, formula, term, definite description, λ-abstract) Ψ and variables \(\ulcorner \alpha_1,\ldots \alpha_n \urcorner\), one can obtain
\[ \lambda \alpha_1,\ldots \alpha_n [\Psi\alpha_1,\ldots \alpha_n]. \]
All such expressions are compound function expressions.
However, instead of forming compound n-adic λ-abstracts that represent n-ary functions (or functions of \(n\) variables), Church iterates monadic "λ" and reduces n-ary functions to functions of one variable whose values are functions of \(n-1\) variables. (This is the method known today as "Currying", for Haskell Curry, although the method is due to Moses Schönfinkel; see Church 1941 [BE: 202–3].) Rather than writing "\(x + y\)" for the function from pairs of natural numbers to their sum we write "\(((+ x) y)\)". For any number \(x\), we want "\(+ x\)" to designate the function of one variable that when applied to the value of this variable gives another function \((+ x)\) that for any number \(y\) gives \(((+ x) y)\), i.e., the sum of \(x\) and \(y\), and thus adds \(x\) to any number \(y.\) In this way, we input each variable into a separate function. Rather than using n-adic "λ" and writing
\[\lambda xy [x + y]\]
we use monadic "λ" and write
\[\lambda x(\lambda y [+ x]y).\]
In this notation "\(\lambda x (\lambda y[+x]y)\)" designates the function of one variable that when applied to the value of "\(x\)"—say 1—as argument gives another function designated by "\(\lambda y [+ 1]y\)" that for any number \(y\) adds 1 to its argument. Since the latter function is itself a function of one variable, we have reduced the function \(\lambda xy [x + y]\) of \(n = 2\) variables to a function of one variable whose value is a functions of \(n-1\) variables.
Having reduced n-adic λ-abstraction to iterated monadic λ-abstraction, for any expression (form, formula, term, definite description, λ-abstract) Ψ and variable \(\ulcorner \alpha\urcorner\), we can write
\[\lambda \alpha [\Psi\alpha]\]
\[\lambda \alpha_1,\ldots \alpha_n [\Psi\alpha_1,\ldots \alpha_n].\]
Church sometimes adopts Russell's notational convention (PM) that a dot placed before an expression brackets the expression. "\(\lambda \alpha [\Psi\alpha]\)" is then the same expression as
\[\lambda \alpha \hdot \Psi\alpha.\]
In general, this should be read as the function that assigns Ψ to α. When attached to a term, such an expression forms a compound monadic predicative formula, as in
\[\lambda y \hdot + 1y\ 2\]
\(\lambda x \hdot x\) is a Polish diplomat and \(x\) is a great pianist Paderewski.
In general, when \(\ulcorner \lambda \alpha \hdot \Psi\alpha]\urcorner\) is combined with an argument expression \(\beta\), it should be read as the value of the function that assigns Ψ to α for \(\beta\) as argument.
The elegance of the notation as a means for representing functions is obvious. The identity function, which is defined as \(I\alpha= \alpha\) for any argument \(\alpha,\) is represented by the abstract \(\ulcorner \lambda \alpha \hdot \alpha\urcorner\). The function that duplicates or replicates its own argument is represented by the abstract \(\ulcorner \lambda \alpha \hdot \alpha\alpha\urcorner\) (Church 1941 [BE: 202]). The constant function, which accepts α as well as any second argument \(\beta\) but always maps α to the same value regardless of \(\beta\), is represented by the abstract \(\ulcorner \hhdot \lambda \alpha \hdot \lambda b \alpha \urcorner\). (Note that Church sometimes adopts Russell's notational convention (PM) that a greater number of dots indicates an outside bracket, while a smaller number indicates an inside bracket.)
λ-abstracts are governed by three rules of inference:
\(\alpha\)-conversion: alphabetic changes of bound variables
λ-contraction: an occurrence of \(\ulcorner \lambda \alpha \hdot \Psi\alpha \beta\urcorner\) within a formula is replaced with one of \(\Psi\beta\)
λ-expansion: an occurrence of \(\Psi\beta\) within a formula is replaced with one of \(\ulcorner \lambda \alpha \hdot \Psi\alpha \beta\urcorner\).
Regarding the last two rules, it is required that Ψβ be the result of uniformly substituting free occurrences of \(\beta\) for free occurrences of α throughout Ψα. These two rules are together known as "λ-conversion" (although "λ-contraction" is sometimes known as "\(\beta\)-reduction" or "λ-concretion" and "\(\alpha\)-conversion" is sometimes known as "\(\alpha\)-reduction".) For example, from
Paderewski is a Polish diplomat and Paderewski is a great pianist
we can infer by λ-conversion
\(\lambda x \hdot x\) is a Polish diplomat and \(x\) is a great pianist Paderewski,
and vice versa. Similarly, from "\(\lambda x \hdot x\ a\)" we can infer "\(a\)" and vice versa, while from "\(\lambda x \hdot xx\ a\)" we can infer "\(aa\)" and vice versa. Likewise, from "\(1 + 2\)", i.e., "\(((+ 1) 2)\)" we can infer
\[ (\lambda y [+ 1]y) 2\] \[\lambda x(\lambda y [+ x]y)1, 2\]
and vice versa. Using our preferred notational convention:
\[\lambda y \hdot + 1y 2\] \[\lambda x \hhdot \lambda y \hdot + x y 1 2.\]
The process of λ-contraction terminates iff it results in an expression in normal form, where an expression is in normal form iff neither it nor any part of it is of the form \(\ulcorner \lambda \alpha \hdot \Psi\alpha \beta \urcorner\). For example, "\(aa\)" is the normal form of "\(\lambda x \hdot xx a\)" while "\(1 + 2\)" is the normal form of "\(\lambda x \hhdot \lambda y \hdot+ x y 1 2\)". Some expressions such as "\(\hhdot \lambda x \hdot xx \hhdot \lambda x \hdot xx\)" have no normal form; in this case applying λ-contraction to the expression yields the very same expression of the form \(\ulcorner \lambda \alpha \hdot \Psi\alpha \beta \urcorner\), so the process of λ-contraction does not terminate.
The above rule of alpha-conversion already allows that two distinct expressions—say, "\(\lambda x \hdot x a\)" and "\(\lambda y \hdot y a\)"—can represent the same function. Much more interestingly, from each of "\(\lambda x \hdot x a\)" and "\(\hhdot \lambda y \hdot \lambda x \hdot x y a\)" we can, by λ-conversion, infer \(a\), for any argument \(a\); however, by the above rules we cannot infer "\(\lambda x \hdot x\) " from "\(\hhdot \lambda y \hdot \lambda x \hdot x y\)". (It follows that if we restrict ourselves to the above rules, then these two expressions are not synonymous; cf. supplement E.) So we have two distinct λ-expressions that represent distinct functions with the same graph, which illustrates Church's innovation of representing functions as rules of correspondence (or functions in intension) rather than as graphs (or functions in extension).
However, the following are special cases of λ-contraction and expansion respectively, if Ψ is a monadic predicate or function symbol not containing any free occurrence of α:
eta-contraction: an occurrence of \(\ulcorner \lambda \alpha \hdot \Psi\alpha \urcorner\) within a formula can be replaced by one of \(\Psi\alpha\)
eta-expansion: an occurrence of \(\Psi\alpha\) within a formula can be replaced by one of \(\ulcorner \lambda \alpha \hdot \Psi\alpha \urcorner\).
If we allow eta-contraction as a special case of λ-contraction, then we can infer "\(\lambda x \hdot x\)" from "\(\hhdot \lambda y \hdot \lambda x \hdot x y\)". More generally, the theory becomes extensional because two closed expressions in normal form are distinct iff they designate functions that give different values for some argument and so have distinct graphs. Computable functions with the same graph are no longer distinct. For more information, see Hindley and Seldin (2008: ch. 7).
Another difference between functions and their graphs is that in an un-typed λ-calculus compound function expressions can be applied to themselves. For example, we can apply the identity function to itself, as in "\(\hhdot \lambda x \hdot x \hhdot \lambda x \hdot x\)", and infer "\(\lambda x \hdot x\)". We can also apply the constant function to a first argument \(a\) and to itself as the second argument, as in "\(\hhdot \lambda x \hdot \lambda yx a \hhdot \lambda x \hdot \lambda y x\)", and infer "\(a\)". However, if we were to identify such functions with their graphs, we would have to allow graphs that can contain themselves—something disallowed in conventional set theory by the axiom of foundation.
Given that compound function expressions can be applied to themselves, we can obtain a formula that purports to designate the Russellian function that does not apply to itself: "\(\lambda \rF \hhdot \neg \rF \hdot \rF\)", i.e., "\(\lambda \rF (\neg \rF[\rF])\)", which we shall call "\(R\)". The formula "\(RR\)" expresses that \(R\) applies to itself. By the definition of "\(R\)" and λ-conversion:
\[RR \leftrightarrow \lambda \rF \hhdot \neg \rF \hdot \rF R\]
But then, by an application of λ-contraction to the right hand side, \(RR \leftrightarrow \neg \hdot RR\). However, Church originally developed the λ-calculus within an un-typed deductive system that was supposed to provide a foundation for mathematics that avoided this paradox (1932, 1933). Neither \(RR\) nor \(\neg \hdot RR\) can be derived in the system of 1933, so the paradox cannot be obtained.
Numerals and arithmetical operations can be represented in the λ-calculus. Church begins with the numeral "1" (1941 [BE: 219]); but it is now common to begin with "0" and we do so here. We begin with an arbitrary function \(f\). To represent "0" we form a λ-abstract that designates \(f\) as well as the identity function with \(f\) unapplied:
\[ 0 =_{\textit{df}} \lambda f \hdot \lambda x \hdot x\]
Intuitively speaking, the connection between the designatum of this abstract and the familiar number 0 is that the identity function with \(f\) unapplied will always return x with nothing added to it, for any argument \(x.\)
To represent 1 we designate the same function as before but with \(f\) applied:
\[ 1 = \lambda f \hdot \lambda x \hdot fx\]
If \(g\) and \(h\) are functions, then there is another function that results from applying \(g\) to the result of applying \(h.\) This is designated by "\(\lambda x \hdot g(hx)\)" and is also called "the composition of \(g\) and \(h\)". For example, where the function \(h = \lambda x \hdot x^2\) and the function \(g = \lambda x \hdot x+1\), their composition \(= \lambda x \hdot x^2 + 1\) (i.e., first we square the value of \(x\) and then we add 1 to the result). To represent 2 we designate the function that when applied to \(f\) as argument gives the composition of \(f\) and itself:
\[2 = \lambda f \hdot \lambda x \hdot f(fx)\]
We iterate this method to represent the rest of the natural numbers:
\[\begin{align} 3 & = \lambda f \hdot \lambda x \hdot f(f(fx))\\ m & = \lambda f \hdot \lambda x \hdot f \ldots . (f(fx)). \end{align}\]
As noted in Supplement A, these numerals as well as the notion of normal form are essential to Church's basic undecidability argument.
The forgoing explanation of "the composition of \(g\) and \(h\)" took the function \(x+1\) for granted. This too can be represented in in the λ-calculus:
\[S(m) =_{\textit{df}} \lambda y \hdot \lambda f \hdot \lambda x \hdot f (y f x) m\]
For example, by this definition and λ-conversion
\[\begin{align} S(0) & = S(\lambda f \hdot \lambda x \hdot x)\\ & = (\lambda y\hdot \lambda f \hdot \lambda x \hdot f(y f x )) (\lambda f \hdot \lambda x \hdot x) \\ & =\lambda f \hdot \lambda x \hdot fx\\ & = 1. \end{align}\]
As Church remarks, this identification of the natural numbers with certain functions is allowable because the functions form a progression. Moreover, the arithmetical operations can also be represented in the λ-calculus (Church 1941 [BE: 220]).
For further discussion of Church's untyped λ-calculus see section 5. (See also Kleene [1981] as well as the entry on the lambda calculus and the section on λ-definability in the entry on Turing Machines.)
There are two basic observations behind the theory of types, one of which accords well with mathematical practice and the other with common sense. The first observation is that numbers, sets of numbers, sets of sets of numbers, functions, sets of functions, etc., are entities of different types, where types themselves are reflected in the language. This observation accurately reflects the practice of mathematicians who already know the types of the entities that they are thinking about when working in one or another subject area and who will draw type distinctions when working in a more general framework, like set theory, by using different kinds of symbols to designate numbers (e.g., "1", "2", "3"…, ), sets of numbers (e.g., "\(\stN\)") and sets of sets of numbers (e.g., "\(\cP(\stN)\)"). The second observation is that entities of a given type apply to entities of the highest type below their type, so do not apply to entities of their own type. This can be seen from the fact that while the expressions "Paderewski is over 5 feet tall", "Someone is over 5 feet tall", and "It is commonplace to be a person over 5 feet tall" are intelligible, "Everyone Paderewski", "Everyone someone", and "is over 5 feet tall is a commonplace quality to have" are all nonsense.
However, Church formulates his simple theory of types (STT) in a way that uses the λ-calculus to represent the typed entities as functions qua rules of correspondence rather than as sets or classes (cf. previous section). All expressions of STT are assigned types, which are the types of the entities that they designate. "\(\iota\)" symbolizes the type of individuals, "\(o\)" the type of truth values, and if α and β are type-symbols, then \(\ulcorner(\alpha\beta)\urcorner\) is the type-symbol of the type of functions from entities of type α to those of type β. (Church writes this \(\ulcorner(\beta\alpha)\urcorner\).) For example, "\((\iota o)\)" symbolizes the type of functions from individuals to truth values, and "\((oo)\)" symbolizes the type of functions from truth values to truth values.
According to STT, well-formed expressions are limited to:
Variables and constants of type α, for example "\(x_{\iota}\)", "\(P_o\)", and "\(\neg_{(oo)}\)".
Complex expressions of type β formed from expressions of type α and those of type \((\alpha \beta)\), for example "\(\neg_{(oo)} P_o\)"
λ-abstracts of type \((\alpha \beta)\) formed from variables of type α and expressions of type β
As a result of these restrictions, in STT there is no type of expressions δ formed only from expressions of type δ. It follows that \(R\)—"\(\lambda F \hhdot \neg F \hdot F\)", i.e., "\(\lambda F(\neg F[F])\)"—is not well formed, and so that Russell's paradox cannot arise.
Church himself did not pursue the investigation of his STT in great depth, but two remarkable students of his did: Leon Henkin and Peter Andrews. Henkin developed what is now understood to be the model theory for higher order logic. He introduced the distinction between standard and non-standard models of STT and proved a completeness theorem for validity defined in terms of non-standard models; although, as a consequence of the incompleteness theorems, no such theorem is possible for validity defined in terms of standard models (see the entry on Church's type theory for some details). Andrews first turned his attention to extending STT to transfinite types, which allows for a more uniform development of number and cardinality than in STT with only finite types; he then developed the proof theory of STT with an emphasis on automated reasoning. STT has inspired a lot of work on automation as well as on the application of STT to natural language semantics, mathematics and computer science, which is described in the entry on Church's type theory. (By the way, Church [1960, 1962a] also made important contributions to the theory of finite automata.)
Regarding the denotational semantics for STT, this is considerably more straightforward than that of un-typed λ-calculi. See Andrews (1986), which contains a lot of information about STT, much of which is also contained in the entry on Church's type theory.
The expressive power of STT raises an important issue that pertains to Church's objection to logicism as an economical foundation for elementary arithmetic (an objection noted in section 5):
However, the higher-order predicate (or functional) variables, together with comprehension principles which are required for them, mean in the presence of an axiom of infinity that even the non-denumerably infinite has been admitted. (1962 [BE: 611])
To understand this objection, it will be helpful to recall that the expressive power of second-order logic is obtained by laying down comprehension axioms, which are axioms stating that a formula Φ defines a second-order entity in the domain of the higher-order variables, such as a propositional function, or the characteristic function of a class. It will also help to recall that these axioms have the following form:
\[\exists P \forall x_1 \ldots x_n \hdot Px_1 \ldots x_n \leftrightarrow \Phi x_1 \ldots x_n\]
Now suppose that we want to define complex properties and functions of individuals (so we are staying at the second order). To do this we use the λ-abstraction operator discussed above. Then, by the axiom above, and recalling that in Church's system n-ary functions reduce to particular cases of functions of one variable, we can abstract the corresponding complex predicate, as follows:
\[\lambda x\hdot \Phi x .\]
In the context of STT we need to proceed beyond second order logic, so we need a more general comprehension axiom scheme stating that an expression \(\Psi_{\beta}\) of any type \(\beta\) defines a complex function \(u\) of type \(\ulcorner(\alpha\beta)\urcorner\), which does not occur free in \(\Psi_\beta\):
\[\exists u_{(\alpha\beta)} \forall x_a \hdot u_{(\alpha\beta)} x_\alpha \approxB \Psi_\beta\]
(Since \(\Psi_{\beta}\) is of any type β, we use boldface "\(\approxB\)", which reduces to "\(\leftrightarrow\)" in case Ψ is a formula, and to identity in case Ψ is a singular term. Further, since we now use lowercase Greek letters as variables ranging over types, we use "\(x\)", "\(u\)", "\(y\)" etc. as meta-language variables.) We designate the function whose existence is asserted directly above as
\[\lambda x_\alpha \hdot \Psi_\beta x_\alpha\]
So we have the comprehension scheme
\[\forall x_\alpha \hhdot \lambda x_\alpha \hdot \Psi_\beta x_\alpha \approxB \Psi_\beta\]
More perspicuously, we can designate the aforementioned function
\[\lambda x_\alpha \hdot \Psi_\beta\]
So the comprehension scheme becomes
\[\forall x_\alpha \hhdot \lambda x_\alpha \hdot \Psi_\beta \approxB \Psi_\beta\]
Corresponding to this axiom scheme, the λ-conversion rule of λ-expansion licenses the replacement, within a formula, of any occurrence of \(\Psi_\beta\) by the λ-abstract \(\ulcorner \lambda x_\alpha \hdot \Psi_\beta y_\alpha\urcorner\). The rule of λ-contraction licenses the reverse replacement. Notice that that \(x_\alpha\) and \(y_\alpha\) are required to be of the same syntactic type.
Church's worry about logicism can be appreciated by asking the following question. What are the possible values of the higher-order variables in the aforementioned comprehension axioms, under their classical extensional interpretation? To which the usual answer is that any given second-order variable "\(F\)" ranges over all sub-classes of the domain of individuals that "\(F\)" is true of. Further, any axiom of infinity implies that there are infinitely many individuals. In which case, any given second-order variable "\(F\)" ranges over all sub-classes of an infinite class, which is equivalent to the powerset of natural numbers \(\cP(\stN)\). Thus, as Church remarked, "the non-denumerably infinite has been admitted" (1962 [BE: 611]). This discredits logicism as an economical foundation for elementary arithmetic.
More important for Church's purposes than the status of logicism is the relationship between the Simple and the Ramified theories of types as described in Church (1976).
The motivation for ramification is to resolve all paradoxes: not only Russell's but also the semantical paradoxes such as Grelling's Paradox (GP) and the Russell-Myhill Paradox (RM), which are discussed in section 4. (Other semantical paradoxes addressed by ramification are those of Epimenides and Richard.) Although these semantical paradoxes do not arise in STT per se, they do arise in STT with the addition of a semantical predicate. Further, they can be solved—as Russell (1905; PM) discovered—by further stratifying each type. Intuitively, the idea is as follows:
Individuals have certain attributes such as having brown hair. Suppose that some attributes are such that all the children of a person who has these attributes also have them. These attributes are hereditary, and so we discern the attribute of attributes of being hereditary. Further suppose that some individuals have all of the aforementioned person's hereditary attributes. Here, "all" quantifies over attributes that have the attribute of being hereditary. Finally, suppose that we define the aforementioned person's descendants as the individuals (including that very person) who possess all of her hereditary attributes. As Poincaré (1906) and Russell (1905; PM) pointed out, such "impredicative" definitions display a kind of circularity. In the present case, we have helped ourselves to the notion of all of her hereditary attributes to define the notion of her descendants where being her descendants is itself one of her hereditary attributes. From the perspective of STT, it is perfectly legitimate to define expressions of lower type by using expressions of higher type. However, as we will see, from the point of view of ramified type theory (RTT) such definitions are illegitimate. (See also the entries on Poincaré and on Russell's paradox.)
Although it is helpful to have a prior understanding of STT in order to understand RTT, strictly speaking the type-theoretic notions involved are different. For this reason we adopt Church's policy of renaming the types "r-types" and using slightly different notation. Individual variables and names are assigned the type "\(i\)". Expressions are also assigned levels, represented by Hindu-Arabic numerals. Individual variables, names of individuals and names of propositions are of level 0. As for function expressions, these are assigned r-types as follows. If β is an r-type symbol, then \(\ulcorner(\beta)/n\urcorner\) is the r-type symbol of all function expressions of level \(n\) (where \(n \gt 1\), because only individuals and propositions are of level 0). For example, a function expression that takes individual variables and names, as well as functions, as its arguments has the r-type \((i (i))/n\). Further, \(\ulcorner(\alpha)/k\urcorner\) (where \(k \lt n\)) is of the level directly lower than \(\ulcorner(\beta)/n\urcorner\) if \(\ulcorner(\alpha) = (\beta)\urcorner\).
More generally (where \(m \ge 0)\), if \(\ulcorner \beta 1,\ldots \beta m\urcorner\) are r-type symbols, then \(\ulcorner(\beta 1,\ldots \beta m)/n\urcorner\) is the r-type symbol of all (m-place) function expressions of level n (where \(n \gt 1)\). Further, \(\ulcorner(\alpha 1,\ldots \alpha m)/k\urcorner\) (where \(k \lt n\)) is of the level directly lower than \(\ulcorner (\beta 1,\ldots \beta m)/n\urcorner\) if \(\ulcorner \alpha 1 = \beta 1\urcorner\),… \(\ulcorner \alpha m = \beta m\urcorner\). For \(\ulcorner(\beta 1,\ldots \beta 3)/n\urcorner\), Church uses the abbreviation "\(3/n\)" and, more generally, \(\ulcorner(\beta 1,\ldots \beta m)/n\urcorner\), is abbreviated "\(m/n\)".
To return to our example, "\(i\)" is attached to the individual variables "\(x\)", "\(y\)", that range over our descendants; these variables are also of level 0. By the above, the function expression "\(x\) has brown eyes" is r-typed "\(x\) has brown eyes"\(^{(i)/1}\). Similarly, "\(x\) is a descendant of \(y\)" is r-typed "\(x\) is a descendant of \(y\)"\(^{(ii)/1}\). Levels are cumulative, in the sense that the range of variables of each r-type includes the range of every variable of directly lower r-type.
Next, orders are defined as follows. The order of individual variables and names is 0. In the case of function expressions, the order of a variable of r-type \(\ulcorner (\beta 1,\ldots \beta m)/n\urcorner\) is the sum of n and the highest of the orders of the variables \(\ulcorner \beta \beta m\urcorner\) (reflecting that the levels are cumulative).
Now we can put all this together and apply it to our original example. In an un-typed language we can define F is hereditary as follows:
\[ \textrm{Hereditary}(F, R) \equiv_{\textit{df}} Fx \supset_x Rxy \supset_y Fy \]
(Note the notational convention that a connective can take a variable as subscript: that variable becomes a universal quantifier whose scope is precisely that of the connective.) In the present framework, since "\(x\)" and "\(y\)" are of level 0, while "\(F\)" and "\(R\)" are of level 1, "\(F\)" and "\(R\)" are also of order 1 (i.e., the sum of 0 and 1). Further, since Church's notational variant of "\(\forall\)" takes a name of a proposition as its argument, it is also of level 1 and order 1. Furthermore, there are no other argument expression in the definiens that are of a higher order than 1. Therefore, the level of Hereditary\((F, R)\) is 2 and its order is 3, which is the sum of 2 (its level) and 1 (the greatest of the orders of its arguments).
Finally, there is the restriction that for a function expression to be well formed, the highest order of any expression in the definiens must be of an order directly lower than the level of the definiendum. While this does not prohibit our definition of "\(\textrm{Hereditary}^{2/2}(F^{1/1}, R^{2/1})\)", it does prohibit using it in the aforementioned "impredicative" definition of "\(x\) is a descendant\(^{1/1}\)", since this function expression is of level 1. As will become clear in section 4.3 and section 4.4, the solutions to GA and RM emerge from the apparatus of ramified types.
Crucially, if we drop the level indicators entirely, then the orders of a given function expression become simply the highest of the orders of its arguments. In that case, the orders become simple types, i.e., the "orders" of contemporary "first order" and "higher order" logic. The reason is that in first order logic, the highest of the orders of the variables (i.e., of "\(x\)" "\(F\)", "\(R\)" etc.) is 1. Further, in second order logic, the highest of the orders of the variables (ranging over attributes of attributes such as being hereditary) is 2. Note that the resulting simple type theory in Church's (1974b) is not formulated in a λ-calculus. (For more on Church's formulation of RTT, see the entries on the notation for Principia Mathematica 5.2 and on Principia Mathematica 4.1.2.)
Copyright © 2021 by
Harry Deutsch <hdeutsch@ilstu.edu>
Oliver Marshall <Omarshall@gradcenter.cuny.edu>
Open access to the SEP is made possible by a world-wide funding initiative.
The Encyclopedia Now Needs Your Support
Please Read How You Can Help Keep the Encyclopedia Free
Mirror Sites
View this site from another server:
USA (Main Site) Philosophy, Stanford University
Info about mirror sites
The Stanford Encyclopedia of Philosophy is copyright © 2021 by The Metaphysics Research Lab, Department of Philosophy, Stanford University
Library of Congress Catalog Data: ISSN 1095-5054

redpajama_set_name: RedPajamaCommonCrawl


text:
Somogyi László  karmester, a magas színvonalú magyarországi karmesterképzés megteremtője.

Élete
Dr. Somogyi (Spitzer) Lajos (1868–1910) orvos és Kohn Berta fia. Zenei előtanulmányai (hegedű, zongora) után a budapesti Zeneakadémián 1935-ben végzett Kodály Zoltán (zeneszerzés) növendékeként. 1935-ben Brüsszelben Hermann Scherchen tanítványa volt. 1932-től 1936-ig a Budapesti Hangversenyzenekar hegedűse volt. 1936-ban vezényelte első hangversenyét a Zeneakadémia nagytermében, majd holland, belga, olasz városokban és Bécsben szerepelt.

1939-ben megalapította a zsidótörvények miatt állás nélkül maradt muzsikusok számára megélhetést nyújtó Goldmark Zenekart, amelynek vezetője is lett. 1945 és 1950 között a Budapest Székesfővárosi Szimfonikus Zenekar karmestereként működött. 1949-ben vette át a Zeneművészeti Főiskolán a karnagyképző vezetését Ferencsik Jánostól. A Zeneakadémián alkalmazott "Somogyi-módszer" a Scherchen által megalapozott pedagógia nagyszerű és inspirált továbbfejlesztése volt. 1951-től 1956-ig a Magyar Rádió Szimfonikus Zenekarának vezető karmestere volt.

1956-ban elhagyta Magyarországot és előbb Nyugat-Európában, majd az 1960-as évektől az Egyesült Államokban dolgozott. 1964 és 1970 között a New York Állam-beli Rochester Symphony Orchestra zeneigazgatója volt. Az 1970-es években visszatért Európába és Genfben telepedett le. le. Tanított a sienai Accademia Musicale Chigianán, valamint 1979 és 1982 között a szombathelyi Bartók Szemináriumon.

Magánélete
Házastársa Laub Jakab és Winternitz Hildegard lánya, Julianna volt, akit 1933. október 24-én Budapesten vett nőül.

Díjai, elismerései
 Kossuth-díj (1951)
 Érdemes művész (1952)
 Kiváló művész (1955)

Irodalom
 Kerekes István: Volt egyszer egy magyar karmester. Somogyi László és kora. 2., bőv., jav. kiadás. Budapest, 2006. Xynmios.

Jegyzetek

Források

 Magyar életrajzi lexikon. Főszerk. Kenyeres Ágnes. Budapest, Akadémiai Kiadó, 1994
 Somogyi László az OMIKE oldalán
 Szabolcsi Bence-Tóth Aladár: Zenei lexikon I-III. Átdolgozott új kiadás. Főszerk. dr. Bartha Dénes, szerk. Tóth Margit. Budapest, Zeneműkiadó Vállalat, 1965
 Búcsúzunk (1988. július 1.) Muzsika, 31. évfolyam, 7. szám

Kossuth-díjasok
Magyar karmesterek
Magyar egyetemi, főiskolai oktatók
Az OMIKE Művészakció résztvevői
Az 1956-os forradalom leverése miatt emigrált személyek
Zsidó származású magyarok
1907-ben született személyek
1988-ban elhunyt személyek
A holokauszt túlélői

redpajama_set_name: RedPajamaWikipedia


text:
Das Saarländische Ministerium der Finanzen und für Wissenschaft ist eines von sieben  Ministerien des Saarlandes. Geleitet wird das Ministerium seit dem 26. April 2022 von Minister Jakob von Weizsäcker (SPD), Staatssekretär ist Wolfgang Förster.

Geschichte

In der von 1946 bis 1947 amtierenden Verwaltungskommission des Saarlandes gab es noch keine Ministerien. Direktor für Finanzen war Christian Grommes. 1947 wurde das Finanzministerium dann als Ministerium für Finanzen und Forsten gegründet.

Bis heute wechselte das Ministerium mehrfach seine Zuständigkeiten. Folgende Namen trug es seit 1947:

Aufgaben
Das Ministerium ist unter anderem zuständig für:

 Steuern und Finanzämter
 Haushalt und Finanzen
 Statistik
 Zentrale Dienste
 Besoldung, Versorgung und Beihilfe
 Europa und SaarLorLux

Nachgeordnete Behörden
Dem Ministerium sind folgende Behörden nachgeordnet:

 Landesamt für Zentrale Dienste
 IT-Dienstleistungszentrum
 Finanzämter

Organisation
Neben dem Ministerbüro und dem Büro des Bürgerbeauftragten bestehen folgende Abteilungen:

 Abteilung A: Organisation, Personal, Haushalt, Recht und IT
 Abteilung B: Steuern, Steuerpolitik
 Abteilung C: Landeshaushalt, Beteiligungen, Bund-Länder Finanzbeziehungen
 Abteilung D: Planung, Steuerung, Controlling, Revision, Geschäftsstelle Zukunftssicheres Saarland
 Abteilung E: Europa, Interregionale Zusammenarbeit, Frankreich und Frankreichstrategie
 Abteilung F: Tax Compliance System, steuerliche Problemstellungen der Landesverwaltung
 Stabsstellen
 Stabsstelle IT-Sicherheitsmanagement und IT-Recht
 Stabsstelle Kontrollstelle EU-Fonds (Unabhängige Stelle, Prüfdienst, Prüfbehörde)
Beauftragte
 Antikorruptionsbeauftrage
 Frauenbeauftragte

Siehe auch
 Saarländische Landesregierung

Weblinks
 Offizielle Website

Einzelnachweise

Finanzen
Saarland
Saarland
Behörde (Saarbrücken)
Gegründet 1947


text:
Long IslandPoliticsSpin Cycle
Flanagan enters alcohol rehab again, will miss start of legislative session
Flanagan (R-East Northport) entered a 30-day residential program before Christmas, according to his staff.
Senate Minority Leader John Flanagan (R-East Northport) Photo Credit: Howard Schnapp
By Yancey Roy yancey.roy@newsday.com @yanceyroy Updated January 4, 2019 5:36 PM
ALBANY — State Senate Minority Leader John Flanagan announced Friday that he is in an alcohol-treatment program again and will miss the opening of the 2019 legislative session.
Flanagan (R-East Northport) had sought alcohol treatment during summer 2017, though that wasn't through an inpatient setting. This time, the senator entered a 30-day residential program before Christmas, said his staff, which issued the statement on his behalf. That timetable means Flanagan entered treatment just weeks after winning a bruising internal Senate Republican fight to remain the GOP conference leader.
In a statement issued to the media, Flanagan didn't say when he might return to the State Capitol. However, afterward Senate staff said he is expected back after Martin Luther King Jr. Day, Jan. 21.
"Recently, I recognized the need to seek some additional help to overcome my battle with alcohol dependency. This was a difficult choice, but it is the right one for myself and for my family. I must now make my health and well-being my number one priority," said Flanagan, 57.
"I thank my friends and colleagues for their patience, for their love and for their understanding, and am very much looking forward to the upcoming legislative session," he continued. "This brief period of time away is necessary for my overall well-being, but will in no way impact my ability to serve my conference or my constituents."
Deputy Minority Leader Joseph Griffo (R-Rome) will take over Flanagan's duties in the interim. The legislative session formally begins Wednesday.
Flanagan has been a fixture in the State Legislature since 1986, when, at 25 years old, he was elected to an Assembly seat long held by his father. He served 16 years in the lower house before being elected to the State Senate in 2002.
He has been the Senate Republican leader since May 2015, taking over after then-Sen. Dean Skelos was indicted (and later convicted) on public corruption charges. Under Flanagan, the GOP held on to its narrow 32-31 majority in the 2016 elections and he remained Senate majority leader and the most powerful Republican in New York.
Get the Breaking News newsletter!
Get the latest breaking news as it happens.
But in 2018, Democrats rode anger about Republican President Donald Trump and a high turnout to flip eight seats and take a commanding majority in the State Senate. Democrats also won all the statewide offices.
Immediately after what they called an Election Day "drubbing," some Republicans called for Flanagan's ouster and said it was time for an upstate leader. But, following a lengthy closed-door meeting at the Capitol, Flanagan prevailed in a 14-9 vote over Sen. Cathy Young (R-Olean), although with a new title that reflected the GOP's lost status: Minority leader.
Young issued a statement Friday in support of Flanagan's decision.
"It takes great courage and strength to recognize when an addiction has a dangerous grip on one's life and to seek outside help in combating the problem. I commend Senator Flanagan for bravely choosing that path," Young said. "Addiction is a lifelong struggle and one that must be won each and every day. My heartfelt best wishes and support are extended to him and his family at this difficult time."
. Other senators also issued statements of support.
Griffo said: "Leader Flanagan has always been a selfless leader, putting his professional responsibilities, obligations and duties above his own needs and I applaud his courage in confronting this disease ... I am honored to accept the responsibility of leading the state Senate's Republican conference on an interim basis."
New Senate Majority Leader Andrea Stewart-Cousins said in a statement: "Senator John Flanagan is a friend and colleague, and I wish him well during this difficult time. I respect John's candor and his recognition that he must take care of his health."
By Yancey Roy yancey.roy@newsday.com	@yanceyroy
After losses, Senate GOP keeps Flanagan as leaderALBANY -- State Senate Republicans re-elected Long Island's John Flanagan as their leader Friday, despite ...


On Saturday 30 August 2014 from 2 p.m., the town of Svitávka near Boskovice (about 40 km north of Brno) will be the venue of a celebration of the Löw-Beer villas, which conclude the "Low-Beer Villas" project. The event will include a professional conference with presentations by PhDr. Jaromír Hanák (Brno Museum), PhDr. Petra Svobodová (Brno Museum, Curator of the Löw-Beer Villa in Brno), Pavel Krejcar (Svitávka archivist), Ing. arch. Iveta Černá (Museum of the City of Brno, Villa Tugendhat Director), PhDr. Dagmar Černoušková (Brno City Museum, Study and Documentation Centre at Villa Tugendhat), Mgr. Vladimír Velešík and Mgr. Vladimír Velešík jun. (editors and co-authors of the book "The Löw-Beer Villas"). The ceremony will conclude with a gala launch of the book "The Löw-Beer Villas" and the premiere of the film "The Story of a Found Suitcase."


Last week, the college where I teach near Boston, graduated another class of seniors. In retrospect, I cried and clapped more in a three hour commencement ceremony than is normal even for me, an effervescent type who wears her heart on her sleeve. But why wouldn't one be super excited for the bright futures these young graduates have ahead of them?
And when I look back on my own college graduation more than 41 years ago, and when I do the math, I realize that if I had started saving $5 bills back then in 1975, I'd have a heck of a lot more than $40,000 saved in $5 bills (which is approximately what I have put aside now after 12 years). So, for any recent grads reading (or any reader who knows a recent grad and wants to pass along this tip), why not commence now to never again spend a $5 bill and save them instead and see how fast your nest egg will grow?
The good news is that it's a lot easier to part with $5 today than it was that summer when I rented my first apartment, a two bedroom that I shared with a college friend and each of us paid—are you ready for this—-$112.50 a month!
Which brings me to the point of this post. Whether you're a recent college graduate, a senior citizen, or somewhere in between, make the month of May, the traditional season of graduations, or commencements, be the time you start saving your $5 bills.


text:
April 29th 2012 07:36:03 AM
More on Journalism in Independent Kosovo
May I just say again: Good job, Free World. This is related to my previous posts about attacks on journalists in Albanian-ruled Kosovo, where Albanian journalists have themselves contrasted this "Newborn" Kosovo with the one from the days under Belgrade, when they could print what they wanted about the "evil Serbian regime" — without getting killed.
SEEMO Condemns Pressure against Journalists in Kosovo (Press Release, March 22)
Vienna, 21 March 2012 - The Vienna-based South East Europe Media Organisation (SEEMO), an affiliate of the International Press Institute (IPI), condemns the latest pressure against the reporters of the "Justice in Kosovo" TV program.
On 6 March 2012, the mayor of Prizren, a town 60 kilometers away from Pristina, Kosovo's capital, allegedly threatened the TV crew of the program "Justice in Kosovo." He reportedly said that he would break their camera if they did not leave the restaurant where the reporters tried to obtain an official declaration from the mayor.
"Justice in Kosovo" is transmitted on Kosovo public broadcaster Radio Television Kosovo (RTK) and deals with corruption, among other legal topics.
SEEMO has learned that the program team had long sought to interview the mayor, regarding the allegations about irregular financing of political parties and the apparent misuse of public tenders in the Municipality of Prizren. The mayor refused to meet the reporters. When they found him in a local restaurant and tried to record his views on camera, the mayor allegedly threatened the journalist, while his chief of protocol grabbed the reporter by the arm and tried to push him out of the restaurant.
"I urge Kosovo political authorities, especially on the local level, to abstain from pressuring media," said SEEMO secretary general Oliver Vujovic.
The public has the right to know what their representatives are doing."
Or the public might prefer to help threaten the journalists trying to tell them.
On SEEMO's main page, I discovered the following story, which will send me to bed laughing:
SEEMO Supports Kosovo Journalists in Struggle to Change New Criminal Code (April 24)
The Vienna-based South East Europe Media Organisation (SEEMO), an affiliate of the International Press Institute (IPI), is dismayed at recent changes in the Kosovo Penal Code, approved on April 20, 2012, in the Kosovo parliament.
According to the controversial articles 37 and 38, journalists will be held criminally liable if they do not reveal their sources. These changes, approved by MPs against the opinion of the Association of Professional Journalists of Kosovo and other civil society organizations, as well as against the advice of the Ministry of Justice, appear to benefit those accused of bribery or illicit activities.
One daily illustrated the situation: a journalist could end up in prison if he or she does not reveal a source that has denounced irregularities or bribes.
These legal changes still have to be signed off on by Kosovo President Atifete Jahjaga.
"I urge the president not to sign off on these reforms of the criminal code, and to return the law to the parliament," said SEEMO Secretary General Oliver Vujovic. "The new legal provisions violate freedom of expression standards and would make press work extremely dangerous. If Kosovo has opted to construct a democratic society, democratic principles have to be upheld. These amendments have to change and defamation and libel fully decriminalised."
Yes, let's see what President Jahjaga "decides." (Hint: She has no room to decide anything, as she is a mere puppet of the documented criminals that make up the Kosovo government.) This would be the same President Jahjaga that just gave back-to-back Washington-organized propaganda tours around the U.S., to unanimous praise in puff pieces from The Washington Times, Huffington Post, Asbury Park Press The Daily Beast, Patriot Ledger, the student paper at Dartmouth College where she spoke several weeks ago, and others. It's interesting that the Kill-the-Source legislation (not unlike Kosovo's Kill-the-Witness justice system) was floated and approved in the first place, given that Kosovo isn't supposed to make a move without Washington's approval. Of course, we know that anything that helps Washington cover Kosovo's tracks — including witness-intimidation, evidence removal/destruction, and investigation-prevention — is welcome indeed. Journalists and their sources aren't excluded from the hit list. If Washington-Pristina keeps on like this, there will be as few living Albanians left in Kosovo as there are Serbs and Roma.
In the end, at least Kosovo Albanians will have learned the difference between real journalism, and the KLA propaganda they'd previously purveyed under that guise.
Kosovakbar!


Do People Care About Inequality?
A relatively small share, fewer than 20% in most countries, said they preferred type A, B, or C. This isn't surprising; each of those three has a large share of the population at the bottom. The bulk of respondents selected either type D or type E.
D and E are identical in their population shares at the bottom. The difference between them is that D has a larger share in the middle, whereas E has a larger share at the top. Average income is higher in E. Inequality is lower in D.
Interestingly, more respondents in the ISSP survey preferred D than preferred E. The results are strikingly similar across countries, even among nations that seemingly have very different orientations toward affluence and equality.
I wouldn't go so far as to conclude from this that people tend to value low inequality over high incomes. Other ways of posing the question might yield different results. But it does suggest that inequality matters to people.
It might be easy to interpret these responses of indicating some kind of moral sense of justice in people preferences.
I think an alternate reading of the results would be that given that the respondents were choosing a distribution independent of their position on it, it might be that instead of some sense of justice that minimises inequality, they fear the possibility of being low on the distribution and so choose the one that instead minimises the chance of themselves being poor(er).
Secondly, given that feeling rich is defined by contrast to those around us (e.g. a millionaire in the company of billionaires doesn't seem as rich as he would in the company of the homeless) and the way it seems that resentment of those richer than oneself is an issue no matter what actual income one has, there is also the issue of: if I can't be rich then he shouldn't be either.
These two combine to give a selfish reasoning for favouring equality rather than some altruistic feeling.
My first-glance response was D cause it seemed fairest. Several seconds later I ridiculed myself, because E is clearly more prosperous. (Assuming each tier is an absolute income level/range, which the setup implies.) I'm kind of disappointed if not surprised to see that Caplan's right about irrational voters.
It's hard to really judge, though, with figures floating in space like this, timelessly.
If it could be demonstrated that any of these distributions caused the overall figure to float up significantly faster relative to the others–that the shape is necessary for some helium producer(s) to operate efficiently–that figure might be preferable despite (some greater level of) immediate inequality.
But the best research I've found says that the correlation between inequality and faster growth is pretty small (especially in developed countries). And of course the small correlation that does show up, doesn't demonstrate causation. Fast growth could be causing the inequality, not vice versa.
Plus, E might promote negative externalities which might not make their impacts felt on a country's overall prosperity for many decades.
But still. Given the terms of the query, E is the obvious answer and it's sad that only 20-30% recognize that.
Because that is a picture of either immense violence or disaster!


text:
Prentice
Prentice Electricity Rates
Commercial Electricity in Prentice
^ The average commercial electricity rate in Prentice, WI is 9.03¢/kWh.[1]
Residential Electricity in Prentice
^ The average residential electricity rate in Prentice, WI is 11.64¢/kWh.[1]
Industrial Electricity in Prentice
^ The average industrial electricity rate in Prentice, WI is 6.94¢/kWh.[1]
Prentice, WI Electricity Statistics
Commercial electricity rates in Prentice
The average commercial electricity rate in Prentice is 9.03¢/kWh.[1]
This average (commercial) electricity rate in Prentice is 14.08% less than the Wisconsin average rate of 10.51¢/kWh.[2]
The average (commercial) electricity rate in Prentice is 10.51% less than the national average rate of 10.09¢/kWh. Commercial rates in the U.S. range from 6.86¢/kWh to 34.88¢/kWh.[2]
Residential electricity rates in Prentice
The average residential electricity rate in Prentice is 11.64¢/kWh.[1]
This average (residential) electricity rate in Prentice is 11.75% less than the Wisconsin average rate of 13.19¢/kWh.[2]
The average (residential) electricity rate in Prentice is 2.02% less than the national average rate of 11.88¢/kWh. Residential rates in the U.S. range from 8.37¢/kWh to 37.34¢/kWh.[2]
Industrial electricity rates in Prentice
The average industrial electricity rate in Prentice is 6.94¢/kWh.[1]
This average (industrial) electricity rate in Prentice is 5.45% less than the Wisconsin average rate of 7.34¢/kWh.[2]
The average (industrial) electricity rate in Prentice is 4.05% greater than the national average rate of 6.67¢/kWh. Industrial rates in the U.S. range from 4.13¢/kWh to 30.82¢/kWh.[2]
Wisconsin Electricity Rates & Consumption
Commercial electricity in Wisconsin
Commercial electricity rates in WI [3]
The average commercial electricity rate in Wisconsin is 10.51¢/kWh, which ranks 15th in the nation and is 4.16% greater than the national average rate of 10.09¢/kWh.[3]
Commercial electricity consumption in WI [3]
Commercial electricity consumption in Wisconsin averages 5,663 kWh/month, which ranks 26th in the nation and is 9.22% less than the national average of 6,238 kWh/month.
Commercial electricity bills in WI [3]
The average monthly commercial electricity bill in Wisconsin is $595, which ranks 19th in the nation and is 5.41% less than the national average of $629.
Learn more about commercial electricity in Wisconsin
Residential electricity in Wisconsin
Residential electricity rates in Wisconsin [3]
The average residential electricity rate in Wisconsin is 13.19¢/kWh, which ranks 14th in the nation and is 11.03% greater than the national average rate of 11.88¢/kWh.
Residential electricity consumption in WI [3]
Residential electricity consumption in Wisconsin averages 703 kWh/month, which ranks 39th in the nation and is 22.15% less than the national average of 903 kWh/month.
Residential electricity bills in WI [3]
The average monthly residential electricity bill in Wisconsin is $93, which ranks 38th in the nation and is 13.08% less than the national average of $107 per month.
Learn more about residential electricity in Wisconsin
Industrial electricity in Wisconsin
Industrial electricity rates in Wisconsin [3]
The average industrial electricity rate in Wisconsin is 7.34¢/kWh, which ranks 15th in the nation and is 10.04% greater than the national average rate of 6.67¢/kWh.
Industrial electricity consumption in WI [3]
Industrial electricity consumption in Wisconsin averages 429,442 kWh/month, which ranks 8th in the nation and is 282.89% greater than the national average of 112,158 kWh/month.
Industrial electricity bills in WI [3]
The average monthly industrial electricity bill in Wisconsin is $31,542, which ranks 7th in the nation and is 321.52% greater than the national average of $7,483.
Learn more about industrial electricity in Wisconsin
Household Income in Prentice, WI
Prentice, WI Income Breakdown [4]
Income Summary for Prentice, WI
Household income: The city of Prentice has a median household income of $44,375, versus $62,843 for the U.S.[4]
Compared to the U.S.: Median household income in Prentice is approximately 29 percent less than the median income for the entire United States.[4]
Poverty level: Approximately 5.3 percent of Prentice households have incomes below poverty level.[4]
Electric bills: The average residential electricity bill in Wisconsin is about $93/month, ranking 38th in the U.S. and 13.08% less than the national average of $107.[5]
Income: Prentice vs. Nation [4]
Additional information about Prentice
About Prentice
Prentice is a village located in Price County in the state of Wisconsin, and has a population of approximately 660.[6]
More about Prentice utilities
For more information about Prentice electricity, or for additional resources regarding electricity & utilities in your state, visit the Energy Information Administration.
Electricity rates in Hawaii are typically more than three times the national average rate.
Additional Cities in WI
Delafield
Dickeyville
Saint Nazianz
Trempealeau
Local Electricity Rates in Prentice, WI
Take the first step toward powering your home with solar energy.
Start now with an online solar savings estimate.


The Tree of Life is a theme amongst the world's ancient and modern religions, appearing in virtually any culture or religion you can name, and many you have never heard of. Highlighting knowledge, life, wisdom and the innumerable multitude of different relationships between everything on earth, the Tree of Life is a beautiful object to wear around your neck.
In each pendant the material will be different, and you get your choice. We have Amethyst, Rock Crystal, Citrine, Aventurine, Opal and Agate.


Find information about Canyon Lakes West homes below. Canyon Lakes West in Cypress is a new construction home community located in Northwest Houston within the 77433 zip code. Nearby towns include Tomball and Katy . Home builders in Canyon Lakes West include Lennar, offering numerous floor plans and price ranges.


text:
import { BrowserModule } from '@angular/platform-browser';
import { NgModule } from '@angular/core';
import { FormsModule } from '@angular/forms';
import { HttpModule } from '@angular/http';

import { AppComponent } from './app.component';

import { EagerComponent } from './eager.component';
import { routing } from './app.routing';

@NgModule({
  declarations: [
    AppComponent,
    EagerComponent
  ],
  imports: [
    BrowserModule,
    FormsModule,
    HttpModule,
    routing
  ],
  providers: [],
  bootstrap: [AppComponent]
})
export class AppModule { }

redpajama_set_name: RedPajamaGithub


text:
Q: PickerView is Not Showing Selection Separators - iOS I'm using UIPickerView for gender selection. The problem is, it is not showing selection separators.
Here is my code:
func numberOfComponents(in pickerView: UIPickerView) -> Int {
    return pickerDataArr != nil ? 1 : 0
}

func pickerView(_ pickerView: UIPickerView, numberOfRowsInComponent component: Int) -> Int {
    return pickerDataArr!.count
}

func pickerView(_ pickerView: UIPickerView, viewForRow row: Int, forComponent component: Int, reusing view: UIView?) -> UIView {
    var label = view as? UILabel

    if label == nil {
        label = UILabel()
    }

    label!.font = UIFont.systemFont(ofSize: 15)
    label!.textAlignment = .center
    label!.text = pickerDataArr![row]
    return label!
}

Output-

I tried these options:
1 Default select first row:
pickerView.selectRow(0, inComponent: 0, animated: false)

2 setting property:
pickerView.showsSelectionIndicator = true

Still no luck...
If anyone has any idea then please share!

A: After trying few more options, I've got selections indicators.
Here is the change:
func numberOfComponents(in pickerView: UIPickerView) -> Int {
    return 1
}
func pickerView(_ pickerView: UIPickerView, numberOfRowsInComponent component: Int) -> Int {
    return pickerDataArr?.count ?? 0
}

Everything is same as it was. Somehow, it was related to numberOfComponents for picker view.
Even no need of:
pickerView.selectRow(0, inComponent: 0, animated: false)
pickerView.showsSelectionIndicator = true

Output-

A: Here is the change
func numberOfComponents(in pickerView: UIPickerView) -> Int {
    return pickerDattaArr.count != 0 ? 1 : 0

}
func pickerView(_ pickerView: UIPickerView, numberOfRowsInComponent component: Int) -> Int {
    return pickerDattaArr.count
}

func pickerView(_ pickerView: UIPickerView, viewForRow row: Int, forComponent component: Int, reusing view: UIView?) -> UIView {

    var label = view as? UILabel
    if label == nil {
        label = UILabel()
    }
    label!.font = UIFont.systemFont(ofSize: 15)
    label!.textAlignment = .center
    label!.text = pickerDattaArr[row]
    return label!
}

redpajama_set_name: RedPajamaStackExchange


text:
Kim Sledge of the band Sister Sledge will donate proceeds from a cover of the band's classic song We Are Family to the World Health Organisation Foundation, WHO Director-General Tedros Adhanom Ghebreyesus says. "I would like to thank Kim Sledge for her kind offer to donate proceeds from the sale of her special edition cover of We Are Family," said Tedros, adding that the money would be used to support the COVID-19 response and strengthen health services around the world. Kim Sledge joined Tedros at a news briefing on Monday. The singer had joined with the social enterprise group The World We Want to record a new version of the 1979 track. Celebrities, frontline workers, international leaders and members of the public will feature in a music video for the track, which is released on November 9. Australian Associated Press
/images/transform/v1/crop/frm/silverstone-feed-data/006ef52a-99a3-496d-a619-86850a15a4d5.jpg/r0_74_800_526_w1200_h678_fmax.jpg
October 20 2020 - 3:18AM
We Are Family cover proceeds to go to WHO
Michael Shields and Stephanie Nebehay
Tedros Adhanom Ghebreyesus says proceeds from a cover of We Are Family will go help WHO work.
Kim Sledge of the band Sister Sledge will donate proceeds from a cover of the band's classic song We Are Family to the World Health Organisation Foundation, WHO Director-General Tedros Adhanom Ghebreyesus says.
"I would like to thank Kim Sledge for her kind offer to donate proceeds from the sale of her special edition cover of We Are Family," said Tedros, adding that the money would be used to support the COVID-19 response and strengthen health services around the world.
Kim Sledge joined Tedros at a news briefing on Monday.
The singer had joined with the social enterprise group The World We Want to record a new version of the 1979 track.
Celebrities, frontline workers, international leaders and members of the public will feature in a music video for the track, which is released on November 9.


Straight to the races with this one. An all new full carbon frame & fork with flat mount disc brakes, thru-axles front & rear, & fender mounts is the foundation for this yearÍs Jake series, & the Super Jake is the cream of the crop with a SRAM Force 1x drivetrain with hydraulic discs & Clement tubeless-ready wheels & tires. Whether your sights are set on the ïcross podium or the all day gravel epic, the Super Jake will get you there.
Products are delivered Australia wide. Shipping costs are influenced by the size and weight of the product and your location, exact shipping costs are calculated in the shopping cart and will be added to the order total before checkout. Regional areas may include addition postage costs (post purchase) and if this is the case you'll be contacted to finalise.
For faulty products, Bike Zone offer a 14 DAY REPLACEMENT WARRANTY, from the date you receive your product. They do not offer a satisfaction guarantee on any of their products, however due to their high level of customer service, they will always endeavour to keep customers happy and satisfied.


Concrete pumps are machines that transfer liquid concrete by way of pumping. The pumps might be mounted on a concrete truck or trailer or they may be stationary. These pumps are ideally suited for places that require sending of the concrete to a high building via concrete lines or other concrete distribution system. When you are looking for a high quality stationary pump, ensure that it is from a reputed manufacturer.
Silk Road Equipment is the best company to get in touch with for any requirements of stationary pumps or any other construction related machinery. Having been in the business for a long time, we provide the best quality products at the most reasonable prices.


text:
«Скін» () — американський біографічний драматичний фільм сценариста та режисера ізраїльського походження Гая Наттіва. Фільм присвячений життю колишнього члена групи неонацистів-скінхедів Брайону Віднеру. У фільмі знімались Джеймі Белл, Даніель Мак-Дональд, Даніель Геншолл, Білл Кемп, Луїза Краузе, Зої Коллетті, Кайлі Роджерс, Колбі Ганнетт, Майк Колтер і Віра Фарміґа.

Світова прем'єра стрічки відбулась на Міжнародному кінофестивалі в Торонто 8 вересня 2018 року. Він був випущений 27 червня 2019 року через DirecTV Cinema, прем'єра в кінотеатрах США відбулась 26 липня 2019 року за сприяння A24.

Сюжет

Колумбус, 2009 рік. Між скінхедами та рухом «Один народ», на чолі з Дерілом Ламонтом Дженкінсом, відбувається сутичка. З натовпу вибігає темношкірий хлопчик, якого переслідують троє неформалів, а потім жорстоко знущаються над ним.

На виступі тріо «Сід», яке складається з трьох сестер, Бебс знайомиться з ними та їхньою мамою Джулі Прайс. Вранці Бебса затримують і поліцейські пропонують співпрацю. Він відмовляється. На шляху додому після попереднього ув'язнення Бебса Фред, який виховував його, вербує в групу скінхедів безхатька Гевіна. Бебс приїздить до Джулі та чує її розмову з орендодавцем Шеріл, яка докоряє їй через затримку оплати за проживання й участь у концерті для скінхедів. Бебс та Джулі проводять ніч разом.

Джулі з дочками навідуються в тату-салон Бебса. Чоловік перероблює ненависне татуювання Джулі. Хелловін вони проводять в клубі скінхедів. Між Джулі та Ейпріл виникає сутичка, після чого Прайс просить розірвати зв'язки з скінхедами. Фред будить їх телефонним дзвінком, що викликає обурення Джулі. Вона забирає дітей. Бебс їде зі Слевіном і Гевіном до мечеті, яка будується. Оглядаючи приміщення, Бебс знаходить кількох арабів та дає їм втекти. Мечеть підпалюють. Бебс починає ненавидіти себе і намагається спалити своє обличчя кислотою. З тогу моменту він хоче, щоб його називали тільки Брайоном.

Брайон і Джулі одружуються. Чоловік не може знайти собі роботу, він змушений чистити сніг вночі. Фред з іншими несподівано з'являються в будинку молодять через чотирьох людей, які вижили після підпалу мечеті. Хвилюючись за життя своєї сім'ї, Брайон їде з «Вікінгами» на автозвалище, де в машині чекають два араби. Бебс відмовляється їх вбивати, це робить Слейтер, який починає звинувачувати його у зраді. Між ними відбувається сутичка. Бебс отримує сильне поранення, а Гевін вбиває Слейтера. У палаті реанімації Фред мучить Брайона.

У Ричмонді Брайон і вагітна Джулі зустрічаються з Дженкінсом. Брайон погоджується на повну співпрацю з ФБР. Пара збирає речі. Тієї ж ночі їхній вагончик розстрілюють, а собаку підвішують. Вони заселяються в готель у Нешвіллі. Після грубого поводження з Дезі Джулі та Брайон розходяться. «Вікінгів» заарештовують. Брайон виходить з клініки після видалення останнього татуювання. Він повертається до Джулі.

У ролях

Виробництво
11 травня 2017 року на 70-му Каннському кінофестивалі компанія Seville International придбала міжнародні права на фільм. У серпні 2018 року повідомлялося, що композитор Ден Ромер напише музику для стрічки.

У травні 2017 року було оголошено, що Джеймі Белл та Даніель Мак-Дональд будуть зніматися у фільмі, а Наттів став сценаристом, продюсером і режисером стрічки. У березні 2018 року, після початку виробництва, Віра Фарміґа приєдналася до акторського складу фільму, а дружина Наттіва, Джеймі Рей Ньюман, приєдналася як продюсер. Того ж місяця Майк Колтер був відібраний на роль Даріла Ламонта Дженкінса, засновника проєкту One People. Невдовзі до фільму приєдналися актори Арі Баркан, Скотт Томас, Даніель Геншолл, Майкл Віллар, Джастін Вілсон і Рассел Познер.

Основні зйомки розпочалися в січні 2018 року в Кінгстоні, Нью-Йорк, які тривали до березня 2018 року.

Випуск
Світова прем'єра фільму відбулась на Міжнародному кінофестивалі в Торонто 8 вересня 2018 року. Невдовзі A24 та DirecTV Cinema придбали права на розповсюдження фільму. Він був випущений через DirecTV Cinema 27 червня 2019 року, а обмежений випуск у кінотеатрах США відбувся 26 липня 2019 року.

Сприйняття

Критика
На вебсайті Rotten Tomatoes рейтинг фільму становить 74 % на основі 53 оглядах, середня оцінка — 6,77/10. У консенсусі сайту зазначено: «"Скін" міг би заглибитись під його поверхню, але гідна історія та віддане виконання ролі Джеймі Беллом роблять цю своєчасну драму вартою перегляду». На Metacritic фільм має рейтинг 58 зі 100 на основі 20 відгуків критиків, що вказує на «змішані чи середні відгуки».

Номінації та нагороди

Примітки

Посилання

   ()
   ()
   ()

Фільми про расизм
Фільми A24
Фільми, зняті в Нью-Йорку (штат)
Фільми 2018
Фільми англійською мовою
Фільми США 2018
Фільми-драми США
Біографічні фільми США
Фільми, засновані на реальних подіях


For the two decades that he's edited the scabrous and insightful U.K.-based web magazine Spiked, Brendan O'Neill, an occasional Reason contributor, has described himself—perhaps with a wee bit of provocation—as a "libertarian Marxist." That is, until the populist uprisings in Europe last year.
"The thing that's different now than it would have been six months ago," O'Neill told me during a February episode of the Fifth Column podcast, "is that I've increasingly gone off the word libertarian." The Brexit vote in England, the Yellow Vest protests in France, various anti-elitist spasms across the globe—these have packed more of a punch in two short years than four decades' worth of classical liberal think-tank thumbsucking, he said: "I think other things more interesting than libertarianism are happening in the world right now."
Individualists fond of Enlightenment rationalism do not generally hasten toward the excitement of street mobs or even electoral majorities. But the global rise in nationalist politics, from Viktor Orbán's Hungary to Donald Trump's America, has tempted many commentators with the thrills of revolution and machinations of power. Unsurprisingly, they are shedding their libertarianism along the way, writes Matt Welch.


text:
How Blockchain Technology can help aid the Healthcare Industry
By Alex Libertas
The term blockchain technology is synonymous with perhaps the more established phrase of 'Cryptocurrency'. Simply put the blockchain is the technology that powers Cryptocurrencies, with Bitcoin being the most recognised and celebrated.
In 2008 Satoshi Nakamato, an unknown individual that is potentially a pseudonym for a person or group of people, introduced Bitcoin to the world.
Bitcoin can be described as a form of electronic cash. It is a decentralized digital currency without a central bank or single administrator, that can be sent from user-to-user on the peer-to-peer bitcoin network without the need for intermediaries.
In 2019, over ten years later, there are over 1990 Cryptocurrencies that are currently established and in circulation. It is important to note, however, that not all Cryptocurrencies are designed to be a form of electronic cash like Bitcoin was. Ethereum, for example, was created as a platform for developers to build distributed apps on in which there is no control or interference from a third party.
There are now Cryptocurrencies for developers, fintech, data, authenticity etc, the list is endless. Below is an infographic, courtesy of Josh Nussbaum, which gives an overview of the Blockchain Ecosystem and where we are today:
So why are there so many different types of Cryptocurrency and why are so many well established companies exploring the potential of blockchain technology?
The technology behind Bitcoin is called 'Distributed Ledger Technology' or DLT for short. DLT is a way to keep records in sync with the whole network with everyone agreeing what the state of the database is — the difference with this technology as opposed to standard databases is that you can only change it if everyone agrees on the the change.
This means that once data has been agreed on the ledger it cannot be edited, lost, hacked or altered in any way and it is forever stored on the blockchain as everyone has agreed on this data being correct and accurate. It is for these reasons that many corporations and industry verticals are so intrigued with how the use of this technology can be applied to their business and the benefits that it can provide to sectors such as finance and healthcare.
Blockchain Technology within the Healthcare industry
On 22nd January I was fortunate enough to attend a fundraising event for @shaarezedekUK — an organisation dedicated to raising vital funds for the Shaare Zedek Medical Centre in Jerusalem. A 116 year old medical centre which is strictly non-political and does not discriminate on the grounds of religion, racial background or financial means. You can find more information about Shaare Zedek here.
The event was chaired by Danny Les, Blockchain Startup Mentor for @WayraUK, and comprised of the following panel:
Jeremy Bokobza — Blockchain developer, Head of Engineering for Stratis.
David Belle — Trader, Researcher and Broker in the finance sector.
Professor Roland Schlesinger — Head of Department of Health Law and Science at Sigmund Freud University, Chief Medical Officer for Lancor Scientific.
Dr A Min Tjoa — Professor Director, Vienna University of Technology. Vice-Chairman of the United Nations' Committee of Science and Technology for Development.
The event was of an open discussion format with the audience asking questions and the panel responding and deliberating. Throughout the evening the panel provided detailed examples of the potential use cases for blockchain technology in the healthcare industry, as well as ways that are already being applied. I will discuss these below in detail:
Auditing/Data Security
Last year it was reported that NHS trusts lost almost 10,000 patient records in 2017. This prompted major concerns about patient data security and also meant that some patients data, including test results, previous procedures etc. had been irrevocably lost. Shockingly the article states that "94% of trusts continue to use handwritten notes as a method documentation".
Furthermore it is common practice in many NHS trusts to file patient records at the end of the week or month as opposed to immediately, which becomes an inefficient and extremely manual process.
If patient data could be placed onto a blockchain within the hospital at the time of inception, then the data will be stored immediately. This data could then be accessed by every department of the hospital within seconds. Additionally, this could have a significant impact on saving the hospital money by turning a vast amount of manual processes into automated processes — allowing hospital staff to focus on much more important issues.
It is also worth noting that the blockchain does not have to be limited to just one hospital. For example, each NHS hospital in the London area could have access to the blockchain and be authorised to enter patient data. This means that when a patient moves from one area to another, or has an accident in a certain location for example, every hospital would have immediate access to the patients' records.
During the discussion, Dr A Min Tjoa stated that "When a doctor or nurse wants to know something about a patient in Austria, it is nearly impossible to get a healthcare record from a hospital only 3 miles away. So the new hospital will have to perform all of the procedures again, which doubles up on the cost to the local healthcare system. By using the blockchain and enabling the tracking of this data you can give the data back to the patient. This can reduce costs in the healthcare system by up to 9%. So the flow of information is one of the big issues that blockchain can solve"
One of the largest appeals of many Cryptocurrencies is the anonymity it provides the user without any 3rd parties having access to the personal data. Personal data is an incredibly important part of one's identity in modern society and it should therefore be made as secure as possible.
It has been widely reported that medical records are one of the most expensive items that are sold on the dark web. In 2018 it was reported that hackers are in possession of 140 million people's personal data with medical records being the new trend.
This may seem incredible to some but there are many reasons for this — medical records contain an individual's name, birthdate, social security number, and medical information. Some reasons why hackers find this lucrative are:
Fraud — It is possible to steal a person's identity and bill them for a surgery or a prescription. It is also possible with this information to open a new line of credit.
Blackmail — As medical information is available, such as previous sexual or mental health issues it is possible for a hacker to use this information to extort and blackmail an individual for financial or personal gain.
Attempted Murder — There have been cases of hackers altering medical records to remove vital information such as life threatening allergies.
Due to a large majority of hospitals still moving from written records to digital, there are inevitably going to be a number of challenges with data security moving forward.
One of the ways blockchain technology can help resolve this is for an individual to own and control their own data. Much like when you buy Bitcoin or any other Cryptocurrency you obtain your own Private Keys, you could own and control private keys that contain your medical information. A good comparison to be drawn here is how only an individual knows their own pin code to access their bank information and money; you have access to this key, or pin, to unlock your data when you are visiting a GP or hospital administrator.
Jeremy Bokobza reiterated the security of blockchain technology by confirming that "If it's on the blockchain it's secure and encrypted, therefore it is protected by the user and the user keys. No one else is able to access the data".
It is important to point out that one of the potential issues that did arise around this conversation was what could potentially happen in an emergency situation.
Professor Roland Schlesinger answered this by stating "Under these circumstances the classic regulation is exercised — we don't care about data in this case and we will run everything that we need to. We don't ask — we act first then think about the data afterwards".
In December 2018 the PharmaTimes declared that the pharmaceutical industry is "rife with counterfeits… with estimates of €27billion revenue lost annually in Europe alone". Additionally BusinessGhana reports that "fake malaria drugs caused 64,000 to 158,000 deaths every year in sub-Saharan Africa." Whilst the Guardian reported in 2017 that "10% of drugs in poor countries are fake".
These are truly frightening statistics that highlights the obvious issues around the need for transparency with pharmaceuticals.
Blockchain technology could help aid this process by recording the various stages of production of medications throughout every step of the supply chain. The distributor of the medicine would be able to see via the blockchain that each part of the process had been verified and approved by a trusted party. If any issues were to arise with any medications, then the blockchain would allow users to immediately see where these issues had occurred.
This would also help with removing any manual auditing processes, as the data would immediately be stored on the blockchain which could mean large cost savings for pharmaceutical companies.
Data Research and Simulation
Patient data is used for research and simulation which could potentially lead to the creation of preventative medicines. This data, however, could only be used with the consent of the patients.
In July last year it was revealed that "150,000 patients have been affected by an NHS data breach where confidential information only requested to be used to provide them with care was also exploited for clinical audit and research purposes without their consent or knowledge."
Professor Roland Schlesinger explains that at the Sigmund Freud university "20% of people have already opted out of a clinical trial. Additionally they also want to have their data stored in a ledger in the way they want to disclose it. Blockchain technology could be a potential solution here."
This shows that there is a lack of trust between the patients and the medical institutes that hold their data.
At the Vienna University of Technology, Dr A Min Tjoa explains that they are using a blockchain device for cancer screenings. He states that, "With this tech we are faster and cheaper than all other existing devices. We use the blockchain to store the data of each patient that has ever been scanned with our device. Without DLT we could not achieve this kind of data security for each person because blockchain is exceptionally secure. It's a huge step forward in healthcare because storing patient data such as name, DOB and sex is a difficult legal challenge. Blockchain gives us a security for the first time to use personalised data that we anonymise. So we take away all personal identifiable information and then the rest of the data is then used for scientific purposes."
Furthermore this is attracting the attention of pharmaceutical companies as he states, "The pharma industry has a very high interest to get a big amount of data from patients all over the world to start simulating. They want to know how to save costs via the blockchain and simulate the data and they have initially reported that it's around 12% after testing through simulation."
There are numerous benefits of using a blockchain in the healthcare industry that can help save lives, reduce costs and make healthcare centres more efficient. So why is there such a slow adoption with incorporating this technology?
As previously discussed in this article a significant percentage of hospitals are still using hand written records to store their data. IT systems within the industry would first need to be updated to a more secure and suitable standard before considering implementing blockchain technology on a larger scale.
Jeremy Bokozba believes that currently there are lots of blockchain projects but very few have, "Anything that the end user can see, touch or play with. Once we see tangible benefits from blockchain in everyday life — we will see blockchain everywhere."
Blockchain is still very much in its infancy and Dr A Min Tjoa believes that, "We are just in the very beginning and it's yet to realise its potential. We can assume that the progress will be exponential but we don't have all the applications yet. The reason for such a hype is that people just want to be ready for it."
Despite the potential setbacks of implementing this technology, however, it has been announced on IBM's Newsroom that Aetna, Anthem, Health Care Service Corporation, PNC Bank and IBM will collaborate to establish a blockchain-based ecosystem for the healthcare industry.
Through these partnerships they proclaim that "The aim is to create an inclusive blockchain network that can benefit multiple members of the healthcare ecosystem in a highly secure, shared environment. The goal is to allow the blockchain network to enable healthcare companies to build, share and deploy solutions that drive digital transformation in the industry."
They go on to state that "The collaboration members intend to use blockchain to address a range of industry challenges, including promoting efficient claims and payment processing, to enable secure and frictionless healthcare information exchanges, and to maintain current and accurate provider directories."
This is an extremely exciting time for blockchain technology particularly in the healthcare industry. The success of this partnership is yet to be determined but one thing is for certain — Blockchain is here to stay.
Thank you for taking the time to read this article.
Alex Libertas
https://www.alexlibertas.com
How Blockchain Technology can help aid the Healthcare Industry was originally published in Hacker Noon on Medium, where people are continuing the conversation by highlighting and responding to this story.
CategoryPaymen system
Previous PostPrevious 5 Ways you're Putting your Cryptocurrency in Danger without even Knowing it
Next PostNext Retail Giants like Walmart, Carrefour and Auchan Adopting Blockchain Technology


Unoccupied insurance for Commercial Properties can be difficult to obtain. Furthermore finding an Insurance Broker that understands your requirements in respect of these properties can in itself be an insurmountable task.
At Property Insurance Centre we have been insuring Unoccupied Commercial Properties for clients for over 30 years. We have a wide panel of insurers to choose from who have experience in underwriting in this area, from the major composites such as Aviva to the specialist Lloyds syndicates such as DTW 1991.
We can accommodate unoccupied properties undergoing extensive works prior to letting, long term unoccupied properties and unoccupied properties awaiting sale.
We can also insure former public houses which are often difficult to place due to the nature of the former business.
We can arrange for different levels of cover depending on your requirements from the very basic Fire Cover to the more comprehensive wider perils policy which includes perils such as malicious damage, storm & flood. We can also arrange liability only policy with rubble clearance cover if the property is going to be demolished.
The requirements of an unoccupied commercial property are vastly different from an occupied property. You need a broker who understands the risks associated with these and who can place your insurance with a reputable insurer at a competitive premium. Talk to the specialists at the Property Insurance Centre. With premiums starting from £250 plus IPT call us now to discuss your requirements or email your details for a call back or quotation.
Call us on 0800 085 3761 or quote online here.


text:
Representatives test positive for COVID-19 after sheltering with maskless Republicans during Capitol riot
Ariana Figueroa
The U.S. Capitol. (Drew Angerer/Getty Images)
The leader of the Congressional Progressive Caucus said Tuesday that she has tested positive for COVID-19, and blamed Republicans who refused to wear masks in a secure room where lawmakers were kept during the mob attack on the U.S. Capitol last week.
Rep. Pramila Jayapal, (D-Wash.), said those Republicans "mocked colleagues and staff" who offered them masks.
"Too many Republicans have refused to take this pandemic and virus seriously, and in doing so, they endanger everyone around them," she said in a statement.
Jayapal is the third member of Congress to test positive following the lockdown in the secure room. Rep. Brad Schneider (D-Ill.) also announced Tuesday that he tested positive for COVID-19. Rep. Bonnie Watson Coleman, (D-N.J.), announced Monday on Twitter that she tested positive for COVID-19. Jayapal and Schneider said they are currently at home isolating.
Coleman said she went to a local hospital for antibody treatment, which was recommended by her doctor.
President-elect Joe Biden on Monday chastised GOP lawmakers for refusing to wear masks while they were held in a safe location as a violent mob of pro-Trump supporters stormed the Capitol last week.
As lawmakers waited for law enforcement to secure the Capitol on Wednesday, Rep. Lisa Blunt Rochester (D-Del.) went around a packed room passing out masks to people without them, to prevent the spread of COVID-19.
"When they were hiding from the mob, she was going around trying to hand out masks to everybody," Biden said to a group of reporters. "And her Republican colleagues wouldn't wear a mask. I think it's irresponsible."
In a video obtained by Punchbowl News, Reps. Marjorie Taylor Greene (R-Ga.), Markwayne Mullin (R-Okla.), Andy Biggs (R-Ariz.), Scott Perry (R-Pa.) and Michael Cloud (R-Texas), were all not wearing masks, and they turned down the disposable masks that Rochester was offering.
"It's not a political issue," Biden said. "It's an issue of public safety."
There were nearly 100 people in the room, according to multiple media reports.
"While I was disappointed in my colleagues who refused to wear a mask, I was encouraged by those who did," Rochester wrote on Twitter Friday. "My goal, in the midst of what I feared was a super spreader event, was to make the room at least a little safer."
Jayapal called for members who refused to wear masks to be fined and removed from the floor by the sergeant at arms.
"This is not a joke," she said. "Our lives and our livelihoods are at risk, and anyone who refuses to wear a mask should be fully held accountable for endangering our lives because of their selfish idiocy."
More than 22.5 million Americans have been infected with COVID-19 and more than 375,000 people have died from coronavirus in the U.S.
The attending physician of the Capitol, Dr. Brian Monahan, also raised concerns to lawmakers about possible COVID-19 exposures from the rioters last week.
Coleman said she decided to get tested after she had to stay in the room with Republicans who did not wear masks. Coleman is a cancer survivor.
"I received a positive test result for COVID-19, and am home resting at this time," she said in a statement. "While I am experiencing mild, cold-like symptoms, I remain in good spirits and will continue to work on behalf of my constituents."
Rep. Chuck Fleischmann (R-Tenn.) also announced that he and another lawmaker he lives with tested positive for COVID-19.
"I currently feel okay and remain in contact with the attending physician," he said in a statement. "I again, want to urge all Americans to continue to wear masks, practice proper hygiene, and follow CDC guidance as we work to combat COVID-19."
Previous articleIf we want to save our restaurants, Virginia must put long-term relief on the menu
Next articleMore than 170 cases opened in federal probe of U.S. Capitol attack
Ariana Figueroa is a reporter in the States Newsroom Washington, D.C, bureau. Her areas of coverage include politics and policy, lobbying, elections and campaign finance. Before joining States Newsroom, Ariana covered public health and chemical policy on Capitol Hill for E&E News. As a Florida native, she's worked for the Miami Herald and her hometown paper, the Tampa Bay Times. Her work has also appeared in the Chicago Tribune and NPR. She is a graduate of the University of Florida.
by Ariana Figueroa, Virginia Mercury

Representatives test positive for COVID-19 after sheltering with maskless Republicans during Capitol riot

by Ariana Figueroa, Virginia Mercury
January 12, 2021

Facing the COVID-19 pandemic in Virginia without government relief
Guest Column - April 17, 2020


text:
package ginDoi

import (
	"bytes"
	"net/http"
	"net/http/httptest"
	"testing"
	log "github.com/Sirupsen/logrus"
	"io/ioutil"
	"strings"
)

type MockStorage struct {
	LocalStorage
}

func getInit(querrySting string, ds DataSource, pr OauthProvider) string {
	rec := httptest.NewRecorder()
	req := httptest.NewRequest(http.MethodPost, "/"+querrySting,
		bytes.NewReader([]byte("")))
	InitDoiJob(rec, req, ds, pr, "../tmpl")
	body, _ := ioutil.ReadAll(rec.Body)
	return string(body)
}

//https://doi.gin.g-node.org/?repo=master%3Atesti%2Ftest&user=testi&token=123"
func TestInitDoiJob(t *testing.T) {
	log.SetLevel(log.DebugLevel)
	if !strings.Contains(getInit("", &GinDataSource{}, nil), MS_URIINVALID) {
		t.Log("[Err] No URI should complain")
		t.Fail()
		return
	}
	if !strings.Contains(getInit("?repo=master", &GinDataSource{}, nil),
		MS_NOTOKEN) {
		t.Log("[Err] No Token should complain")
		t.Fail()
		return
	}
	if !strings.Contains(getInit("?repo=master&token=123", &GinDataSource{},
		nil), MS_NOUSER) {
		t.Log("[Err] No User should complain")
		t.Fail()
		return
	}
	if !strings.Contains(getInit("?repo=master&token=Bearer%20123&user=chris", &GinDataSource{},
		MockOauthProvider{ValidToken: false}), MS_NOLOGIN) {
		t.Log("[Err] No valid token should complain")
		t.Fail()
		return
	}

	if !strings.Contains(getInit("?repo=master&token=Bearer%20123&user=chris",
		&MockDataSource{validDoiFile: false, Berry: CBerry{Missing: []string{"sads"}}},
		MockOauthProvider{ValidToken: true}), MS_INVALIDDOIFILE) {
		t.Log("[Err] No valid doifile should complain")
		t.Fail()
		return
	}
	t.Log("[Ok] Init Doi Job")
	return

}


text:
You are here: Home > Browse > Gently Through The Mill
Gently Through The Mill
Alan Hunter / Andrew Wincott
When small-time gambler and petty crook Steinie Taylor turns up dead in a hopper of flour at a country bakery, Gently has to figure out not only how he got there, but also why his prime suspects all appear to have a dark secret to hide. Why had the deceased villain and his two friends been spending money like it was going out of fashion? Why had they strayed from their usual haunts? Why did Taylor's friends both disappear? The investigation becomes even more sinister when one of Taylor's cronies is also found dead.
Published by Story Sound Audio
Alan Hunter
Alan Hunter was born at Hoveton, Norfolk and went to school across the River Bure in Wroxham. He left school at 14 and worked on his father's farm near Norwich. He enjoyed dinghy sailing on the Norfol... more
Andrew Wincott
Andrew Wincott has worked with many theatre companies throughout the UK, and his leading roles include Tartuffe (Tartuffe), Rochester (Jane Eyre) and Vronsky (Anna Karenina). For Vienna's English Thea... more