Scott induction and closure under \(\omega\)-sups

DOI10.1016/0304-3975(86)90179-9zbMath0611.68008OpenAlexW1971339442MaRDI QIDQ1087326

Richard Statman, Ana Pasztor

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90179-9

zbMATH Keywords

LCFcomplete partial orderslogic computable functionalslogic of continuous functionalsScott's induction axiom

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

The equational logic of fixed points ⋮ Completeness of Park induction

Cites Work

• Set theory. An introduction to large cardinals
• Edinburgh LCF. A mechanized logic of computation
• Unnamed Item
• Unnamed Item