Uniform provability in classical logic

DOI10.1093/logcom/8.2.209zbMath0910.03032arXivcs/9809014OpenAlexW1966944960MaRDI QIDQ4399719

Gopalan Nadathur

Publication date: 12 April 1999

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9809014

zbMATH Keywords

sequent calculusclassical logicuniform proofsclassical derivabilityGlivenko-classesintuitionistic derivability

Mathematics Subject Classification ID

Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ On structuring proof search for first order linear logic ⋮ Correspondences between classical, intuitionistic and uniform provability