A concrete final coalgebra theorem for ZF set theory

DOI10.1007/3-540-60579-7_7zbMath1530.03152arXivcs/9511103OpenAlexW1607226358MaRDI QIDQ6061877

Lawrence Charles Paulson

Publication date: 8 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9511103

zbMATH Keywords

foundation axiomvariant functioncumulative hierarchysubstitution lemmaidentity functor

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of set theory (03E75) Axiomatics of classical set theory and its fragments (03E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Set theory. An introduction to independence proofs
• Co-induction in relational semantics
• Set theory for verification. I: From foundations to functions
• Set theory for verification. II: Induction and recursion
• Terminal coalgebras in well-founded set theory
• A final coalgebra theorem
• A fixedpoint approach to implementing (Co)inductive definitions

This page was built for publication: A concrete final coalgebra theorem for ZF set theory