Correspondences between classical, intuitionistic and uniform provability
type: Item
instance of: scholarly article
title: Correspondences between classical, intuitionistic and uniform provability
zbMATH Open document ID: 0951.03048
DOI: 10.1016/S0304-3975(99)00177-2
author: Gopalan Nadathur
published in: Theoretical Computer Science
publication date: 2000-08-23T00:00:00Z
Mathematics Subject Classification ID: 03F03
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 1495202
zbMATH Keywords: proof search
zbMATH Keywords: derivability relations over sequents
zbMATH Keywords: classical provability
zbMATH Keywords: intuitionistic provability
zbMATH Keywords: uniform provability
zbMATH Keywords: goal-directedness
zbMATH Keywords: abstract logic programming languages
MaRDI profile type: Publication
cites work: Orderings for term-rewriting systems
cites work: Q3880841
cites work: Contraction-free sequent calculi for intuitionistic logic
cites work: Q3996619
cites work: N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
cites work: Q5610986
cites work: Computation with run time skolemisation (N-Prolog part 3)
cites work: A Proof-theoretic Analysis of Goal-directed Provability
cites work: Q3997528
cites work: Q5813181
cites work: Q4016556
cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
cites work: Uniform proofs as a foundation for logic programming
cites work: Q5343328
cites work: A proof procedure for the logic of hereditary Harrop formulas
cites work: Uniform provability in classical logic
cites work: On Glinvenko sequent classes
cites work: Q5559220
cites work: Proof-terms for classical and intuitionistic resolution
cites work: Q4264720
cites work: Q4716271
full work available at URL: s0304-3975(99)00177-2
OpenAlex ID: W1818789084
Wikidata QID: Q127857929
Recommended article: Classical provability of uniform versions and intuitionistic provability
Recommended article: Uniform provability in classical logic
Recommended article: Q3731572
Recommended article: A Note on the Complexity of Classical and Intuitionistic Proofs
Recommended article: Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$
Recommended article: Q3495352
Recommended article: Unified correspondence as a proof-theoretic tool
Recommended article: Intuitionistic completeness and classical logic
Recommended article: Q3016126
Recommended article: Q4499151
description: scientific article; zbMATH DE number 1495202