Ceres in intuitionistic logic
DOI10.1016/J.APAL.2017.04.001zbMATH Open1422.03121OpenAlexW2605134847MaRDI QIDQ2363201FDOQ2363201
Authors: Giselle Reis, Simon Wolfsteiner, David M. Cerna, Alexander Leitsch 
Publication date: 13 July 2017
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2017.04.001
Recommendations
Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)
Cites Work
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Lower Bounds on Herbrand's Theorem
- Title not available (Why is that?)
- Computer Science Logic
- Linear algebra and geometry. Translated from the Russian by David Kramer and Lena Nekludova
- Towards CERes in intuitionistic logic
- Methods of cut-elimination
- Cut-elimination: syntax and semantics
- Logic for Programming, Artificial Intelligence, and Reasoning
- Cut-elimination and redundancy-elimination by resolution
- CERES in higher-order logic
- Logic for Programming, Artificial Intelligence, and Reasoning
- CERES: An analysis of Fürstenberg's proof of the infinity of primes
- Title not available (Why is that?)
- Cut-Elimination and Proof Schemata
Cited In (3)
Uses Software
This page was built for publication: Ceres in intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363201)
