scientific article; zbMATH DE number 1045389

zbMATH Open0870.03011MaRDI QIDQ4347145FDOQ4347145

Authors: Alex Hendriks 

Publication date: 7 August 1997

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

Recommendations

• Computations in fragments of intuitionistic propositional logic
• scientific article; zbMATH DE number 823603
• Intuitionistic implication without disjunction
• Effective Finite-Valued Approximations of General Propositional Logics

zbMATH Keywords

model checkingintuitionistic logicmodal logicderivabilityexact modelsfinite fragments of propositional logicsfinite Lindenbaum algebravalidity of formulas

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35)

Cited In (16)

• Computations in fragments of intuitionistic propositional logic
• Propositional computability logic I
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• Propositional computability logic II
• Towards logical operations research -- propositional case
• Toggling operators in computability logic
• Intermediate logics and factors of the Medvedev lattice
• The many faces of interpolation
• Notes on my scientific life
• Title not available (Why is that?)
• Duality and universal models for the meet-implication fragment of IPC
• Brodskio kodavimo metodas teiginių logikai;Brodsky’s coding method for propositional logic
• Free equivalential algebras
• Doing logic by computer: Interpolation in fragments of intuitionistic propositional logic
• Partial-predicate logic in computer science
• Algebras defined from ordered sets and the varieties they generate

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 Q4347145)