Recognizability of all WIP-minimal logics

DOI10.1134/S0037446618010196MaRDI QIDQ1642315

Veta Fedorovna Yun

Publication date: 20 June 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

decidabilityminimal logicinterpolation propertyrecognizable logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (1)

Extensions of the minimal logic and the interpolation problem

Cites Work

• Unnamed Item
• Interpolation and definability over the logic Gl
• Decidability of the weak interpolation property over the minimal logic
• Recognizable logics
• Negative equivalence over the minimal logic and interpolation
• Strong decidability and strong recognizability
• The decidability of Craig's interpolation property in well-composed J-logics
• WIP-minimal logics and interpolation
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• A method of proving interpolation in paraconsistent extensions of the minimal logic
• The decidability of the Kreisel-Putnam system

This page was built for publication: Recognizability of all WIP-minimal logics