Fixed-Point Elimination in the Intuitionistic Propositional Calculus
From MaRDI portal
Publication:2811336
DOI10.1007/978-3-662-49630-5_8zbMath1475.03069arXiv1601.00402OpenAlexW2976714240MaRDI QIDQ2811336
Silvio Ghilardi, Luigi Santocanale, Maria João Gouveia
Publication date: 10 June 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.00402
Heyting algebras (lattice-theoretic aspects) (06D20) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (1)
Cites Work
- Unnamed Item
- On the \(\mu \)-calculus over transitive and finite transitive frames
- Strong categorical datatypes II: A term logic for categorical programming
- Results on the propositional \(\mu\)-calculus
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Least fixed points in Grzegorczyk's logic and in the intuitionistic propositional logic
- Model completions and r-Heyting categories
- Sheaves, games, and model completions. A categorical approach to nonclassical propositional logics
- Convergence of positive schemes in S4 and Int
- Computable fixpoints in well-structured symbolic model checking
- Strong functors and monoidal monads
- On the Bourbaki–Witt principle in toposes
- Strong functors and interleaving fixpoints in game semantics
- The modalμ-calculus hierarchy over restricted classes of transition systems
- On the period of sequences (An(p)) in intuitionistic propositional calculus
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
- Fixed-Point Theory in the Varieties $\mathcal{D}_{n}$
- Some Notes on Proofs with Alpha Graphs
- Processes, Terms and Cycles: Steps on the Road to Infinity
This page was built for publication: Fixed-Point Elimination in the Intuitionistic Propositional Calculus
