scientific article; zbMATH DE number 3628934
From MaRDI portal
Publication:4190621
zbMath0405.03020MaRDI QIDQ4190621
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Category TheorySymbolic ComputationColimitsPartial OrderCountable Algebraic DomainEffectively Given Domain
Partial orders, general (06A06) Symbolic computation and algebraic computation (68W30) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Theory of numerations, effectively presented structures (03D45)
Related Items (4)
Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Semantics of algorithmic languages ⋮ Admissible representations of effective cpo's
This page was built for publication: