Split (1)

train · 485k rows

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.

id stringlengths 40 40	title stringlengths 15 120	text stringlengths 41 3.14k	source stringclasses 2 values
8734b8024dee3f75db0f54ff0dd5a8513fc589c7	steindler began to study mathematics and physics at	steindler began to study mathematics and physics at vienna university in 1899, which was then newly possible for women. she wrote her thesis on the validity of the helmholtz equation for various elements. her doctoral adviser was franz serafin exner. in 1903, she became the first woman to earn a physics doctorate at vi...	wikipedia
59dede740f620f3896a9341ac0b4be97380ec0c6	olga steindler was born in vienna to lawyer	olga steindler was born in vienna to lawyer leopold steindler and caroline steindler, née goldberg. she had three siblings. as women could not take the matura (comparable to a-level exams) in vienna at the time, olga steindler went to prague, where she took her exam on 7 july 1899.	wikipedia
bef5807296a79f2e4b959b132bd77bfe0043f0ca	olga ehrenhaft-steindler (28 october 1879 – 21 december	olga ehrenhaft-steindler (28 october 1879 – 21 december 1933) was an austrian physicist and science teacher. in 1903, she became the first woman to earn a physics doctorate at the university of vienna. she established the first wiener handelsakademie für mädchen (vienna commercial academy for girls), as well as a gramm...	wikipedia
72d62fec930f23c048103dcefb707f7ae1663c35	naomi lynn gerber is an american internist and	naomi lynn gerber is an american internist and physician-scientist who researches chronic illness, human movement, and the treatment of fatigue. she is a professor at george mason university in the department of health administration and policy and director of research in the department of medicine at fairfax hospital ...	wikipedia
f91648000156cebc32b70cac1519579ee759651d	in 2008, gerber was elected as a member	in 2008, gerber was elected as a member of the national academy of medicine. as of 2018, gerber is a professor at george mason university in the department of health administration and policy and director of research in the department of medicine at fairfax hospital inova health system. she is also chair of the rheumat...	wikipedia
d8f460cf50e56db363d6a044f666c7eefe09e994	gerber completed a m.d. at the tufts university	gerber completed a m.d. at the tufts university school of medicine. from 1975 to 2005, she was chief of the rehabilitation medicine department at the national institutes of health clinical center. she researches the "causes of functional loss and disability in chronic illness. specifically, she studies human movement a...	wikipedia
72d62fec930f23c048103dcefb707f7ae1663c35	naomi lynn gerber is an american internist and	naomi lynn gerber is an american internist and physician-scientist who researches chronic illness, human movement, and the treatment of fatigue. she is a professor at george mason university in the department of health administration and policy and director of research in the department of medicine at fairfax hospital ...	wikipedia
9a4e34dc3dd131fc1d63fd49673f04603b737eef	he gave up every day involvement in commercial	he gave up every day involvement in commercial activities after his marriage. he continued with some photography and lithography for personal pleasure. this included facsimile productions of old books and manuscripts. dew-smith was a significant collector of art, literature and gems. his collecting had started when he ...	wikipedia
22c9a8f18dce45baca657f95f0c2fb244fea28fe	he became a noted photographer, particularly of portraits	he became a noted photographer, particularly of portraits and scientific equipment. in 1884 he was elected a member of the photographic society of great britain and showed prints at the 1885 exhibition. he was also a fellow and life member of the cambridge philosophical society.	wikipedia
a392561f1e61fd9857d5fde324ce41ebc4330a35	a man of independent wealth, he financed the	a man of independent wealth, he financed the founding of the journal of physiology, of which foster was the first editor. he was also a founding member of the physiological society. by around 1876-78 dew-smith had left scientific research, although he maintained an interest in producing laboratory equipment as well as ...	wikipedia
1b6988e5fab7b74b1b31c352d629bfe4759ced59	in 1895 he married alice lloyd, a new	in 1895 he married alice lloyd, a new zealand-born author; they had no children. they lived at chesterton hall on chesterton road, cambridge. he died at fulham, london, and is buried in histon road cemetery, cambridge.	wikipedia
6a400947f2da965e360178cd971e299f8064a384	a. g. dew-smith was born in salisbury, england	a. g. dew-smith was born in salisbury, england to charles dew. he took the name dew-smith after inheriting substantial property in 1870. after being a pupil at harrow school, he attended trinity college, cambridge, earning a b.a. (1873) and m.a. (1876) in natural sciences. he was an early student of michael foster, and...	wikipedia
7f8cb6d27147c0e10b30bea130476aba44e18f0b	albert george dew-smith (27 october 1848 – 17	albert george dew-smith (27 october 1848 – 17 march 1903) was a british physiologist, lens maker, bibliophile, and amateur photographer. he co-founded the cambridge scientific instrument company, and conducted early research with physiologist michael foster.	wikipedia
ebfd5f339739c73528cdabf392d8defb0a84b7e0	predicate transformer semantics were introduced by edsger dijkstra	predicate transformer semantics were introduced by edsger dijkstra in his seminal paper "guarded commands, nondeterminacy and formal derivation of programs". they define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total fun...	wikipedia
00c63e1caf7c328fe6927dcf4f46225a4b929e46	among them, hoare type theory combines hoare logic	among them, hoare type theory combines hoare logic for a haskell -like language, separation logic and type theory. this system is currently implemented as a coq library called ynot. in this language, evaluation of expressions corresponds to computations of strongest-postconditions.	wikipedia
8a791d0b8abc5b73f4e3aaa94ec7bbdfc3306250	in predicate transformers semantics, expressions are restricted to	in predicate transformers semantics, expressions are restricted to terms of the logic (see above). however, this restriction seems too strong for most existing programming languages, where expressions may have side effects (call to a function having a side effect), may not terminate or abort (like division by zero). th...	wikipedia
5bb0217c0e1671dd84c1ee90a86d7a0101e532c3	whereas, the formula w p (s, x =	whereas, the formula w p (s, x = 0) ∨ w p (s, x = 1) {\displaystyle wp(s,x=0)\vee wp(s,x=1)} reduces to the wrong proposition (0 = 0 ∧ 1 = 0) ∨ (1 = 0 ∧ 1 = 1) {\displaystyle (0=0\wedge 1=0)\vee (1=0\wedge 1=1)}.	wikipedia
fe825af091b64ef9a51433cccfd81a35f3c2b5a4	hence, w p (s, x = 0 ∨	hence, w p (s, x = 0 ∨ x = 1) {\displaystyle wp(s,\ x=0\vee x=1)} reduces to the tautology (0 = 0 ∨ 0 = 1) ∧ (1 = 0 ∨ 1 = 1) {\displaystyle (0=0\vee 0=1)\wedge (1=0\vee 1=1)}	wikipedia
c4cc281ebe0fb987dc15295fd22bcc45fe0e2805	this is generally not the case of w	this is generally not the case of w p (s,.) {\displaystyle wp(s,.)} when s is non-deterministic. indeed, consider a non-deterministic statement s choosing an arbitrary boolean. this statement is given here as the following selection statement:	wikipedia
e13b50a7c469bb175f881ae1d8f1c212f323eb2d	the non-strict but monotonic or conjunctive predicate transformers	the non-strict but monotonic or conjunctive predicate transformers are called miraculous and can also be used to define a class of programming constructs, in particular, jump statements, which dijkstra cared less about. those jump statements include straight goto l, break and continue in a loop and return statements in...	wikipedia
7926c86e373cb9a375e502c296ed34ce2b10e970	for instance, wp is artificially made strict, whereas	for instance, wp is artificially made strict, whereas wlp is generally not. in particular, if statement s may not terminate then w l p (s, f) {\displaystyle wlp(s,{\texttt {f}})} is satisfiable. we have	wikipedia
3b6b58bdbb0d2607e954c8f28842c05366ffadc3	this section presents some characteristic properties of predicate	this section presents some characteristic properties of predicate transformers. below, s denotes a predicate transformer (a function between two predicates on the state space) and p a predicate. for instance, s(p) may denote wp(s,p) or sp(s,p). we keep x as the variable of the state space.	wikipedia
f9908163d70fb734f411e19591d58e81c9247140	given s a statement and r a precondition	given s a statement and r a precondition (a predicate on the initial state), then s p (s, r) {\displaystyle sp(s,r)} is their strongest-postcondition: it implies any postcondition satisfied by the final state of any execution of s, for any initial state satisfying r. in other words, a hoare triple { p } s { q } {\displ...	wikipedia
47768626560a67b392e5b16599888eaa026e771a	an important variant of the weakest precondition is	an important variant of the weakest precondition is the weakest liberal precondition w l p (s, r) {\displaystyle wlp(s,r)}, which yields the weakest condition under which s either does not terminate or establishes r. it therefore differs from wp in not guaranteeing termination. hence it corresponds to hoare logic in pa...	wikipedia
73117ac9192e9a4b1be82d03bfebfbeedc3276bf	for goto l execution transfers control to label	for goto l execution transfers control to label l at which the weakest precondition has to hold. the way that wpl is referred to in the rule should not be taken as a big surprise. it is just w p (l: s, q) {\displaystyle wp(l:s,q)} for some q computed to that point. this is like any wp rules, using constituent statement...	wikipedia
76fa24ebf5ec1d115278a17c3a0cadc3f8d86136	formalization of jump statements like goto l takes	formalization of jump statements like goto l takes a very long bumpy process. a common belief seems to indicate the goto statement could only be argued operationally. this is probably due to a failure to recognize that goto l is actually miraculous (i.e. non-strict) and does not follow dijkstra's coined law of miracle ...	wikipedia
fbc07d25dfb8eb1e7a39eb0f871d75ae70dc9207	which specifies a computation that starts in a	which specifies a computation that starts in a state satisfying pre and is guaranteed to end in a state satisfying post by changing only x. we call l {\displaystyle l} a logical constant employed to aid in a specification. for example, we can specify a computation that increment x by 1 as	wikipedia
be03a1b2c939eabd596980816f32cf7bccf39602	here, when two guards e i {\displaystyle e_{i}}	here, when two guards e i {\displaystyle e_{i}} and e j {\displaystyle e_{j}} are simultaneously true, then execution of this statement can run any of the associated statement s i {\displaystyle s_{i}} or s j {\displaystyle s_{j}}.	wikipedia
27a375bcaee15b806dd8225bfd140b3099a66a7d	actually, dijkstra's guarded command language (gcl) is an	actually, dijkstra's guarded command language (gcl) is an extension of the simple imperative language given until here with non-deterministic statements. indeed, gcl aims to be a formal notation to define algorithms. non-deterministic statements represent choices left to the actual implementation (in an effective progr...	wikipedia
3fd6722f905b0a5104a29479b8486fdfa6713aa5	this means that in order for the postcondition	this means that in order for the postcondition x > 10 to be true after the assignment, the precondition x > 15 must be true before the assignment. this is also the "weakest precondition", in that it is the "weakest" restriction on the value of x which makes x > 10 true after the assignment.	wikipedia
33f4dd9765bb6e2235f4731a6c4a9a8cac1673f7	the first version avoids a potential duplication of	the first version avoids a potential duplication of x in r, whereas the second version is simpler when there is at most a single occurrence of x in r. the first version also reveals a deep duality between weakest-precondition and strongest-postcondition (see below).	wikipedia
c7760b52046e04c15aca727b6945ed83db2d8d2b	we give below two equivalent weakest-preconditions for the	we give below two equivalent weakest-preconditions for the assignment statement. in these formulas, r {\displaystyle r} is a copy of r where free occurrences of x are replaced by e. hence, here, expression e is implicitly coerced into a valid term of the underlying logic: it is thus a pure expression, totally defined, ...	wikipedia
24ae6d232f01744d461d63a63858dc6dab5869de	we use t to denote the predicate that	we use t to denote the predicate that is everywhere true and f to denote the one that is everywhere false. we shouldn't at least conceptually confuse ourselves with a boolean expression defined by some language syntax, which might also contain true and false as boolean scalars. for such scalars we need to do a type coe...	wikipedia
7382811fa4fee581823884c04a5cc3913d5cf0c0	for a statement s and a postcondition r,	for a statement s and a postcondition r, a weakest precondition is a predicate q such that for any precondition p, { p } s { r } {\displaystyle \{p\}s\{r\}} if and only if p ⇒ q {\displaystyle p\rightarrow q}. in other words, it is the "loosest" or least restrictive requirement needed to guarantee that r holds after s....	wikipedia
256654abb3ed67912f848d8393a0978ab1e987e5	moreover, predicate transformer semantics are a reformulation of	moreover, predicate transformer semantics are a reformulation of floyd–hoare logic. whereas hoare logic is presented as a deductive system, predicate transformer semantics (either by weakest-preconditions or by strongest-postconditions see below) are complete strategies to build valid deductions of hoare logic. in othe...	wikipedia
1926714c77d6af6608084b3ef868522135cf4719	predicate transformer semantics were introduced by edsger dijkstra	predicate transformer semantics were introduced by edsger dijkstra in his seminal paper " guarded commands, nondeterminacy and formal derivation of programs ". they define the semantics of an imperative programming paradigm by assigning to each statement in this language a corresponding predicate transformer: a total f...	wikipedia
e2b0449f9f7e3796e5085ae922834e997fd64830	hassan ahmed el-shazly was an egyptian footballer. he	hassan ahmed el-shazly was an egyptian footballer. he is considered as a historic player of tersana. he was described as a "devastating shooter" and "lethal with both feet". he is the africa cup of nations all-time top egyptian scorer, and the all-time top scorer of the egyptian premier league. el-shazly is considered ...	wikipedia
b6a0722e0f83965042ce062d4ca393a8ffd9c88b	he also represented the egypt national football team,	he also represented the egypt national football team, and was the top scorer with six goals at the 1963 african cup of nations. he played with his country in the 1965 arab games, and egypt won the gold medal, he was the tournament top scorer with 9 goals. el-shazly also played in the 1970 african cup of nations and sco...	wikipedia
b262ab4ff294bb31fcf3a372c54af3e2c7563ff4	el-shazly played for the egyptian team tersana. he	el-shazly played for the egyptian team tersana. he led tersana to its only egyptian league title in the 1963 season. he was the egyptian premier league top goalscorer for four times. as of 2010, this is an egyptian record that still holds. he scored 34 goals as the top league scorer of the 1974–75 egyptian premier leag...	wikipedia
2fafc4169aa8ce8f2dc961ac76aebe366cc9b0d9	hassan ahmed el-shazly (egyptian arabic: حسن الشاذلي, hassan	hassan ahmed el-shazly (egyptian arabic: حسن الشاذلي, hassan el shazly) (13 november 1943 – 20 april 2015) was an egyptian footballer. he is considered as a historic player of tersana. he was described as a "devastating shooter" and "lethal with both feet". he is the africa cup of nations all-time top egyptian scorer, ...	wikipedia