Fixed-point elimination in the intuitionistic propositional calculus

DOI10.1145/3359669MaRDI QIDQ4972168zbMATH OpenWikidataFDO

Authors Silvio Ghilardi, Luigi Santocanale, Maria João Gouveia

Publication date 22 November 2019

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2434/680151

zbMATH Keywords

eliminationfixed-pointsintuitionistic propositional calculus

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Heyting algebras (lattice-theoretic aspects) (06D20)

Recommendations

• Fixed-Point Elimination in the Intuitionistic Propositional Calculus
• Least and greatest fixed points in intuitionistic natural deduction
• On the equational definition of the least prefixed point.
• Least fixed points in Grzegorczyk's logic and in the intuitionistic propositional logic
• On an interpretation of second order quantification in first order intuitionistic propositional logic

Cited in

(10)

• On the equational definition of the least prefixed point.
• Computing least and greatest fixed points in absorptive semirings
• Fixed-Point Elimination in the Intuitionistic Propositional Calculus
• Predicate Elimination for Preprocessing in First-Order Theorem Proving
• A Function Elimination Method for Checking Satisfiability of Arithmetical Logics
• On the period of sequences (Aⁿ(p)) in intuitionistic propositional calculus
• scientific article; zbMATH DE number 1303431 (Why is no real title available?)
• Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
• Ruitenburg's theorem via duality and bounded bisimulations
• Least and greatest fixed points in intuitionistic natural deduction

This page was built for publication: Fixed-point elimination in the intuitionistic propositional calculus

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