scientific article; zbMATH DE number 1348467
From MaRDI portal
Publication:4264720
zbMath0925.03066MaRDI QIDQ4264720
No author found.
Publication date: 10 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mechanization of proofs and logical operations (03B35) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (13)
On proof normalization in linear logic ⋮ First-order linear logic without modalities is NEXPTIME-hard ⋮ Two loop detection mechanisms: A comparison ⋮ On the intuitionistic force of classical search (Extended abstract) ⋮ Proof-search in intuitionistic logic based on constraint satisfaction ⋮ A resolution theorem prover for intuitionistic logic ⋮ Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification ⋮ Correct Answers for First Order Logic ⋮ The Skolemization of existential quantifiers in intuitionistic logic ⋮ Representing scope in intuitionistic deductions ⋮ On the intuitionistic force of classical search ⋮ Correspondences between classical, intuitionistic and uniform provability ⋮ A proof procedure for the logic of hereditary Harrop formulas
Uses Software
This page was built for publication:
