Conversation

Notices

1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Sunday, 05-Nov-2017 20:56:24 EST ∑ XahLee

   2 major branch of philosophy of math foundation are: ① logicism (reduce to logic). ② formalism (reduce string transformation).

   i subscribe to both. In particular, formalism.

   logicism tries to reduce math to logic. Russell + Whitehead's Principia Mathematica was the foundational work.

   formalism is considering math to be merely manipulation of formulas, by some rules. Much like prog lang grammar or string rewrite.

   1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Sunday, 05-Nov-2017 20:56:48 EST ∑ XahLee

      in reply to

      (btw, can think of lisp macros, except lispers are idiots. Mathematica's symbolic pattern matching, is the term rewriting system)

      modern logic became pretty much “SYMBOLIC logic”, and that is easily converted to formalism.

      logicisim and formalism, as practiced today, is pretty much type theory languages. e.g. #coq #agda #idris but not #haskell idiots

      1. ∑ XahLee (xahlee@noagendasocial.com)'s status on Sunday, 05-Nov-2017 20:57:22 EST ∑ XahLee

         in reply to

         formalism, is the FORM of formal, as in, formal proof, formula, formal language, and parser, string/term rewrite system

         lambda calculus, and typed lambda calculus, are formalism. i.e. string rewrite. Or, think of it as find and replace text. #lisp #scheme

         programing language grammar spec, is specifying the rules for string rewrite. (so that all valid “string” (source code) can be generated)

         and “parsing” is, given a string (source code), determine which rewrite rules are used to gen it.