Collaborative Calculation and Data Science

colby

sagemath

cornellcollege

facebook

github

google

twitter

depaul

This notebook is a theorem prover for an extended syllogistic logic which allows one to make assertions about comparative cardinalities of finite sets.   The logic is complete and efficiently decidable.  If an assertion follows from a set of assumptions, this notebook displays the proof.  If it doesn't follow, it outputs a counter-model.   

This file is an interpreter for the tiny programming language 1# used in my classes on theory of computation at Indiana University.   For more on 1# and the class, see https://iulg.sitehost.iu.edu/trm.  Right now, this is just for my students.  But if the move to Cocalc turns out well, I might expand this to cover the basics of computability theory.
 

Logic of "all" + verbs + relative clauses, for a class at Indiana University

syllogistic logic + reasoning about the sizes of finite sets

John Siratt