On propositional quantifiers in provability logic

DOI10.1305/NDJFL/1093634729zbMath0805.03009OpenAlexW2142069707MaRDI QIDQ1317986

Sergej N. Artemov, Lev D. Beklemishev

Publication date: 21 April 1994

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093634729

zbMATH Keywords

first-order theorypropositional quantifiersprovability logic0-generated subalgebraDiagonalizable Algebra of Peano Arithmeticfree diagonalizable algebrarecursive progressions of theories with quantifiers ranging over their ordinal notations

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items (5)

Franco Montagna's work on provability logic and many-valued logic ⋮ Linear $ \mathrm{GLP}$-algebras and their elementary theories ⋮ Undecidability in diagonalizable algebras ⋮ Second-order propositional modal logic and monadic alternation hierarchies ⋮ Unnamed Item

This page was built for publication: On propositional quantifiers in provability logic