A Conditional Proof in Classical sigma–Calculus

Within the discrete tension formalism (classical sigma–Calculus) we define polynomial–workcomputations (P_sigma ) and witness–verifiable computations (NP_sigma ). Disclaimer updated.

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-05-17
DOI
https://doi.org/10.5281/zenodo.15447651
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Conditional Proof in Classical sigma–Calculus

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
article

A Conditional Proof in Classical sigma–Calculus

article en

Abstract

Within the discrete tension formalism (classical sigma–Calculus) we define polynomial–workcomputations (P_sigma ) and witness–verifiable computations (NP_sigma ). Disclaimer updated.

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Openalex Percentile: Top 76%
Logic, programming, and type systems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.