2022 · 16 citations · 22 references
ComputingComputer ScienceMathematicsLogicProgramming LanguagesTheory Of ComputationModel TheoryProof TheoryTheorem ProvingType SystemsFixed-point LogicFixed-point LogicsFixed-point SemanticsFormal Proof SystemsStructural Proof TheoryStructural Theory
Given that (co)inductive types are naturally modelled as fixed points, it is unsurprising that fixed-point logics are of interest in the study of programming languages, via the Curry-Howard (or proofs-as-programs) correspondence. This motivates investigations of the structural proof-theory of fixed-point logics and of their cut-elimination procedures.
22
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
Logical Reversibility of Computation
C. H. Bennett · IBM Journal of Research and Development · 1973 · 3.7K citations
Results on the propositional μ-calculus
Dexter Kozen · Theoretical Computer Science · 1983 · 1.8K citations
Humanities, Mathematics, Logic +4