Work

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

Year: 2014

Type: article

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 .

Source: Analele Universităţii "Ovidius" Constanţa. Seria Matematică

DOI: 10.2478/auom-2014-0020

Author: Andrei Rusu

Institutions: Academy of Sciences of Moldova, Ovidius University, Information Society Development Institute

Language: English

Topic: Advanced Algebra and Logic

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2107946356

FWCI:

Cites: 6

Cited by:

Related to: 10