Thursday 8 August 2019

Combinatory Logic: A Quick Take (being built)


Self-membership, and self-application are terms associated with the reasons for the creation of the branch of logic designated by the expression Combinatory Logic (Bimbo 2016, para. 6).

Self-membership is the central topic of the Russell’s Paradox, and this paradox is considered unsolvable by many experts (Sion 2017, p. 130).

Combinatory Logic has been invented by Shönfinkel, and it was developed by Curry in the 1920s (Baker 2019, para. 2). Both of them are classified as mathematician-logician [(Fracademic 2019), (Seldin 2019)].

             Moses Schönfinkel                    Haskell Brooks Curry
                    (1889-1942)                                  (1900-1982)
          Born in Dnipro, Ukraine           Born in Massachusetts, US
  

[(Pngkey.com 2018), (Fracademic 2019)]         (Seldin 2019)    


In Combinatory Logic, any expression can be combined with any other expression (Baker 2019, para. 2).

Its special symbols are ‘B’, ‘I’, ‘K’, ‘S’, and ‘W’ [(Seldin 2019, para. 34), 
(Baker 2019, para. 2)], and these letters seem to originate in the German language: 
Identität/Identity (I), Wiederholen/Repeat (W), Konstanten/Constant (K),  
Substitutionsprozesse/Substitution processes (S), and Beherbergen/Take in (B) 
[(Curry, H 1930), (Google.com 2019)].

It also uses parenthesis, and variables, and its variables are single characters, such as ‘x’, and ‘y’ (Baker 2019, para. 2).

I is the identity operator, and it is defined to be \x x [(Seldin 2019, para. 4), (Pryor 2015, para. 3)].

K is the constancy operator, and it is defined to be \x y. x: K eliminates its second a
rgument [(Seldin 2019), (Pryor 2015, para. 4)].

S is the distributor, and it is defined to be \f g x. f x (g x): S copies its third argument, and distributes it over the arguments that precede it [(Seldin 2019), (Pryor 2015, para. 5)].

B is the composition, and it is defined to be \f g x. f (g x): B changes f into a function, and then g, and x into its arguments (Pryor 2015, para. 8).

W is defined to be \f x. f x x: W doubles x (Pryor 2015, para. 11).

References

Bimbo, K 2016, Combinatory Logic, Stanford, viewed 1 August 2019, <https://plato.stanford.edu/entries/logic-combinatory/#ReduEquaTheiForm>

Barker, C 2019, Combinatory Logic Tutorial, viewed 1 August 2019, <http://www.nyu.edu/projects/barker/Lambda/ski.html>

Pryor, J 2015, Week3 Combinatory Logic, Combinators and Combinatory Logic, viewed 1 August 2019, <http://lambda.jimpryor.net/topics/week3_combinatory_logic/>

Pngkey.com 2018, File – Schonfinkel – Moses Schonfinkel, viewed 1 August 2019, < https://www.pngkey.com/detail/u2e6a9t4w7y3q8u2_file-schonfinkel-moses-schnfinkel/>

Seldin, J 2019, Haskell Brooks Curry, viewed 1 August 2019, <https://www.iep.utm.edu/curry/>

Fracademic 2019, Moses Schonfinkel, viewed 1 August 2019, <https://fracademic.com/dic.nsf/frwiki/1190889>

Curry, H 1930, “Grundlagen der Kombinatorischen Logik”, American Journal of Mathematics, vol. 52, no. 3, pp. 509-538, viewed 8 August 2019, <https://www.jstor.org/stable/2370619?read-now=1&seq=5#page_scan_tab_contents>

Google.com 2019, Google Translate, consulted 8 August 2019, <https://www.google.com/search?q=google+translate&rlz=1C1GCEU_enAU820AU820&oq=google+translate&aqs=chrome.0.69i59j69i64l2j69i60.4245j0j8&sourceid=chrome&ie=UTF-8>