The Principia Rewrite
🌌 Supplementary materials for Discrete Math course at ITMO University
Python library for computational formal logic, formal semantics, and theorem proving
This is the repository for our CSC-490 project at UNCG in the Spring 2021 semester.
➡️Formal logic deduction based on system-L
Kripke semantics
A Python package for deal with logical formulas and formal systems (e.g. FOL)
This is an extension of LLAT (the Logic-Learning Assistance Tool) which aims to improve its pedagogical value and UI, rather than being a mere solution provider.
A Python library providing basic functionalities for manipulating propositional logic
SATRAP-DL (Semi-Automated Threat Reconnaissance and Analysis Powered by DECIPHER Logic), part of project CyFORT, offers a suite of tools for computer-aided CTI analysis and automated incident handling informed by CTI, provided respectively by its sub-systems SATRAP and DECIPHER.
🐝 LaTeX style for Linear Style Natural Deduction proofs similar to way found in COMP11120 at UoM
A Lean 4 formalization of Quine's New Foundations, computationally proving the breakdown of structural proof normalization via extensionality collisions.
A utility for proofs in the propositional calculus. Currently finished - a way of parsing (most) valid strings in the PC as Sentences which can be added to proofs. Working on a mechanism for machine proof.
Automata and Logic on Infinite Objects course, Computer Science M.Sc., Ben Gurion University, 2020
A theoretical framework introducing the Non-Turing Machine: a deterministic, structure-driven model of machine order based on UDML, formal axioms, functional intentionality, and the declarative L-OPS language. This repository consolidates the core papers defining the architecture, logic, and conceptual foundations of this new machine type.
Program for proving elementary algebraic (perspective - geometry) theorems using distributed computations
A minimal implementation of an expansion-based QBF solver which does not use recursion.
URF Axioms — formal axiomatization of the Unified Rigidity Framework, defining primitives, admissibility conditions, and base invariants.
Project that generates step-by-step truth tables from a logic formula. Built with ReactJS.
Add a description, image, and links to the formal-logic topic page so that developers can more easily learn about it.
To associate your repository with the formal-logic topic, visit your repo's landing page and select "manage topics."