Switch to: References

Add citations

You must login to add citations.
  1. Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability logic is interesting because (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Completeness of the Gödel–Löb Provability Logic for the Filter Sequence of Normal Measures.Mohammad Golshani & Reihane Zoghifard - 2024 - Journal of Symbolic Logic 89 (1):163-174.
    Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.
    Download  
     
    Export citation  
     
    Bookmark  
  • Non–well-founded derivations in the gödel-löb provability logic.Daniyar Shamkanov - 2020 - Review of Symbolic Logic 13 (4):776-796.
    We consider Hilbert-style non–well-founded derivations in the Gödel-Löb provability logic GL and establish that GL with the obtained derivability relation is globally complete for algebraic and neighbourhood semantics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Taming the ‘Elsewhere’: On Expressivity of Topological Languages.David Fernández-Duque - 2024 - Review of Symbolic Logic 17 (1):144-153.
    In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not expressible with closure and elsewhere. To (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A topological completeness theorem for transfinite provability logic.Juan P. Aguilera - 2023 - Archive for Mathematical Logic 62 (5):751-788.
    We prove a topological completeness theorem for the modal logic $$\textsf{GLP}$$ GLP containing operators $$\{\langle \xi \rangle :\xi \in \textsf{Ord}\}$$ { ⟨ ξ ⟩ : ξ ∈ Ord } intended to capture a wellordered sequence of consistency operators increasing in strength. More specifically, we prove that, given a tall-enough scattered space X, any sentence $$\phi $$ ϕ consistent with $$\textsf{GLP}$$ GLP can be satisfied on a polytopological space based on finitely many Icard topologies constructed over X and corresponding to the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation