The Principia Rewrite

🌌 Supplementary materials for Discrete Math course at ITMO University

LogiCola helps you learn logic. This is a web version of the original software built by the late Professor Harry Gensler.

Python library for computational formal logic, formal semantics, and theorem proving

An exhaustive condensed detachment formal proof generator for Hilbert systems in proof theory.

📏 Logic rule learning for computer networking

This is the repository for our CSC-490 project at UNCG in the Spring 2021 semester.

➡️Formal logic deduction based on system-L

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.

Kripke semantics

A Python package for deal with logical formulas and formal systems (e.g. FOL)

SATRAP-DL: Semi-Automated Threat Reconnaissance and Analysis Powered by DECIPHER Logic. 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.

A Python library providing basic functionalities for manipulating propositional logic

🐝 LaTeX style for Linear Style Natural Deduction proofs similar to way found in COMP11120 at UoM

A Lean 4 formal lab that mathematically guarantees the structural boundaries for NF Set Theory.

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.

Automata and Logic on Infinite Objects course, Computer Science M.Sc., Ben Gurion University, 2020

Representación simbólica y clasificación de proposiciones: variables proposicionales, conectivas lógicas, tablas de verdad, tautologías, contradicciones y contingencias. Lógica Computacional, Ingeniería Informática.

A minimal implementation of an expansion-based QBF solver which does not use recursion.

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.