Arithmetical Completeness of the Intuitionistic Logic of Proofs
From MaRDI portal
Publication:3094147
DOI10.1093/LOGCOM/EXP041zbMATH Open1252.03139OpenAlexW2093881948MaRDI QIDQ3094147FDOQ3094147
Authors: Evgenij Dashkov 
Publication date: 21 October 2011
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exp041
Recommendations
- The basic intuitionistic logic of proofs
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic
- Logics of proofs and justifications
- scientific article; zbMATH DE number 1735872
- scientific article; zbMATH DE number 4150121
- Publication:3201044
- Explicit provability and constructive semantics
- Church's thesis from the point of view of provability interpretation
- The interpretability logic of all reasonable arithmetical theories. The new conjecture
Metamathematics of constructive systems (03F50) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cited In (17)
- A proof theory for the logic of provability in true arithmetic
- Title not available (Why is that?)
- Intuitionistic hypothetical logic of proofs
- The basic intuitionistic logic of proofs
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- An approach to general proof theory and a conjecture of a kind of completeness of intuitionistic logic revisited
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- On arithmetical completeness of the logic of proofs
- Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
- Hypothetical logic of proofs
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Title not available (Why is that?)
- Intermediate logics and the de Jongh property
- Title not available (Why is that?)
- Weak arithmetical interpretations for the logic of proofs
- On strictly arithmetical completeness in logics of programs
- PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
This page was built for publication: Arithmetical Completeness of the Intuitionistic Logic of Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094147)
