Gastos de envío:
GRATIS
A Estados Unidos de America
Descripción Soft Cover. Condición: new. Nº de ref. del artículo: 9783540139010
Descripción Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9783540139010_lsuk
Descripción PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783540139010
Descripción Condición: New. pp. 488. Nº de ref. del artículo: 26533300
Descripción Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Contiguous R.E. Degrees.- Abstract construction of counterexamples in recursive graph theory.- Minimal degrees and 1-generic sets below 0 .- Undecidability and recursive equivalence II.- Logical syntax and computational complexity.- Subrecursive hierarchies via direct limits.- A star-finite relational semantics for parallel programs.- Between constructive and classical mathematics.- Partial closures and semantics of while: Towards an iteration-based theory of data types.- Toward logic tailored for computational complexity.- On a new notion of partial conservativity.- Finitely approximable sets.- A unified approach to constructive and recursive analysis.- On faithful interpretability.- Abstract recursion as a foundation for the theory of algorithms.- Some logical problems connected with a modular decomposition theory of automata.- Diophantine equations in a fragment of number theory.- Generalized rules for quantifiers and the completeness of the intuitionistic operators &, , , , , .- On subsets of the Skolem class of exponential polynomials.- Effective operators in a topological setting.- An axiomatization of the apartness fragment of the theory DLO+ of dense linear order. 488 pp. Englisch. Nº de ref. del artículo: 9783540139010
Descripción Condición: New. Print on Demand pp. 488 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Nº de ref. del artículo: 8363243
Descripción Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Contiguous R.E. Degrees.- Abstract construction of counterexamples in recursive graph theory.- Minimal degrees and 1-generic sets below 0 .- Undecidability and recursive equivalence II.- Logical syntax and computational complexity.- Subrecursive hierarchies via direct limits.- A star-finite relational semantics for parallel programs.- Between constructive and classical mathematics.- Partial closures and semantics of while: Towards an iteration-based theory of data types.- Toward logic tailored for computational complexity.- On a new notion of partial conservativity.- Finitely approximable sets.- A unified approach to constructive and recursive analysis.- On faithful interpretability.- Abstract recursion as a foundation for the theory of algorithms.- Some logical problems connected with a modular decomposition theory of automata.- Diophantine equations in a fragment of number theory.- Generalized rules for quantifiers and the completeness of the intuitionistic operators &, , , , , .- On subsets of the Skolem class of exponential polynomials.- Effective operators in a topological setting.- An axiomatization of the apartness fragment of the theory DLO+ of dense linear order. Nº de ref. del artículo: 9783540139010
Descripción Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contiguous R.E. Degrees.- Abstract construction of counterexamples in recursive graph theory.- Minimal degrees and 1-generic sets below 0?.- Undecidability and recursive equivalence II.- Logical syntax and computational complexity.- Subrecursive hierarchies. Nº de ref. del artículo: 4882388