Quantifier handling issues in computer-oriented intuitionistic calculi

MaRDI QIDQ2784641zbMATH OpenFDO

Authors Alexander Lyaletski

Publication date 25 July 2002

zbMATH Keywords

admissible substitutionsfirst-order intuitionistic logicinference search efficiencyquantifier rulesequent calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70)

Recommendations

• Foundations of Information and Knowledge Systems
• An Intuitionistic Predicate Logic Theorem Prover
• scientific article; zbMATH DE number 2120024
• On Herbrand’s Theorem for Intuitionistic Logic
• Optimization techniques for propositional intuitionistic logic and their implementation

Cited in

(4)

• Computational Semantics for Monadic Quantifiers
• Study of inference rules for quantifiers in first-order logic inference system
• Computing with Numbers and Other Non-syntactic Things: De re Knowledge of Abstract Objects†
• Foundations of Information and Knowledge Systems

This page was built for publication: Quantifier handling issues in computer-oriented intuitionistic calculi

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