On the completenes principle: A study of provability in heyting's arithmetic and extensions
From MaRDI portal
Publication:4740561
Cited in
(24)- scientific article; zbMATH DE number 7204446 (Why is no real title available?)
- Terminating calculi for propositional Dummett logic with subformula property
- Predicate Logics of Constructive Arithmetical Theories
- Closed Fragments of Provability Logics of Constructive Theories
- Nested sequents for intermediate logics: the case of Gödel-Dummett logics
- Rules and arithmetics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)
- Hypersequents, logical consequence and intermediate logics for concurrency
- Provability logic and the completeness principle
- Church's thesis, continuity, and set theory
- Notes on my scientific life
- The \(\Sigma_1\)-provability logic of HA revisited
- Hard provability logics
- Continuous Fraïssé conjecture
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Intermediate logics and the de Jongh property
- Linear Logic Properly Displayed
- Lewis meets Brouwer: constructive strict implication
- The Henkin sentence
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}^{*}\)
- First-order satisfiability in Gödel logics: an NP-complete fragment
- Connecting fuzzy logic and argumentation frames via logical attack principles
This page was built for publication: On the completenes principle: A study of provability in heyting's arithmetic and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740561)
