On the absence of finite approximation relative to model completeness in propositional provability logic

zbMATH Open1351.03059MaRDI QIDQ2833438FDOQ2833438

Olga Izbash, Andrei Rusu

Publication date: 18 November 2016

Published in: Buletinul Academiei de Științe a Republicii Moldova. Matematica (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/basm/issues/y2015-n3/12125/

zbMATH Keywords

model completenessexpressibilitydiagonalizable algebraprovabilty logic

Mathematics Subject Classification ID

Boolean functions (06E30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cited In (2)

• A purely model-theoretic proof of the exponential succinctness gap between CTL\(^{+}\) and CTL
• Title not available (Why is that?)

This page was built for publication: On the absence of finite approximation relative to model completeness in propositional provability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2833438)