On the completenes principle: A study of provability in heyting's arithmetic and extensions

DOI10.1016/0003-4843(82)90024-9zbMath0505.03026OpenAlexW2015175446MaRDI QIDQ4740561

Albert Visser

Publication date: 1982

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(82)90024-9

zbMATH Keywords

provability logicHeyting's arithmeticstrong Loeb principle

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Metamathematics of constructive systems (03F50) Relative consistency and interpretations (03F25)

Related Items (22)

Linear Logic Properly Displayed ⋮ The Henkin Sentence ⋮ Hypersequents, logical consequence and intermediate logics for concurrency ⋮ Church's thesis, continuity, and set theory ⋮ Hard provability logics ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Intermediate logics and the de Jongh property ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ First-order satisfiability in Gödel logics: an NP-complete fragment ⋮ Provability logic and the completeness principle ⋮ Rules and arithmetics ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\) ⋮ THE -PROVABILITY LOGIC OF ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic ⋮ Closed Fragments of Provability Logics of Constructive Theories ⋮ Unnamed Item ⋮ Continuous Fraïssé conjecture ⋮ Connecting fuzzy logic and argumentation frames via logical attack principles ⋮ Predicate Logics of Constructive Arithmetical Theories ⋮ Terminating calculi for propositional Dummett logic with subformula property ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS

This page was built for publication: On the completenes principle: A study of provability in heyting's arithmetic and extensions