Talk:Algebraic logic

{{WikiProject banner shell|class=Start|

{{WikiProject Mathematics|priority=mid}}

}}

Combinatory logic?

I really don't see how combinatory logic has the expressive power of set theory. I rather feel like it has the expressive power of finite arithmetic. I haven't thought much about how the article's claim can be interpreted, but perhaps the author meant some other kind of combinatory logic, not the s/b/c/k/i system of combinators in lambda calculus.--128.95.133.33 (talk) 06:00, 22 October 2009 (UTC)

Removed info

I removed this from the history section, but did not want it to be gone completely. I thought it could be added to a sources section, but wasn't sure where.

For the history of algebraic logic before World War II, see Brady (2000) and Grattan-Guinness (2000) and their ample references. For postwar history, see Maddux (1991) and Quine (1976).

Algebraic logic has at least two meanings:

  1. The study of Boolean algebra begun by George Boole, and of relation algebra begun by Augustus DeMorgan, extended by Charles Sanders Peirce, and taking definitive form in the work of Ernst Schröder;
  2. Abstract algebraic logic, a branch of contemporary mathematical logic.

Cerberusrex (talk) 20:38, 14 February 2012 (UTC)

:19th century relation algebra ended with Schroeder, but the topic was revived by Tarski in 1941 with his axioms for the algebra of binary relations, with very strong subsequent development. This is summarized in the thousand-page two-volume treatise 'Relation Algebras' by Steven Givant: vol. 1, Introduction to Relation Algebras, vol. 2, Advanced Topics in Relation Algebras, both Springer 2017. The Introduction to vol. 1 includes 'A Brief History' p. xiv-xxi, describing Tarski as consciously setting out "to revitalize and modernize the subject." 67.249.83.179 (talk) 23:03, 28 September 2024 (UTC)