Intermediate Formal Logic and AI (= IFLAI2)
Fall 2021 edition of IFLAI2
Selmer Bringsjord

Table of Contents

A "fully fungible" (in-person ∨ online ∨ hybrid) course, thanks to singular AI technology.

Selmer Bringsjord
with Naveen Sundar G. \(\wedge\) …



Figure 2: Larry


Figure 3: Lucy

[All artwork (all of which is copyrighted) for the LAMA paradigm by KB Foushee.]

General Orientation

This course gives advanced, accelerated coverage of intermediate formal logic and logic-based (= logicist) AI. The course makes crucial use of AI for learning, and also provides coverage of selected “big questions” in and arising from logicist AI. In addition, students are exposed to a pure and general form of logic programming, so-called Pure General Logic Programming (PGLP), and will be able to themselves write not only proofs, but proofs that include functional code written in Clojure, in the new logic-programming language HyperLog®.


First, students new to AI should read this overview of the field.

Next, students will purchase access to and obtain the symbiotically interconnected trio of

  1. the e-text /Logic: A Modern Approach; Beginning Deductive Logic via HyperSlate® and HyperGrader®, Advanced/ (LAMA-BDLHSHGA);
  2. the HyperSlate® software system for (among other things) proof and program construction in collaboration with AI technology (= the “oralces”); and
  3. HyperGrader®, an AI-infused online system for assessing student progress.

Each member of this trio will be available online after purchase of the relevant code-carrying envelope in the RPI Bookstore. Full logistics of this purchase, and the content of the envelope and how to proceed from this content, will be explained the first class (and subsequently, as needed). Updates to LAMA-BDLHSHGA, and additional exercises, will be provided by listing on relevant HyperGrader® web pages upon signing in (and sometimes by email) through the course of the semester. You will need to manage many electronic files in this course, and e-housekeeping and e-orderliness are of paramount importance. You will specifically need to assemble a library of completed and partially completed proofs so that you can use them as building blocks in harder proofs; in other words, building up your own “logical library” will be crucial.

Please note that HyperGrader® and HyperSlate® are each copyrighted, trademarked, and Pat. Pend.: copying and/or distributing this software to others is strictly prohibited. You will be asked to AGREE online after the time of registration to a License Agreement. This agreement will also cover the etextbook, which is copyrighted as well, and cannot be copied or distributed in any way, even in part.

In addition, occasionally papers will be assigned as reading.

Finally, slide decks used in class will contain crucial additional content above and beyond LAMA-BDLHSHGA, information posted on HyperGrader®, and in your library for HyperSlate®; this additional content will be available on the web site as the course unfolds through time.


The version of the course now underway is the Fall 2021 edition, the syllabus for which is available here. This is a robust, detailed syllabus, and is required reading — and reading that will pay off, for sure.


This is the interactive software system used for constructing proofs and arguments, and — in HyperLog® — Clojure functions, in collaboration with AI technology, and is available here after registering, agreeing to the license agreement, and signing into HyperGrader®.


This is the AI system for submitting, getting assessed, and earning trophies and learderboard points for proofs, arguments, and — in HyperLog® — Clojure functions constructed in HyperSlate® in the programming langauge , and is available here after registration and by sign-in.


This is the e-textbook for the course, and is obtained after registration and sign-in to HyperGrader®, via download. New versions of the book will appear directly in HyperGrader® for download.

Class-Day Topic and Content (includes associated slide decks, video lectures, and — sometimes — tutorials, etc.)

Please note that for many classes there will be a slide deck and a video lecture (but the video lecture often will not be posted until after synchronous in-person instruction, and in some cases may not be posted, in order to prevent certain data from being fully public).


Informal Exercises and Metalogical Homeworks

These are assigned and discussed by direct point-to-point email.



Warning: Increasingly, the term ‘reasoning’ is used by some who don’t really do anything related to reasoning, as traditionally understood, to nonetheless label what they do. Fortunately, it’s easy to verify that some reasoning is that which is covered by formal logic: If the reasoning is explicit; links declarative statements or formulae together via explicit, abstract reasoning schemata or rules of inference (giving rise to at least explicit arguments, and often proofs); is surveyable and inspectable, and ultimately machine-checkable; then the reasoning in question is what formal logic is the science and engineering of. (An immediate consequence of the characteristics just listed is that AIs based on artificial neural networks don’t reason, ever.) In order to characterize /in/formal logic, one can remove from the previous sentence the requirements that the links must conform to explicit reasoning schemata or rules of inference, and machine-checkability. It follows that so-called informal logic would revolve around arguments, but not proofs. An excellent overview of informal logic, which will be completely ignored in this class, is provided in “Informal Logic” in the Stanford Encyclopedia of Philosophy. In this article, it’s made clear that, yes, informal logic concentrates on the nature and uses of argument.

Author: Selmer Bringsjord

Created: 2021-12-11 Sat 09:09

Emacs (Org mode 8.2.10)