Skip to content
naulon
Not checkedNot checked for notices yet.

Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions

Rusu Andrei

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica · 2014

doi:10.2478/auom-2014-0020 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.