A Formal Approach to P vs NP Conjecture

OSF Preprints (OSF Preprints) 2026 Preprint

Authors: David
Cited by: 0

Abstract

This project contains a detailed academic paper proposing a formal argument for the conjecture P ≠ NP, including SAT examples, decision trees, and combinatorial analysis. The aim is to provide a fully detailed framework for further verification and discussion within the scientific community.

Fields of Study & Subjects

Computability Logic AI Algorithms Formal Methods in Verification Rough Sets and Fuzzy Logic

Publication details

Journal / source
OSF Preprints (OSF Preprints)
Publication date
6 January 2026
Document type
Preprint