The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Using an inductive definition of normal terms of the theory of Cartesian Closed
Categories with a given graph of distinguished morphisms, we give a reduction free
proof of the decidability of this theory. This inductive definition enables us to
show via functional completeness that extensions of such a theory by new constants
(“indeterminates”) are conservative.
Currently displaying 1 –
14 of
14