scientific article; zbMATH DE number 857449

zbMATH Open0840.03012MaRDI QIDQ4870286FDOQ4870286

Authors: Mefodie Raţă, Andrei Rusu 

Publication date: 10 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
• On non-tabular \(m\)-pre-complete classes of formulas in the propositional provability logic
• scientific article; zbMATH DE number 6476595
• scientific article; zbMATH DE number 1148290
• On predicate provability logics and binumerations of fragments of Peano arithmetic
• Publication:4731166
• Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
• Predicate Logics of Constructive Arithmetical Theories
• The formulae-as-classes interpretation of constructive set theory
• scientific article; zbMATH DE number 1989643

zbMATH Keywords

provability logicinfinite binary sequencesdiagonalizable algebra

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Logical aspects of Boolean algebras (03G05)

Cited In (4)

• On non-tabular \(m\)-pre-complete classes of formulas in the propositional provability logic
• Infinitely many functional pre-complete classes of formulas in the propositional provability intuitionistic logic
• Title not available (Why is that?)
• Extensions of the provability logic

This page was built for publication:

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