Python library for computational formal logic, formal semantics, and theorem proving
-
Updated
May 25, 2025 - Python
Python library for computational formal logic, formal semantics, and theorem proving
Python scripts that provide an interface to work with classical propositional and first-order logic, based on my solutions to the textbook Mathematical Logic Through Python by Nisan and Gonczarowski
A self-taught project about Machine Learning & Deep Learning with Python. Thanks to the countless researchers and developers around the world and their open-source code, particularly Python-based open-source code!
A python script which takes in complex propositional statements and processes them to generate a brute as well as reduced Disjunctive normal form for the statement along with the other information like Truth Table and Dont Cares.
A Python library providing basic functionalities for manipulating propositional logic
Welcome to the central hub for the Unified Information-Density Theory (UIDT) A Transformative framework that redefines the bedrock of physics by positioning information as the core entity from which space, time, matter, and energy arise
A Geometric Constant Exhibiting Temporal Quasi-Crystalline Properties
The Generalized Theory of Mathematical Undefiniteness (GTMØ) is an innovative mathematical and philosophical framework that extends classical concepts of existence, non-existence, and infinity. GTMØ introduces indefiniteness (Ø) as a fourth, irreducible category of reality—beyond what is classically definable in logic and mathematics.
algebra, differential equations, calculus, statistics, probability
Mathematical logic Implementation
Experimenting with intelligent agents utilizing a variety of different algorithmic methods to develop an expert level bot for the card game of Schnapsen.
Домашняя контрольная работа по теории вероятностей
Mathematical logic: a resolution technique
A simple calculator to perform basic mathematical operations.
構成的素数構造(6n±1)と除去関数により、Goldbach予想・Bertrand仮説・Catalan予想を共通基盤から再構成。非構成的証明とも形式整合し、論理強度と実行再現性の両立を実現。GitHubにて統合証明パッケージとして公開。 Using the 6n±1 prime structure and composite exclusion, we reconstruct and unify constructive proofs of Goldbach, Bertrand, and Catalan conjectures, demonstrating formal alignment with classical non-constructive methods.
This repository contains python codes for 100 project euler problems and the answers of the problems.
🧩 Build a community database for Erdős problems, linking them to integer sequences and the OEIS for better access and collaboration.
Add a description, image, and links to the mathematical-logic topic page so that developers can more easily learn about it.
To associate your repository with the mathematical-logic topic, visit your repo's landing page and select "manage topics."